scholarly journals Building Secure Tame-like Multivariate Public-Key Cryptosystems: The New TTS

2005 ◽  
pp. 518-531 ◽  
Author(s):  
Bo-Yin Yang ◽  
Jiun-Ming Chen
Keyword(s):  
Public Key ◽  
Public Key Cryptosystems ◽  
Multivariate Public Key

scholarly journals Identity-Based Signature Schemes for Multivariate Public Key Cryptosystems

2019 ◽  
Vol 62 (8) ◽  
pp. 1132-1147 ◽  
Author(s):  
Jiahui Chen ◽  
Jie Ling ◽  
Jianting Ning ◽  
Jintai Ding
Keyword(s):  
General Scheme ◽  
Security Analysis ◽  
Distribution Center ◽  
Public Key ◽  
Signature Schemes ◽  
The Public ◽  
Public Key Cryptosystems ◽  
Unique Identity ◽  
Identity Based ◽  
Multivariate Public Key

Abstract In this paper, we proposed an idea to construct a general multivariate public key cryptographic (MPKC) scheme based on a user’s identity. In our construction, each user is distributed a unique identity by the key distribution center (KDC) and we use this key to generate user’s private keys. Thereafter, we use these private keys to produce the corresponding public key. This method can make key generating process easier so that the public key will reduce from dozens of Kilobyte to several bits. We then use our general scheme to construct practical identity-based signature schemes named ID-UOV and ID-Rainbow based on two well-known and promising MPKC signature schemes, respectively. Finally, we present the security analysis and give experiments for all of our proposed schemes and the baseline schemes. Comparison shows that our schemes are both efficient and practical.

scholarly journals TOTAL EMBEDDED SURFACE ATTACK ON MPKCS FROM DIOPHANTINE EQUATIONS

2018 ◽  
Author(s):  
Adama Diene
Keyword(s):  
Finite Fields ◽  
Diophantine Equations ◽  
Computer Experiments ◽  
Lower Degree ◽  
Public Key ◽  
Public Key Cryptosystems ◽  
Embedded Surfaces ◽  
Characteristic 2 ◽  
Multivariate Public Key

In 2011, Gao and Heindl presented a new multivariate public key cryptosystems from Diophantine equations. However, by observing the decryption process, Ding et al. found recently that some special embedded surfaces could be used to decrypt the message efficiently. They showed that the three systems proposed by Gao and Heindl could be broken at the complexity of 252,261 and 252 respectively. But, the attack by Ding et al. can not implemented on a usual PC. It was mainly theoretical and worked only for finite fields of characteristic 2. In this paper, We present a practical attack on this family of multivariate public key cryptosystems. Our attack is implemented on a PC and it works for all finite fields. By doing computer experiments, we find many new lower-degree embedded surfaces which help us to break the cryptosystem.

Sign in / Sign up

Export Citation Format

Share Document