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 S n 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. ? 2012 Springer-Verlag Berlin Heidelberg.EI
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensivel...
Random numbers are useful in many applications such as Monte Carlo simulation, randomized algorithms...
We present a "practical" algorithm to construct random elements of a finite group. We anal...
A family of pseudorandom generators based on the decisional Di±e- Hellman assumption is proposed. Th...
Abstract. A family of pseudorandom generators based on the decisional DiffieHellman assumption is pr...
International audienceGiven an arbitrary finite nontrivial group, we describe a probabilistic public...
A family of pseudorandom generators based on the decisional Diffie-Hellman assumption is proposed. T...
Abstract. We show that the decisional version of the Ko-Lee assumption for braid groups put forward ...
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensivel...
Pseudorandom Number Generators are deterministic algorithms which take in a value obtained from an e...
Pseudorandom generators are a basic foundation of many cryptographic services and information securi...
Abstract:- Pseudorandom generators are a basic foundation of many cryptographic services and informa...
Abstract. In the cryptographic system a pseudorandom number generator is one of the basic primitives...
We present a new approach to designing public-key cryptosystems, based on covers and logarithmic sig...
Abstract. Cryptography using infinite groups has been studied since about twenty years ago. However,...
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensivel...
Random numbers are useful in many applications such as Monte Carlo simulation, randomized algorithms...
We present a "practical" algorithm to construct random elements of a finite group. We anal...
A family of pseudorandom generators based on the decisional Di±e- Hellman assumption is proposed. Th...
Abstract. A family of pseudorandom generators based on the decisional DiffieHellman assumption is pr...
International audienceGiven an arbitrary finite nontrivial group, we describe a probabilistic public...
A family of pseudorandom generators based on the decisional Diffie-Hellman assumption is proposed. T...
Abstract. We show that the decisional version of the Ko-Lee assumption for braid groups put forward ...
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensivel...
Pseudorandom Number Generators are deterministic algorithms which take in a value obtained from an e...
Pseudorandom generators are a basic foundation of many cryptographic services and information securi...
Abstract:- Pseudorandom generators are a basic foundation of many cryptographic services and informa...
Abstract. In the cryptographic system a pseudorandom number generator is one of the basic primitives...
We present a new approach to designing public-key cryptosystems, based on covers and logarithmic sig...
Abstract. Cryptography using infinite groups has been studied since about twenty years ago. However,...
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensivel...
Random numbers are useful in many applications such as Monte Carlo simulation, randomized algorithms...
We present a "practical" algorithm to construct random elements of a finite group. We anal...