THEORETICALLY UNBREAKABLE CIPHERS AS THEY SHOULD BE UNDERSTOOD

Abstract

Perfectly-secret ciphers according to the Claude Shannon's theory, which are considered as unbreakable, and more specifically random keystream ciphers, are discussed. An analysis of the sources mentioned in the reference list showed that all of them come to the point that the perfect ciphers according to Claude Shannon's theory are unbreakable.The article introduces some concepts, such as: the probabilistic model of cipher; the perfect cipher, which is secure against a plaintext recovery ciphertext-only attack; the perfect cipher, which is secure against a key recovery ciphertext-only attack; effective plaintext or key recovery attack; ineffective plaintext or key recovery attack; decipherable model of cipher; undecipherable model cipher. The introduced concepts were used to clarify Shannon’s mathematical model and to prove that a statement about unbreakability of the perfect ciphers according to the Claude Shannon's theory, including random keystream cipher, were wrong. The purpose of the article is to attract the attention of specialists to the problem of developing methods for decrypting Vizhener cipher and using them in solving the problem of determining the cipher key of a random gamming according to a ciphertext, as well as developing methods for estimating the complexity and reliability of deciphering the cipher class in question.

Authors and Affiliations

Alexander Babash, Valery Sizov, Elena Baranova, Andrey Mikrukov

Keywords

Related Articles

PROJECT OF AUTOMATED ADAPTIVE SYSTEM FOR INDIVIDUAL SUPPORT OF TALENTED STUDENTS IN THE REGIONAL INFORMATION AND EDUCATIONAL ENVIRONMENT

This paper describes the project of an automated adaptive system for individual support of talented students in the regional information and educational environment, which is planned to be implemented in the Orenburg reg...

SOFTWARE ARCHITECTURE OF HIGH-PRODUCTION COMPLEXES FOR TEXT OF THE NEWS PROCESSING FOR SOLVING THE PROBLEMS OF DATA MINING

The article proposes the architecture of the software for processing collections of news text messages, as well as the corresponding composition and structure of the information system. The system is a few steps of obtai...

USE OF THE ARTIFICIAL IMMUNE SYSTEM IN DESIGNING A HYBRID TRAINING SYSTEM

The article presents a model of the system of training and control, including theoretical and practical parts. The universality of the system lies in its independence from the specific subject content, which allows the i...

GAMIFICATION TECHNOLOGIES FOR THE EARLY EDUCATION OF OBJECT-ORIENTED PROGRAMMING

The article describes the issues of teaching programming in the school at computer science (Computing) lessons. The authors have analyzed how the school computer science (computing) course has changed in recent years. In...

METHODOLOGIES AND INDICATORS FOR BIG DATA MEASUREMENT

The İnternet of Things, cloud computing and the development of social networking technologies caused rapid increase in the volume of data and the formation of Big Data paradigm. Increasing the volume, speed, diversity an...

Download PDF file
  • EP ID EP520603
  • DOI 10.25559/SITITO.14.201803.573-577
  • Views 90
  • Downloads 0

How To Cite

Alexander Babash, Valery Sizov, Elena Baranova, Andrey Mikrukov (2018). THEORETICALLY UNBREAKABLE CIPHERS AS THEY SHOULD BE UNDERSTOOD. Современные информационные технологии и ИТ-образование, 14(3), 573-577. https://europub.co.uk/articles/-A-520603