Authentication encryption cryptosystem with~derived~one-time~keys
Prikladnaâ diskretnaâ matematika, no. 4 (2020), pp. 51-61
Voir la notice de l'article provenant de la source Math-Net.Ru
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
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},
publisher = {mathdoc},
number = {4},
year = {2020},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/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/