A MULTI-DIMENSIONAL ALGEBRA FOR DESIGNING AN IMPROVED NTRU CRYPTOSYSTEM

2020 ◽  
Vol 8 (4) ◽  
pp. 97-107
Author(s):  
H.R. Yassein ◽  
◽  
N.M.G. Al-Saidi ◽  
A.K. Jabber ◽  
◽  
...  
Keyword(s):  
Polynomial Ring ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Security Assessment ◽  
Dimensional Algebra

The NTRU public key cryptosystem is essentially based on the Nth degree trun- cated polynomial ring Z[X]/XN−1 . By altering the Z[X]/XN−1 or its mathematical con- struction, many researchers have worked to improve NTRU. In this paper, we present a new multi-dimensional public key cryptosystem which depends on a commutative quaternion al- gebra with a new structure. The new structure is an alternative to NTRU called NTRTE. Some data are used for comparing the key security and message security of NTRTE with the original NTRU and QTRU cryptosystems. Based on a security assessment, the comparison reveals that NTRTE is more resistant to them.

scholarly journals Dynamic keys generation for internet of things

2020 ◽  
Vol 18 (2) ◽  
pp. 1066
Author(s):  
Omar Sapti Guma'a ◽  
Qasim Mohammed Hussein ◽  
Ziyad Tariq Mustafa Al-Ta'i
Keyword(s):  
Internet Of Things ◽  
Polynomial Ring ◽  
Data Security ◽  
Public Key ◽  
Effective Alternative ◽  
Public Key Cryptosystem ◽  
Lll Algorithm ◽  
Iot Security ◽  
Iot Applications

<span>In several aspects, interest in IoT has become considerable by researchers and academics in recent years. Data security becomes one of the important challenges facing development of IoT environment. Many algorithms were proposed to secure the IoT applications. The traditional public key cryptographic are inappropriate because it requires high computational. Therefore, lattice-based public-key cryptosystem (LB-PKC) is a favorable technique for IoT security. NTRU is one of a LB-PKC that based on truncated polynomial ring, it has good features, which make it to be an effective alternative to the RSA and ECC algorithms. But, there is LLL algorithm can success to attack it under certain conditions. This paper proposes modifications to NTRU public key cryptosystem to be secure against the lattice-based attack by using LLL algorithm, as well as a method for generating a new keys sequence dynamically. The results from simulations show that the performance of these modifications gives more secure from NTRU. </span>

An Efficient Key Generation of ZHFE Public Key Cryptosystem

2018 ◽  
Vol E101.A (1) ◽  
pp. 29-38
Author(s):  
Yasuhiko IKEMATSU ◽  
Dung Hoang DUONG ◽  
Albrecht PETZOLDT ◽  
Tsuyoshi TAKAGI
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
Key Generation

scholarly journals Undirected Complete Graph to Design New Public Key Cryptosystem

2021 ◽  
Vol 1897 (1) ◽  
pp. 012045
Author(s):  
Karrar Taher R. Aljamaly ◽  
Ruma Kareem K. Ajeena
Keyword(s):  
Complete Graph ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
New Public

Cryptanalysis of the MST 3 public key cryptosystem

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

scholarly journals Public-key cryptosystem based on invariants of diagonalizable groups

2017 ◽  
Vol 9 (1) ◽  
Author(s):  
František Marko ◽  
Alexandr N. Zubkov ◽  
Martin Juráš
Keyword(s):  
Linear Algebra ◽  
Finite Fields ◽  
Number Fields ◽  
Euclidean Algorithm ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Finite Rings

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