A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem

1983 ◽  
pp. 21-37
Author(s):  
Ravi Janardan ◽  
K. B. Lakshmanan
Author(s):  
Yasuhiko IKEMATSU ◽  
Dung Hoang DUONG ◽  
Albrecht PETZOLDT ◽  
Tsuyoshi TAKAGI

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