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

Mat. Vopr. Kriptogr., 2023, Volume 14, Issue 2, Pages 7–24 (Mi mvk435)

$\mathsf{sMGM}$: parameterizable AEAD mode
L. R. Akhmetzyanova, E. K. Alekseev, A. A. Babueva, A. A. Bozhko, S. V. Smyshlyaev

References

1. Akhmetzyanova L., Alekseev E., Babueva A., Bozhko A., Smyshlyaev S., “Misuse-resistant MGM2 mode”, Int. J. Open Inf. Technologies, 10:1 (2022), 6–14
2. Akhmetzyanova L., Alekseev E., Smyshlyaev S., Oshkin I., “On internal Re-keying”, SSR 2020, Lect. Notes Comput. Sci., 12529, 2020, 23–45  crossref  zmath
3. Andreeva E., Bogdanov A., Luykx A., Mennink B., Mouha N., Yasuda K., “How to securely release unverified plaintext in authenticated encryption”, ASIACRYPT 2014, Lect. Notes Comput. Sci., 8873, 2014, 105–125  crossref  mathscinet  zmath
4. Bellizia D., Bronchain O., Cassiers G., Grosso V., Guo C., Momin C., Pereira O., Peters T., Standaert F.X., Mode-level vs. implementation-level physical security in symmetric cryptography: A practical guide through the leakage-resistance jungle, IACR ePrint Archive, Report 2020/211, https://eprint.iacr.org/2020/211, 2020  mathscinet
5. Brandstetter L., Fischlin M., Schröder R.L., Yonli M., “On the memory fault resilience of TLS 1.3”, Lect. Notes Comput. Sci., 12529, 2020, 1–22  crossref  zmath
6. Bellare M., Rogaway P., Introduction to modern cryptography, 2005, 283 pp. https://web.cs.ucdavis.edu/r̃ogaway/classes/227/spring05/book/main.pdf
7. Bernstein D.J., Stronger security bounds for permutations, 2005 http://cr.yp.to/antiforgery/permutations-20050323.ps
8. Black J., Rogaway P., Shrimpton T., “Encryption-scheme security in the presence of key-dependent messages”, SAC'02, Lect. Notes Comput. Sci., 2595, 2002, 62-75  crossref  mathscinet
9. Chakraborty D., López C.M., Sarkar P., Disk encryption: do we need to preserve length?, J. Cryptogr. Engineering, 8:1, 49-69  crossref  mathscinet
10. Chang D., Nandi M., A short proof of the PRP/PRF switching lemma, IACR ePrint Archive, Report 2008/078, https://eprint.iacr.org/2008/078
11. CAESAR competition, https://competitions.cr.yp.to/caesar-submissions.html
12. Federal Agency on Technical Regulating and Metrology, Information technology. Cryptographic data security. Authenticated encryption block cipher operation modes, R 1323565.1.026-2019, FGBU “RST”, 2019, 16 pp. (In Russian)
13. Gueron S., Lindell Y., “GCM-SIV: full nonce misuse-resistant authenticated encryption at under one cycle per byte”, Proc. 22nd ACM SIGSAC Conf. Computer and Communic. Security, ACM, 2015, 109–119  crossref
14. Hoang V.T., Krovetz T., Rogaway P., “Robust authenticated-encryption AEZ and the problem that it solves”, EUROCRYPT 2015, Lect. Notes Comput. Sci., 9056, 2015, 15–44  crossref  mathscinet  zmath
15. Rogaway P., Shrimpton T., “A provable-security treatment of the key-wrap problem”, EUROCRYPT 2006, Lect. Notes Comput. Sci., 4004, 2006, 373–390  crossref  mathscinet  zmath
16. Smyshlyaev S., Nozdrunov V., Shishkin V., Griboedova E., RFC 9058 Multilinear Galois Mode (MGM), 2021 https://datatracker.ietf.org/doc/rfc9058


© Steklov Math. Inst. of RAS, 2026