Cycles, Randomness, Discrete Logarithms, and Key Exchange

Author(s):  
Duncan Buell
2015 ◽  
Vol 9 (3) ◽  
Author(s):  
Luigi Accardi ◽  
Massimo Regoli

AbstractIn the papers [New features for public key exchange algorithms, in: 18-th International ICWG Meeting (Krakow 2011)], [Strongly asymmetric PKD cryptographic algorithms: An implementation using the matrix model, in: Proceedings ISEC Conference (Shizuoka 2011)] a new scheme to produce public key agreement (PKA) algorithms was proposed and some examples based on polynomials (toy models) were discussed. In the present paper we introduce a non-commutative realization of the above mentioned scheme and prove that non-commutativity can be an essential ingredient of security in the sense that, in the class of algorithms constructed, under some commutativity assumptions on the matrices involved, we can find a breaking strategy, but dropping these assumptions we can not, even if we assume, as we do in all the attacks discussed in the present paper, that discrete logarithms have zero cost.


2006 ◽  
Vol 1 (2) ◽  
pp. 52-70
Author(s):  
Mohammed A. Tawfiq ◽  
◽  
Sufyan T. Faraj Al-janabi ◽  
Abdul-Karim A. R. Kadhim ◽  
◽  
...  

2011 ◽  
Vol 34 (1) ◽  
pp. 38-46 ◽  
Author(s):  
Fu-Shan WEI ◽  
Chuan-Gui MA ◽  
Qing-Feng CHENG

2010 ◽  
Vol 30 (7) ◽  
pp. 1805-1808
Author(s):  
Shao-feng DENG ◽  
Fan DENG ◽  
Yi-fa LI

Sign in / Sign up

Export Citation Format

Share Document