A Quantum Diffie-Hellman Protocol

被引:0
|
作者
Subramaniam, Pranav [1 ]
Parakh, Abhishek [2 ]
机构
[1] Univ Nebraska, Omaha, NE 68182 USA
[2] Univ Nebraska, Ctr Informat Assurance, Omaha, NE 68182 USA
关键词
D O I
10.1109/MASS.2014.89
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations.
引用
收藏
页码:523 / 524
页数:2
相关论文
共 50 条
  • [1] The Diffie-Hellman protocol
    Maurer, UM
    Wolf, S
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2000, 19 (2-3) : 147 - 171
  • [2] An Alternative Diffie-Hellman Protocol
    Jarpe, Eric
    [J]. CRYPTOGRAPHY, 2020, 4 (01) : 1 - 10
  • [3] A Quantum Diffie-Hellman Protocol Using Commuting Transformations
    Subramaniam, Pranav
    Parakh, Abhishek
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON ADVANCED NETWORKS AND TELECOMMUNCATIONS SYSTEMS (ANTS), 2014,
  • [4] Diffie-Hellman Protocol as a Symmetric Cryptosystem
    Burda, Karel
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2018, 18 (07): : 33 - 37
  • [5] Diffie-Hellman, decision Diffie-Hellman, and discrete logarithms
    Maurer, U
    Wolf, S
    [J]. 1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 327 - 327
  • [6] An improvement of the Diffie-Hellman noncommutative protocol
    Roman'kov, Vitaly
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2022, 90 (01) : 139 - 153
  • [7] A one round protocol for tripartite Diffie-Hellman
    Joux, A
    [J]. ALGORITHMIC NUMBER THEORY, 2000, 1838 : 385 - 393
  • [8] A one round protocol for tripartite Diffie-Hellman
    Joux, A
    [J]. JOURNAL OF CRYPTOLOGY, 2004, 17 (04) : 263 - 276
  • [9] A Secure and Efficient Authenticated Diffie-Hellman Protocol
    Sarr, Augustin P.
    Elbaz-Vincent, Philippe
    Bajard, Jean-Claude
    [J]. PUBLIC KEY INFRASTRUCTURES, SERVICES AND APPLICATIONS, 2010, 6391 : 83 - +
  • [10] GENERALIZED RSA CIPHER AND DIFFIE-HELLMAN PROTOCOL
    Matysiak, Lukasz
    [J]. JOURNAL OF APPLIED MATHEMATICS & INFORMATICS, 2021, 39 (1-2): : 93 - 103