How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A note on computational indistinguishability
Information Processing Letters
Algebraic properties of cryptosystem PGM
Journal of Cryptology
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Private Information Retrieval Based on the Subgroup Membership Problem
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
A Public Key Cryptosystem Based on the Subgroup Membership Problem
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
An Efficient Discrete Log Pseudo Random Generator
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Random Permutations from Logarithmic Signatures
Proceedings of the The First Great Lakes Computer Science Conference on Computing in the 90's
An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem
Journal of Cryptology
A Public Key Cryptosystem Based On A Subgroup Membership Problem
Designs, Codes and Cryptography
Polynomial-time algorithms for permutation groups
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
A Public Key Cryptosystem Based on Non-abelian Finite Groups
Journal of Cryptology
More efficient DDH pseudorandom generators
Designs, Codes and Cryptography
Efficient pseudorandom generators based on the DDH assumption
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
On the provable security of an efficient RSA-Based pseudorandom generator
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Symmetric subgroup membership problems
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
The Twist-AUgmented technique for key exchange
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
How to turn loaded dice into fair coins
IEEE Transactions on Information Theory
Pseudorandom number generators based on random covers for finite groups
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In this article, we describe a new approach for constructing pseudorandom generator using subcovers for large finite groups. The Gennaro generator (J Cryptol 15:91-110, 2005) and Farashahi et al. generator (PKC LNCS 4450: 426-441, 2007) can be specific instances of the new approach. We focus, in particular, on the class of symmetric group Sn and construct the first pseudorandom generator based on non-abelian group whose security can be proven. We successfully carry out a test of the generator based on non-abelian group by using the NIST Statistical Test Suite.