Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2019, Volume 10, Issue 2, Pages 125–134
DOI: https://doi.org/10.4213/mvk290 (Mi mvk290) 		 
This article is cited in 1 scientific paper (total in 1 paper)

How much data may be safely processed on one key in different modes?

I. V. Lavrikov, V. A. Shishkin

Technical Committee for Standardization “Cryptography and security mechanisms”, Moscow, Russia
Full-text PDF (184 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk290
Abstract: 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.
Key words: block cipher, mode of operation, provable security.
Received 06.II.2018
Document Type: Article
UDC: 519.719.2
Language: English
Citation: I. V. Lavrikov, V. A. Shishkin, “How much data may be safely processed on one key in different modes?”, Mat. Vopr. Kriptogr., 10:2 (2019), 125–134
Citation in format AMSBIB
\Bibitem{LavShi19}
\by I.~V.~Lavrikov, V.~A.~Shishkin
\paper How much data may be safely processed on one key in different modes?
\jour Mat. Vopr. Kriptogr.
\yr 2019
\vol 10
\issue 2
\pages 125--134
\mathnet{http://mi.mathnet.ru/mvk290}
\crossref{https://doi.org/10.4213/mvk290}
Linking options:
  • https://www.mathnet.ru/eng/mvk290
  • https://doi.org/10.4213/mvk290
  • https://www.mathnet.ru/eng/mvk/v10/i2/p125
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:479
    Full-text PDF :184
    References:62
    First page:9
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024