Cryptanalysis of Kowada-Machado key exchange protocol
2018 ◽
Vol 4
(1)
◽
pp. 12
Keyword(s):
A non-interactive key exchange (NIKE) protocol allows N parties who know each other’s public key to agree on a symmetric shared key without requiring any interaction. A classic example of such protocol for N = 2 is the Diffie-Hellman key exchange. Recently, some techniques were proposed to obtain a NIKE protocol for N parties, however, it is still considered an open problem since the security of these protocols must be confirmed. In a recent work, Kowada and Machado [1] proposed a protocol that solves the NIKE problem for N parties. However, this work found security problems in the proposed solution and implemented an efficient attack to their protocol demonstrating that their key-exchange scheme is insecure.
2014 ◽
Vol 22
(3)
◽
pp. 365-372
◽
2018 ◽
Vol 67
(11)
◽
pp. 1622-1636
◽
Using P systems to Solve the Discrete Logarithm Problem used in Diffie-Hellman Key Exchange Protocol
2009 ◽
Vol 1
(1)
◽
pp. 24-31
2007 ◽
Vol 14C
(6)
◽
pp. 471-474
◽
2022 ◽
Vol 2161
(1)
◽
pp. 012014