Publication result detail

Extension of Shannon's Theory of Ciphers based on Latin Rectangles

BURDA, K.

Original Title

Extension of Shannon's Theory of Ciphers based on Latin Rectangles

English Title

Extension of Shannon's Theory of Ciphers based on Latin Rectangles

Type

WoS Article

Original 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.

English 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.

Keywords

Shannon; secrecy systems; brute force attack; Latin rectangles

Key words in English

Shannon; secrecy systems; brute force attack; Latin rectangles

Authors

BURDA, K.

Released

24.09.2022

Publisher

INT JOURNAL COMPUTER SCIENCE & NETWORK SECURITY-IJCSNS

Location

SEOUL

ISBN

1738-7906

Periodical

International Journal of Computer Science and Network Security

Volume

22

Number

9

State

Republic of Korea

Pages from

455

Pages to

464

Pages count

10

URL

http://paper.ijcsns.org/07_book/202209/20220959.pdf

BibTex

@article{BUT179286,
  author="Karel {Burda}",
  title="Extension of Shannon's Theory of Ciphers based on Latin Rectangles",
  journal="International Journal of Computer Science and Network Security",
  year="2022",
  volume="22",
  number="9",
  pages="455--464",
  doi="10.22937/IJCSNS.2022.22.9.59",
  issn="1738-7906",
  url="http://paper.ijcsns.org/07_book/202209/20220959.pdf"
}