Detail publikace

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

BURDA, K.

Originální název

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

Typ

článek v časopise ve Web of Science, Jimp

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

Shannon; secrecy systems; brute force attack; Latin rectangles

Autoři

BURDA, K.

Vydáno

24. 9. 2022

Nakladatel

INT JOURNAL COMPUTER SCIENCE & NETWORK SECURITY-IJCSNS

Místo

SEOUL

ISSN

1738-7906

Periodikum

International Journal of Computer Science and Network Security

Ročník

22

Číslo

9

Stát

Korejská republika

Strany od

455

Strany do

464

Strany počet

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"
}