Geodesic
On the security of AEAD-cryptosystem of the GCM type
Prikladnaâ diskretnaâ matematika, no. 2 (2016), pp. 49-62.

Voir la notice de l'article provenant de la source Math-Net.Ru

A provable security methodology for the cryptosystems ensuring information privacy and authenticity is discussed. A simplified version of the well-known estimates for the provable security of the AEAD-cryptosystem GCM with an initialization vector of fixed length is proposed. Under the same conditions an estimate for the provable security of GCM modification is obtained. A comparative analysis of the considered cryptosystems is provided.
Keywords: AEAD-cryptosystem, GCM, provable security. 
@article{PDM_2016_2_a3,
     author = {A. Yu. Zubov},
     title = {On the security of {AEAD-cryptosystem} of the {GCM} type},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {49--62},
     publisher = {mathdoc},
     number = {2},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2016_2_a3/}
}
TY  - JOUR
AU  - A. Yu. Zubov
TI  - On the security of AEAD-cryptosystem of the GCM type
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2016
SP  - 49
EP  - 62
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2016_2_a3/
LA  - ru
ID  - PDM_2016_2_a3
ER  - 
%0 Journal Article
%A A. Yu. Zubov
%T On the security of AEAD-cryptosystem of the GCM type
%J Prikladnaâ diskretnaâ matematika
%D 2016
%P 49-62
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2016_2_a3/
%G ru
%F PDM_2016_2_a3
A. Yu. Zubov. On the security of AEAD-cryptosystem of the GCM type. Prikladnaâ diskretnaâ matematika, no. 2 (2016), pp. 49-62. http://geodesic.mathdoc.fr/item/PDM_2016_2_a3/

[1] Black J., Message authentication codes, PhD Dissertation, Dept. of Comp. Sciences, US Davis, 2000, 126 pp. http://www.cs.colorado.edu/~jrblack/

[2] Stinson D., “Universal hash families and the leftover hash lemma, and applications to cryptography and computing”, J. Combin. Math. Combin. Comput., 42:3 (2001), 29 | MR

[3] Bellare M., Namprempre C., “Authenticated encryption: relations among notions and analysis of the composition paradigm”, Asiacrypt 2000, LNCS, 1976, 2000, 541–545 | MR

[4] CAESAR: competition for authenticated encryption: security, applicability, and robustness, , 2012 http://competitions.cr.yp.to/caesar.html

[5] Chakraborty D., Sarkar P., On modes of operations of a block cipher for authentication and authenticated encryption, Cryptology ePrint Archive: , 2014, 51 pp. http://eprint.iacr.org/2014/627

[6] Rogaway P., Authenticated-encryption with associated-data, ACM CCS, ACM Press, 2002, 10 pp.

[7] Svenda P., Basic Comparison of Modes for Authenticated-Encryption (IAPM, XCBC, OCB, CCM, EAX, CWC, GCM, PCFB, CS), , 2005, 16 pp. https://www.fi.muni.cz/~xsvenda/docs/AE_comparison_ipics04.pdf

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

[9] Bellare M., “Practice-oriented provable-security”, LNCS, 1561, 2003, 1–15 | MR

[10] Shrimpton T., A characterization of authenticated-encryption as a form of chosen-ciphertext security, Cryptology ePrint Archive: , 2004, 7 pp. http://eprint.iacr.org/2004/272

[11] Bellare M., Kilian J., Rogaway P., “The security of the cipher block chaining”, LNCS, 839, 1994, 341–358 | Zbl

[12] Iwata T., Ohashi K., Minematsu K., “Breaking and repairing GCM security proofs”, Crypto 2012, LNCS, 7417, 2012, 31–49 | MR | Zbl

[13] Ferguson N., Authentication weaknesses in GCM, Public Comments to NIST, , May 2005 http://csrc.nist.gov/groups/ST/toolkit/BCM/documents/comments/CWC-GCM/Ferguson2.pdf