A joint signature encryption and error correction public-key cryptosystem based on algebraic coding theory

1992 ◽  
Vol 9 (1) ◽  
pp. 33-39
Author(s):  
Li Yuanxing ◽  
Cheng Jian ◽  
Wang Xinmei
2012 ◽  
Vol 12 (3&4) ◽  
pp. 181-203
Author(s):  
Hachiro Fujita

The McEliece cryptosystem is one of the best-known (classical) public-key cryptosystems, which is based on algebraic coding theory. In this paper, we present a quantum analogue of the classical McEliece cryptosystem. Our quantum McEliece public-key cryptosystem is based on the theory of stabilizer codes and has the key generation, encryption and decryption algorithms similar to those in the classical McEliece cryptosystem. We present an explicit construction of the quantum McEliece public-key cryptosystem using Calderbank-Shor-Steane codes based on generalized Reed-Solomon codes. We examine the security of our quantum McEliece cryptosystem and compare it with alternative systems.


Author(s):  
Yasuhiko IKEMATSU ◽  
Dung Hoang DUONG ◽  
Albrecht PETZOLDT ◽  
Tsuyoshi TAKAGI

2011 ◽  
Vol 30 (6) ◽  
pp. 1450-1452 ◽  
Author(s):  
Zheng-tao Jiang ◽  
Jing-liang Zhang ◽  
Yu-min Wang

2021 ◽  
Vol 1897 (1) ◽  
pp. 012045
Author(s):  
Karrar Taher R. Aljamaly ◽  
Ruma Kareem K. Ajeena

2009 ◽  
Vol 3 (4) ◽  
Author(s):  
Simon R. Blackburn ◽  
Carlos Cid ◽  
Ciaran Mullan

2017 ◽  
Vol 9 (1) ◽  
Author(s):  
František Marko ◽  
Alexandr N. Zubkov ◽  
Martin Juráš

AbstractWe develop a public-key cryptosystem based on invariants of diagonalizable groups and investigate properties of such a cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on the Euclidean algorithm).


Sign in / Sign up

Export Citation Format

Share Document