How much data may be safely processed on one key in different modes?
Matematičeskie voprosy kriptografii, Tome 10 (2019) no. 2, pp. 125-134 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The amount of data to be processed with some block cipher under some mode of operation without change of key is the crucial characteristic of many informational systems and protocols. In this paper we investigate two different approaches of estimation of this characteristic and provide grounded margins that could be used during the synthesis of different systems and design of the terms of use for such systems.
@article{MVK_2019_10_2_a10,
     author = {I. V. Lavrikov and V. A. Shishkin},
     title = {How much data may be safely processed on one key in different modes?},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {125--134},
     year = {2019},
     volume = {10},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MVK_2019_10_2_a10/}
}
TY  - JOUR
AU  - I. V. Lavrikov
AU  - V. A. Shishkin
TI  - How much data may be safely processed on one key in different modes?
JO  - Matematičeskie voprosy kriptografii
PY  - 2019
SP  - 125
EP  - 134
VL  - 10
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MVK_2019_10_2_a10/
LA  - en
ID  - MVK_2019_10_2_a10
ER  - 
%0 Journal Article
%A I. V. Lavrikov
%A V. A. Shishkin
%T How much data may be safely processed on one key in different modes?
%J Matematičeskie voprosy kriptografii
%D 2019
%P 125-134
%V 10
%N 2
%U http://geodesic.mathdoc.fr/item/MVK_2019_10_2_a10/
%G en
%F MVK_2019_10_2_a10
I. V. Lavrikov; V. A. Shishkin. How much data may be safely processed on one key in different modes?. Matematičeskie voprosy kriptografii, Tome 10 (2019) no. 2, pp. 125-134. http://geodesic.mathdoc.fr/item/MVK_2019_10_2_a10/

[1] Scripta Ser. in Math., V. H. Winston, Washington, 1978, 262 pp. | MR | Zbl | Zbl

[2] R 1323565.1.005-2017. Information technology. Cryptographic techniques. Acceptable amount of data to be processed without key change for particular block cipher modes of operation, Standartinform, M., 2017 (in Russian)

[3] ISO/IEC 10116. Information technology Security techniques - Modes of operation for an n-bit block cipher, ISO/IEC, 2001

[4] Recommendation for Block Cipher Modes of Operation: Methods and Techniques, NIST Special Publication 800-38A, NIST, 2001

[5] A. Alkassar, A. Geraldy, B. Pfitzmann, A. R. Sadeghi, “Optimized self-synchronizing mode of operation”, FSE 2001, Lect. Notes Comput. Sci., 2355, 2001, 78–91 | DOI

[6] G. V. Bard, Accelerating cryptanalysis with the method of four Russians, Report 2006/251, Cryptology ePrint Archive

[7] M. Bellare, A. Desai, E. Jokipii, P. Rogaway, “A concrete security treatment of symmetric encryption”, 38th Annu. Symp. Found. Comput. Sci., IEEE Computer Society Press, Piscataway, 1997, 394–403 | DOI

[8] M. Bellare, J. Kilian, P. Rogaway, “The security of cipher block chaining”, CRYPTO'94, Lect. Notes Comput. Sci., 839, 1994, 341–358 | DOI | Zbl

[9] P. A. Fouque, A. Joux, G. Poupard, “Blockwise adversarial model for on-line ciphers and symmetric encryption schemes”, SAC 2004, Lect. Notes Comput. Sci., 3357, 2004, 212–226 | DOI | MR

[10] S. Goldwasser, S. Micali, “Probabilistic encryption”, J. Computer and System Sci., 28:2 (1984), 270–299 | DOI | MR | Zbl

[11] A. Joux, G. Martinet, F. Valette, “Blockwise-adaptive attackers revisiting the (in)security of some provably secure encryption modes: CBC, GEM, IACBC”, CRYPTO'02, Lect. Notes Comput. Sci., 2442, 2002, 17–31 | DOI | MR

[12] D. McGrew, Impossible plaintext cryptanalysis and probable-plaintext collision attacks of 64-bit block cipher modes, Report 2012/623, Cryptology ePrint Archive

[13] K. Nishimura, M. Sibuya, “Probability to meet in the middle”, J. Cryptology, 2:1 (1990), 13–22 | DOI | MR | Zbl

[14] E. Razali, R. C. W. Phan, M. Joye, “On the notions of PRP-RKA, KR and KR-RKA for block ciphers”, Provable Security 2007, Lect. Notes Comput. Sci., 4784, 2007, 188–197 | DOI | Zbl

[15] P. Rogaway, CRYPTREC 2011, unpublished manuscript

[16] P. Rogaway, “Nonce-based symmetric encryption”, FSE 2004, Lect. Notes Comput. Sci., 3017, 2004, 348–359 | DOI | Zbl