Public quadratic polynomial-tuples for efficient signature-verification and message-encryption
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learning Polynomials with Queries: The Highly Noisy Case
SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations
EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem
Journal of Cryptology
Efficient algorithms for solving overdefined systems of multivariate polynomial equations
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient implementations of multivariate quadratic systems
SAC'06 Proceedings of the 13th international conference on Selected areas in 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 building hash functions from multivariate quadratic equations
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Analysis of multivariate hash functions
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
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
Another look at “provable security”. II
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
All in the XL family: theory and practice
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
QUAD: a practical stream cipher with provable security
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient primitives from exponentiation in Zp
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
On the security of IV dependent stream ciphers
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Public-Key cryptography from new multivariate quadratic assumptions
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
| Hi-index | 0.00 |
Berbain, Gilbert, and Patarin presented QUAD, a pseudo random number generator (PRNG) at Eurocrypt 2006. QUAD(as PRNG and stream cipher) may be proved secure based on an interesting hardness assumption about the one-wayness of multivariate quadratic polynomial systems over $\mathbb{F}_{2}$.The original BGP proof only worked for $\mathbb{F}_{2}$ and left a gap to general $\mathbb{F}_{q}$. We show that the result can be generalized to any arbitrary finite field $\mathbb{F}_{q}$, and thus produces a stream cipher with alphabets in $\mathbb{F}_{q}$.Further, we generalize the underlying hardness assumption to specialized systems in $\mathbb{F}_{q}$ (including $\mathbb{F}_{2}$) that can be evaluated more efficiently. Barring breakthroughs in the current state-of-the-art for system-solving, a rough implementation of a provably secure instance of our new PRNG is twice as fast and takes 1/10 the storage of an instance of QUADwith the same level of provable security.Recent results on specialization on security are also examined. And we conclude that our ideas are consistent with these new developments and complement them. This gives a clue that we may build secure primitives based on specialized polynomial maps which are more efficient.