Fast Three-Input Multipliers over Small Composite Fields for Multivariate Public Key Cryptography

2015 ◽  
Vol 9 (9) ◽  
pp. 165-178 ◽  
Author(s):  
Haibo Yi ◽  
Weijian Li
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
Multivariate Public Key

scholarly journals An Improved Identity-Based Multivariate Signature Scheme Based on Rainbow

Cryptography ◽  
2019 ◽  
Vol 3 (1) ◽  
pp. 8 ◽  
Author(s):  
Le Luyen
Keyword(s):  
Quantum Cryptography ◽  
Public Key Cryptography ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Identity Based ◽  
Post Quantum Cryptography ◽  
Multivariate Public Key

Multivariate Public Key Cryptography (MPKC) is one of the main candidates for post-quantum cryptography, especially in the area of signature schemes. In this paper, we instantiate a certificate Identity-Based Signature (IBS) scheme based on Rainbow, one of the most efficient and secure multivariate signature schemes. In addition, we revise the previous identity-based signature scheme IBUOV based on the Unbalanced Oil and Vinegar (UOV) scheme on the security and choice of parameters and obtain that our scheme is more efficient than IBUOV in terms of key sizes and signature sizes.

scholarly journals Sieve Method for Polynomial Linear Equivalence

2013 ◽  
Vol 2013 ◽  
pp. 1-8
Author(s):  
Baocang Wang ◽  
Yupu Hu
Keyword(s):  
Finite Field ◽  
Linear Transformation ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Encryption ◽  
Sieve Method ◽  
Polynomial Maps ◽  
Algebraic Properties ◽  
Encryption Schemes ◽  
Multivariate Public Key

We consider the polynomial linear equivalence (PLE) problem arising from the multivariate public key cryptography, which is defined as to find an invertible linear transformationℒsatisfying𝒫=𝒮∘ℒfor given nonlinear polynomial maps𝒫and𝒮over a finite field𝔽q. Some cryptographic and algebraic properties of PLE are discussed, and from the properties we derive three sieves called multiplicative, differential, and additive sieves. By combining the three sieves, we propose a sieve method for the PLE problem. As an application of our sieve method, we show that it is infeasible to construct public key encryption schemes from the PLE problem.

Sign in / Sign up

Export Citation Format

Share Document