Geodesic
Authentication encryption cryptosystem with derived one-time keys
Prikladnaâ diskretnaâ matematika, no. 4 (2020), pp. 51-61
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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, orthogonal Latin squares, provable security, ciphertext-based attacks, chosen-plaintext attacks.
Mots-clés : quasigroup 
@article{PDM_2020_4_a2,
     author = {A. Yu. Zubov},
     title = {Authentication encryption cryptosystem with~derived~one-time~keys},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {51--61},
     year = {2020},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2020_4_a2/}
}
TY  - JOUR
AU  - A. Yu. Zubov
TI  - Authentication encryption cryptosystem with derived one-time keys
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2020
SP  - 51
EP  - 61
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/PDM_2020_4_a2/
LA  - ru
ID  - PDM_2020_4_a2
ER  - 
%0 Journal Article
%A A. Yu. Zubov
%T Authentication encryption cryptosystem with derived one-time keys
%J Prikladnaâ diskretnaâ matematika
%D 2020
%P 51-61
%N 4
%U http://geodesic.mathdoc.fr/item/PDM_2020_4_a2/
%G ru
%F PDM_2020_4_a2
A. Yu. Zubov. Authentication encryption cryptosystem with derived one-time keys. Prikladnaâ diskretnaâ matematika, no. 4 (2020), pp. 51-61. http://geodesic.mathdoc.fr/item/PDM_2020_4_a2/

[1] A. Yu. Zubov, “Authentication encryption based on authentication code with secrecy”, Prikladnaya Diskretnaya Matematika, 2019, no. 43, 60–69 (in Russian)

[2] V. N. Sachkov, Introduction to Combinatorial Methods of Discrete Mathematics, MCCME, M., 2004, 424 pp. (in Russian)

[3] D. McGrew, J. Viega, “The security and performance of Galois/Counter mode of operation”, LNCS, 3348, 2004, 343–355

[4] J. Viega, D. McGrew, Galois/Counter mode (GCM) overview fibre channel security protocols, Cisco Systems Inc., 2005, 32 pp.

[5] A. Yu. Zubov, “Almost perfect ciphers and authentication codes”, Prikladnaya Diskretnaya Matematika, 2011, no. 4 (14), 28–33 (in Russian)

[6] A. Yu. Zubov, “On the concept of a $\varepsilon$-perfect cipher”, Prikladnaya Diskretnaya Matematika, 2016, no. 3 (33), 45–52 (in Russian)