A new public key signature scheme based on multivariate polynomials

Authors:
Feng Yuan;Shangwei Zhao;Haiwen Ou;Shengwei Xu
Affiliations:
Beijing Electronic Science and Technology Institute, Beijing, China;Beijing Electronic Science and Technology Institute, Beijing, China;Beijing Electronic Science and Technology Institute, Beijing, China;Beijing Electronic Science and Technology Institute, Beijing, China
Venue:
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Year:
2012

Citing 15
Cited 0

Public quadratic polynomial-tuples for efficient signature-verification and message-encryption

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
FLASH, a Fast Multivariate Signature Algorithm

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
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
C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications 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
Multivariate Public Key Cryptosystems (Advances in Information Security)

Multivariate Public Key Cryptosystems (Advances in Information Security)
Cryptanalysis of SFLASH with Slightly Modified Parameters

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Could SFLASH be Repaired?

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms

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
Practical cryptanalysis of SFLASH

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Building secure tame-like multivariate public-key cryptosystems: the new TTS

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Almost perfect nonlinear power functions on GF(2n): the Welch case

IEEE Transactions on Information Theory
On Almost Perfect Nonlinear Functions Over

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new public key signature scheme based on multivariate polynomials over a finite field with characteristic 2. This scheme has a very simple internal transformation, allowing for efficient signature generation and verification. The security of the scheme is analyzed in detail. The result indicates that the new signature scheme can withstand all known attacks effectively.