Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






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


Prikladnaya Diskretnaya Matematika. Supplement, 2020, Issue 13, Pages 67–69
DOI: https://doi.org/10.17223/2226308X/13/20
(Mi pdma500)
 

This article is cited in 1 scientific paper (total in 1 paper)

Mathematical Methods of Cryptography

Analysis of block cipher modes of operation for RFID devices

K. D. Tsaregorodtsevab

a Lomonosov Moscow State University
b Kryptonite
Full-text PDF (582 kB) Citations (1)
References:
Abstract: The RFID system consists of radio-tag and interrogator. The main purpose of devices is authentication with a transmission of small amount of data between tag and interrogator. We study modes that require only block encryption to be implemented in the tag (due to hardware limitations). CTR, OFB and modified CBC modes were analyzed. Modified CBC mode CBC$[F]$ can be specified as follows:
$$ C_0 = \text{IV}, C_i = F_k(C_{i-1} \oplus M_i), $$
where $F_k$ denotes either encryption ($F_k = E_k$) or decryption ($F_k = E_k^{-1})$ of one block of data on the key $k$, $M_i$ is the $i$-th block of plaintext, $C_i$ is the $i$-th block of ciphertext, IV is an initialization vector. Assume that the length of the key is $k$ bits, the length of the one block of data is $n$ bits, and consider an adversary that runs time no more than $t$, makes no more than $q$ oracle queries, each of length no more than $m$ blocks. Then, given an oracle access to the CBC$[E_k]$ and $\widehat{\text{CBC}} = \text{CBC}[E_k^{-1}]$ modes, the maximal advantage in the LOR-experiment can be bounded from above by:
$$ \text{Adv}^\text{LOR}_{\text{CBC}, \widehat{\text{CBC}}}(t, q, m) \le \frac{3q^2 m^2}{2^n - qm} + \frac{t+q}{2^{k-1}}. $$
Keywords: provable security, RFID, mode of operation.
Document Type: Article
UDC: 004.056.55
Language: Russian
Citation: K. D. Tsaregorodtsev, “Analysis of block cipher modes of operation for RFID devices”, Prikl. Diskr. Mat. Suppl., 2020, no. 13, 67–69
Citation in format AMSBIB
\Bibitem{Tsa20}
\by K.~D.~Tsaregorodtsev
\paper Analysis of block cipher modes of operation for RFID devices
\jour Prikl. Diskr. Mat. Suppl.
\yr 2020
\issue 13
\pages 67--69
\mathnet{http://mi.mathnet.ru/pdma500}
\crossref{https://doi.org/10.17223/2226308X/13/20}
Linking options:
  • https://www.mathnet.ru/eng/pdma500
  • https://www.mathnet.ru/eng/pdma/y2020/i13/p67
  • 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
    Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024