Proposal of the Multivariate Public Key Cryptosystem Relying on the Difficulty of Factoring a Product of Two Large Prime Numbers

Author(s):  
Shigeo TSUJII ◽  
Kohtaro TADAKI ◽  
Ryo FUJITA ◽  
Masahito GOTAISHI
2013 ◽  
Vol 380-384 ◽  
pp. 1899-1902
Author(s):  
Ling Ling Wang

Most existing verifiable ring signature schemes are based on traditional PKCs, which cannot resist future attacks of quantum computers. Fortunately, the MQ-problem based Multivariate Public-Key Cryptosystem (MPKC) is an important alternative to traditional PKCs for its potential to resist future attacks of quantum computers. In this paper, we proposed a construction of verifiable ring signature based on MPKC, which has the properties of consistent, unforgery, signer-anonymity and verifiability.


2014 ◽  
Vol 36 (6) ◽  
pp. 1177-1182
Author(s):  
Xu-Yun NIE ◽  
Zhao-Hu XU ◽  
Yong-Jian LIAO ◽  
Ting ZHONG

2013 ◽  
Vol 321-324 ◽  
pp. 2669-2673
Author(s):  
Feng Yuan ◽  
Hai Wen Ou ◽  
Sheng Wei Xu

The multivariate public key cryptosystem is a new and fast public key cryptosystem. This paper investigates the security of Square minus scheme, and presents a method to attack the scheme. The attack utilizes the affine parts of the private keys and the weakness caused by the structures of the private keys to find a large number of linear equations. The attack can recover the private keys efficiently when the parameters are small enough.


2018 ◽  
Vol 06 (03) ◽  
pp. 78-90 ◽  
Author(s):  
Muhammad Ariful Islam ◽  
Md. Ashraful Islam ◽  
Nazrul Islam ◽  
Boishakhi Shabnam

Sign in / Sign up

Export Citation Format

Share Document