Unconditionally Secure Key Agreement Protocol

Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility under the assumption that Alice and Bob own specific devices such as quantum channel [2]. In this article, we propose a new key agreement protocol called CHIMERA which requires no specific device. This protocol is based on a generalization we propose of the reconciliation algorithm. This protocol is proved unconditionally secure.

• Type: Conference
• Year: 2001
• Where: IMA
• Authors: Cyril Prissette
• Keywords: Cryptology, IMA 2001, Key Agreement Protocol, Protocol Called Chimera, Specific Device