Public quadratic polynomial-tuples for efficient signature-verification and message-encryption
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Multivariate quadratic trapdoor functions based on multivariate quadratic quasigroups
MATH'08 Proceedings of the American Conference on Applied Mathematics
MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Unbalanced oil and vinegar signature schemes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
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
Large superfluous keys in multivariate quadratic asymmetric systems
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
A study of the security of unbalanced oil and vinegar signature schemes
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
MXL3: an efficient algorithm for computing gröbner bases of zero-dimensional ideals
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Implementation of multivariate quadratic quasigroup for wireless sensor network
Transactions on computational science XI
On the relation between the MXL family of algorithms and Gröbner basis algorithms
Journal of Symbolic Computation
MQQ-SIG: an ultra-fast and provably CMA resistant digital signature scheme
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Hi-index | 0.00 |
In this paper, we present an efficient attack on the multivariate Quadratic Quasigroups (MQQ) public key cryptosystem. Our cryptanalysis breaks the MQQ cryptosystem by solving a system of multivariate quadratic polynomial equations using both the MutantXL algorithm and the F4 algorithm. We present the experimental results that show that MQQ systems is broken up to size n equal to 300. Based on these results we show also that MutantXL solves MQQ systems with much less memory than the F4 algorithm implemented in Magma.