RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2020 Volume 11, Issue 2, Pages 25–42 (Mi mvk319)

Limonnitsa: making Limonnik-3 post-quantum

S. V. Grebnev

Technical Committee for Standardization, «Cryptography and security mechanisms» (TC 26), Moscow

Abstract: We propose Limonnitsa, a secure authenticated key exchange (AKE) scheme which brings together the standardized in 2017 by Rosstandart Limonnik-3 AKE scheme (a part of Standardization Recommendations R 1323565.1.004-2017 “Key agreement schemes based upon public-key methods” and the supersingular elliptic curves isogeny cryptographic framework alongside with standardized cryptographic primitives, which makes the protocol secure against even the efficient quantum computers. The protocol does not require a digital signature as a “standalone” primitive, allows the parties to use different sets of parameters. We describe the protocol, discuss Limonnitsa's basic cryptographic properties and preliminary choice of its basic parameters that conforms with another standardized cryptographic primitives. We show that the protocol is secure against known classes of attacks, including the problem of determining the parties' secret keys. We give security arguments in a modified Canetti–Krawczyk model based upon the assumption of the hardness of supersingular isogeny analogue of the Diffie–Hellman problem. Thus, we show that Limonnitsa is a versatile, secure cryptographic protocol that conforms the requirements expected from modern authenticated key exchange protocols.

Key words: authenticated key exchange, isogenies, Limonnik-3, post-quantum cryptography, supersingular elliptic curves.

UDC: 519.719.2

Received 05.XI.2019

Language: English

DOI: 10.4213/mvk319



© Steklov Math. Inst. of RAS, 2024