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
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
Multivariate Public Key Cryptosystems (Advances in Information Security)
Multivariate Public Key Cryptosystems (Advances in Information Security)
EUROCRYPT'96 Proceedings of the 15th annual 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
High order linearization equation (HOLE) attack on multivariate public key cryptosystems
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Key recovery on hidden monomial multivariate schemes
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Rainbow, a new multivariable polynomial signature scheme
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Differential cryptanalysis for multivariate schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
All in the XL family: theory and practice
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Hi-index | 0.00 |
The multivariate public key cryptosystems (MPKCs) have a bigger scale of private key and public key than conventional number theoretic based public key cryptosystems like RSA, DH, and ECDH. In this paper, we present a method to construct the linear transformations in a private key of MPKC by generalized central symmetric matrices over a finite field of odd characteristic. This method reduces 3/8 of the scale of private key and improves the computation of inverting the linear transformations in decryption or signature generation to 3/4. It also speedups the generation of public and private keys of MPKC. The method can be recursively applied for achieving a further advantage.