Authentication encryption based on authentication code with secrecy | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 43. DOI: 10.17223/20710410/43/4

The idea of authentication encryption cryptosystem is proposed. This cryptosystem is a modification of an authentication code with secrecy considered in previous papers of the author and based on Reed - Solomon error-correcting code. The essence of the modification is to use a non-repeating initialization vector and derivative key for encryption of each message. Estimations of cryptosystem security as an authentication code with secrecy at a one-time usage of the key are received: the encryption security is estimated by proximity to perfect encryption, and the authentication security - by probabilities of imitation and substitution success. Considerations for selection of parameters and estimation of cryptosystem security to chosen plaintext attacks at multiple usage of the key as well as distinction attacks are provided.
Download file
Counter downloads: 196
  • Title Authentication encryption based on authentication code with secrecy
  • Headline Authentication encryption based on authentication code with secrecy
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 43
  • Date:
  • DOI 10.17223/20710410/43/4
Keywords
код аутентификации с секретностью, криптосистема шифрования с аутентификацией, authentication code with secrecy, authentication encryption
Authors
References
Kabatianskii G.A., Johansson G., and Smeets B. On the cardinality of systematic A-codes via error correcting codes // IEEE Trans. Inform. Theory. 1996. V. IT-42. No. 2. P. 566-578
Зубов А. Ю. Почти совершенные шифры и коды аутентификации // Прикладная дискретная математика. 2011. № 4(14). С. 28-33
Зубов А. Ю. О понятии «-совершенного шифра // Прикладная дискретная математика. 2016. № 3(33). С. 45-52
Зубов А. Ю. Коды аутентификации с секретностью // Математические вопросы криптографии. 2017. Т. 8. № 3. С. 5-40
Зубов А. Ю. Об оценке стойкости AEAD-крипосистемы типа GCM // Прикладная дискретная математика. 2016. № 2(32). С. 49-62
Rivest R. R. Permutation polynomials modulo 2w // Finite Fields Their Appl. 2001. V. 7. No. 2. P. 287-292
Заец М. В. Построение подстановок с использованием вариационно-координатно полиномиальных функций над примарным кольцом вычетов // Математические вопросы криптографии. 2015. Т. 6. № 1. С. 5-32
McGrew D. A. and Viega J. The security and performance of Galois/Counter mode of operation // LNCS. 2004. V. 3348. P. 343-355
 Authentication encryption based on authentication code with secrecy | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 43. DOI: 10.17223/20710410/43/4
Authentication encryption based on authentication code with secrecy | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 43. DOI: 10.17223/20710410/43/4
Download full-text version
Counter downloads: 347