Paper 2023/1202

Extension of Shannon's theory of ciphers based on Latin rectangles

Karel BURDA, Brno University of Technology
Abstract

The paper extends Shannon's classical theory of ciphers. Here ciphers are modeled by Latin rectangles and their resistance to brute force attack is assessed through the valence of cryptograms. The valence of a cryptogram is defined as the number of all meaningful messages produced by decrypting the cryptogram with all possible keys. In this paper, the mean cryptogram valence of an arbitrary modern cipher with K keys, N outputs and N inputs, of which M inputs are messages, is derived. Furthermore, the lower bound on the valence of the cryptograms of entire ciphers is derived in this paper. The obtained parameters allow to assess the resistance of cryptograms, resp. ciphers against brute force attack. The model is general, illustrative and uses a simpler mathematical apparatus than existing theory. Therefore, it can also be used as an introduction to the theory of resistance of ciphers to brute force attack.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. International Journal of Computer Science and Information Security
DOI
10.22937/IJCSNS.2022.22.9.59
Keywords
Shannonsecrecy systemsbrute force attackLatin rectangles
Contact author(s)
burda @ vut cz
History
2023-08-10: approved
2023-08-08: received
See all versions
Short URL
https://ia.cr/2023/1202
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2023/1202,
      author = {Karel BURDA},
      title = {Extension of Shannon's theory of ciphers based on Latin rectangles},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/1202},
      year = {2023},
      doi = {10.22937/IJCSNS.2022.22.9.59},
      url = {https://eprint.iacr.org/2023/1202}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.