Attacks on the Random Gamming Code
In 1917, Hilbert Vernam patented a top-secret encryption scheme, which at first was called a one-time notepad and later a Vernam cipher. At the time that Vernam proposed this scheme, there was no evidence that it was completely secret, since, in fact, at that time yet there was no idea what the perf...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
MGTU im. N.È. Baumana
2020-02-01
|
| Series: | Matematika i Matematičeskoe Modelirovanie |
| Subjects: | |
| Online Access: | https://www.mathmelpub.ru/jour/article/view/210 |
| _version_ | 1811232495948005376 |
|---|---|
| author | A. V. Babash |
| author_facet | A. V. Babash |
| author_sort | A. V. Babash |
| collection | DOAJ |
| description | In 1917, Hilbert Vernam patented a top-secret encryption scheme, which at first was called a one-time notepad and later a Vernam cipher. At the time that Vernam proposed this scheme, there was no evidence that it was completely secret, since, in fact, at that time yet there was no idea what the perfect secret of the cipher was. However, about 25 years later, Claude Shannon introduced the definition of perfect secrecy (perfect cipher) and demonstrated that the random gamming cipher reaches this level of security. Cryptographers believe that there are no effective attacks for attacks of random gamming. In particular, there are no effective attacks for the Vernam cipher.Objective: to justify the fallacy of this proposition to build effective attacks.Methods: analysis of the relationship between the cipher key and the received encrypted text.Results: an attack on the plaintext of a random gamming cipher based on a given encrypted text was developed. In addition, there was a suggestion for another attack on the plaintext contents based on the encrypted text. For all attacks, parameters of their complexity are calculated. These results are new. Previously, an attack on the random gamma code was unavailable. The results disprove the opinion that there are no attacks on this cipher.Practical relevance: firstly, it has become possible to carry out attacks on the random gamming code. Secondly, when using this cipher, it is necessary to strictly limit the length of the message.Discussion: the idea that there is an effective attack on a random gamming cipher arose in 2002, due to the possibility of introducing a similar concept, in which in a definition of the perfect cipher the plaintext is changed for a key. The first idea in creating attacks is that when the key is long its elements are repeated. The second idea is that attacks on two plaintexts are encrypted with one key. And the main idea was that it is necessary to improve the mathematical model of the Shannon code. Therein, when interpreting the concept of the perfect cipher, we should talk about the cipher model perfection.The publication place: in the Yandex search engine a query "Perfect ciphers" resulted in 22 million links, on a query "schemes perfectly secret" there were 43 million links. Yandex on the query "random gamming code" gave 13 million results. |
| first_indexed | 2024-04-12T11:03:48Z |
| format | Article |
| id | doaj.art-a6e1df2644e347a59d53595c401b2813 |
| institution | Directory Open Access Journal |
| issn | 2412-5911 |
| language | Russian |
| last_indexed | 2024-04-12T11:03:48Z |
| publishDate | 2020-02-01 |
| publisher | MGTU im. N.È. Baumana |
| record_format | Article |
| series | Matematika i Matematičeskoe Modelirovanie |
| spelling | doaj.art-a6e1df2644e347a59d53595c401b28132022-12-22T03:35:52ZrusMGTU im. N.È. BaumanaMatematika i Matematičeskoe Modelirovanie2412-59112020-02-0106355810.24108/mathm.0619.0000210132Attacks on the Random Gamming CodeA. V. Babash0National Research University Higher School of Economics, Moscow; Plekhanov Russian University of Economics, MoscowIn 1917, Hilbert Vernam patented a top-secret encryption scheme, which at first was called a one-time notepad and later a Vernam cipher. At the time that Vernam proposed this scheme, there was no evidence that it was completely secret, since, in fact, at that time yet there was no idea what the perfect secret of the cipher was. However, about 25 years later, Claude Shannon introduced the definition of perfect secrecy (perfect cipher) and demonstrated that the random gamming cipher reaches this level of security. Cryptographers believe that there are no effective attacks for attacks of random gamming. In particular, there are no effective attacks for the Vernam cipher.Objective: to justify the fallacy of this proposition to build effective attacks.Methods: analysis of the relationship between the cipher key and the received encrypted text.Results: an attack on the plaintext of a random gamming cipher based on a given encrypted text was developed. In addition, there was a suggestion for another attack on the plaintext contents based on the encrypted text. For all attacks, parameters of their complexity are calculated. These results are new. Previously, an attack on the random gamma code was unavailable. The results disprove the opinion that there are no attacks on this cipher.Practical relevance: firstly, it has become possible to carry out attacks on the random gamming code. Secondly, when using this cipher, it is necessary to strictly limit the length of the message.Discussion: the idea that there is an effective attack on a random gamming cipher arose in 2002, due to the possibility of introducing a similar concept, in which in a definition of the perfect cipher the plaintext is changed for a key. The first idea in creating attacks is that when the key is long its elements are repeated. The second idea is that attacks on two plaintexts are encrypted with one key. And the main idea was that it is necessary to improve the mathematical model of the Shannon code. Therein, when interpreting the concept of the perfect cipher, we should talk about the cipher model perfection.The publication place: in the Yandex search engine a query "Perfect ciphers" resulted in 22 million links, on a query "schemes perfectly secret" there were 43 million links. Yandex on the query "random gamming code" gave 13 million results.https://www.mathmelpub.ru/jour/article/view/210random gamming codecomplexity of the cryptographic methodreliability of the cryptographic method |
| spellingShingle | A. V. Babash Attacks on the Random Gamming Code Matematika i Matematičeskoe Modelirovanie random gamming code complexity of the cryptographic method reliability of the cryptographic method |
| title | Attacks on the Random Gamming Code |
| title_full | Attacks on the Random Gamming Code |
| title_fullStr | Attacks on the Random Gamming Code |
| title_full_unstemmed | Attacks on the Random Gamming Code |
| title_short | Attacks on the Random Gamming Code |
| title_sort | attacks on the random gamming code |
| topic | random gamming code complexity of the cryptographic method reliability of the cryptographic method |
| url | https://www.mathmelpub.ru/jour/article/view/210 |
| work_keys_str_mv | AT avbabash attacksontherandomgammingcode |