Breaking public key cryptosystem based on systems of nonlinear equations over finite field

1991 ◽  
Vol 27 (13) ◽  
pp. 1121
Author(s):  
R.F. Sewell
1988 ◽  
Vol 19 (2) ◽  
pp. 10-18 ◽  
Author(s):  
Shigeo Tsujii ◽  
Toshiya Itoh ◽  
Atsushi Fujioka ◽  
Kaoru Kurosawa ◽  
Tsutomu Matsumoto

1987 ◽  
Vol 23 (11) ◽  
pp. 558-560 ◽  
Author(s):  
S. Tsujii ◽  
T. Itoh ◽  
A. Fujioka ◽  
K. Kurosawa ◽  
T. Matsumoto

2020 ◽  
Vol 77 (1) ◽  
pp. 139-162
Author(s):  
Rajesh P. Singh ◽  
Bhaba K. Sarma ◽  
Anupam Saikia

AbstractIn this paper we propose an efficient multivariate encryption scheme based on permutation polynomials over finite fields. We single out a commutative group ℒ(q, m) of permutation polynomials over the finite field Fqm. We construct a trapdoor function for the cryptosystem using polynomials in ℒ(2, m), where m =2k for some k ≥ 0. The complexity of encryption in our public key cryptosystem is O(m3) multiplications which is equivalent to other multivariate public key cryptosystems. For decryption only left cyclic shifts, permutation of bits and xor operations are used. It uses at most 5m2+3m – 4 left cyclic shifts, 5m2 +3m + 4 xor operations and 7 permutations on bits for decryption.


2013 ◽  
Vol 303-306 ◽  
pp. 1944-1947
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 presents a multivariate public key cryptographic scheme over a finite field with odd prime characteristic. The idea of embedding and layering is manifested in its construction. The security of the scheme is analyzed in detail. The result indicates that the proposed scheme can resist all known attacks effectively.


Sign in / Sign up

Export Citation Format

Share Document