RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2020 Number 50, Pages 51–61 (Mi pdm721)

This article is cited in 1 paper

Mathematical Methods of Cryptography

Authentication encryption cryptosystem with derived one-time keys

A. Yu. Zubov

Certification Research Center, Moscow, Russia

Abstract: A research of the previously proposed by the author mathematical model of authenticated encryption cryptosystem based on authentication code with secrecy is continued. An encryption algorithm uses calculations in the fields of characteristics two, a counters sequence depending on the key, one-time derived keys defined by the main key and initialization vectors using orthogonal Latin squares, and a polynomial-type MAC. A byte method for implementing the algorithm is proposed and compared with the standardized GCM cryptographic algorithm. The choice of model parameters that guarantee provable security to ciphertext-based attacks is proposed. The analysis of the cryptosystem's security to chosen-plaintext attacks is performed.

Keywords: authenticated encryption cryptosystem, GCM, quasigroup, orthogonal Latin squares, provable security, ciphertext-based attacks, chosen-plaintext attacks.

UDC: 519.1+519.719.2+519.712

DOI: 10.17223/20710410/50/3



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026