Cryptography (from Greek — hidden and — to write) – the most ancient science about methods of confidential data protection from undesirable third-party reading. Cryptoanalysis – the science studying methods of violation of confidentiality of information. Cryptananalysis and cryptography together make science the cryptology studying methods of enciphering and decoding.
Cybersecurity directory - Means of enciphering of systems and projects it is available on TAdviser
Means of cryptographic protection of a state secret are still equated to weapon. Very few countries of the world have the cryptographic companies which do really good information security tools. Even in many developed countries there is no such opportunity: there is no school which would allow to support and develop these technologies. Russia one of the few countries of the world, – can be such countries five, or about that, – where all this is developed. And both in commercial, and in public sector there are companies and the organizations which saved succession of school of cryptography since those times when it only arose.
Today there is a mass of the encryption algorithms having considerable firmness before cryptoanalysis (cryptographic firmness). Division of encryption algorithms into three groups is accepted:
- Symmetric algorithms
- Asymmetric algorithms
- Algorithms hash functions
Symmetric enciphering provides use of the same key both for encryption, and for deciphering. Two main requirements are applied to symmetric algorithms: complete loss of all statistical regularities in subject to enciphering and lack of linearity. It is accepted to separate the symmetric systems into block and line.
In the block systems there is a splitting initial data into blocks to the subsequent conversion using a key.
In the line systems a certain sequence (an output gamma) which in the subsequent is imposed on the message is developed, and data encryption happens a flow in process of generation of a gamma. The scheme of connection with use of a symmetric cryptosystem is submitted in the drawing.
Where where M - the clear text, To - the secret key transferred through a closed channel, En (M) - encryption transaction, and Dk(M) - deciphering transaction
Usually at symmetric enciphering the difficult and multistage combination of substitutions and shifts of initial data is used, and steps (passes) there can be a set, at the same time to each of them there should correspond "the pass key"
Transaction of substitution fulfills the first requirement imposed to the symmetric cipher, getting rid of any statistical data by hashing of bits of the message under the certain set law. Shift is necessary for accomplishment of the second requirement – giving to a nonlinearity algorithm. It is reached due to replacement of a certain part of the message of the set volume by standard value by the appeal to an initial array.
The symmetric systems have both the advantages, and shortcomings over asymmetric. Carry the high speed of enciphering, smaller necessary key length at similar resistance to advantages of symmetric ciphers, big study and simplicity of implementation. Shortcomings of symmetric algorithms consider first of all complexity of key exchange in view of high probability of violation of privacy of a key at exchange which is necessary, and complexity of key management in big network.
Examples of symmetric ciphers
- GOST 28147-89 is the domestic standard of enciphering
- 3DES (Triple-DES, threefold DES)
- RC6 (Cipher Rivesta)
- SEED is the Korean standard of enciphering
- Camellia is the Japanese standard of enciphering
- CAST (on initials of Carlisle Adams and Stafford Tavares developers)
- XTEA is the simplest algorithm in implementation
- AES is the American standard of enciphering
- DES is the data encryption standard in the USA to AES
The asymmetric systems are also called cryptosystems with public key. It is such method of data encryption at which the public key is transferred through an open channel (does not disappear) and it is used for verification of the electronic signature and for data encryption. For decoding and creation of the electronic signature the second key, confidential is used.
The device of the asymmetric cryptosystems uses the idea of one-sided functions of ƒ (x) in which it is simple to find x, knowing value of the function but it is almost impossible to find itself ƒ (x), knowing only value x. The phonebook of the big city in which it is easy to find number of the person can be an example of such function, knowing his surname and initials, but it is extremely difficult, knowing number, to find the owner.
Principle of work of the asymmetric systems
Let's say there are two subscribers: And yes In, and the subscriber In wants to send the encoded message to the subscriber A. He ciphers the message using public key and gives him already ciphered on an open communication link. Having received the message, the subscriber A subjects it to deciphering using secret key and reads.
Here it is necessary to make refining. When obtaining the message the subscriber A should authenticate the personality before the subscriber In in order that the ill-wisher could not issue himself for the subscriber A and change his public key for the.
Examples of asymmetric fonts
- RSA (Rivest-Shamir-Adleman, Rivest — Shamir — Adleman)
- DSA (Digital Signature Algorithm)
- Elgamal (Shifrosistema El-Gamalya)
- Diffie-Hellman (Key exchange of Diffie — Helmana)
- ECC (Elliptic Curve Cryptography, cryptography of an elliptic curve)
- GOST P 34.10-2001
Hashing (from engl. hash) is called conversion of an initial information array of arbitrary length to bit string of fixed length.
The hash functions is a lot of algorithms, and they differ with the characteristics – cryptofirmness, digit capacity, computing complexity, etc.
We are interested cryptographic resistant a hash function. To it usually impose two requirements:
- For the set message With impracticablly to pick up other message With' with the same hash
- It is impracticable to pick up couples of messages (CC') having an identical hash.
Requirements are called resistance to collisions of the first sort and the second sort respectively. For such functions there is important also other requirement: at minor change of an argument there has to be a significant change in the function. Thus, the value of a hash should not give information even about separate bits of an argument.
Examples hash algorithms
- SHA-2 (SHA-224, SHA-256, SHA-384, SHA-512)
- Tiger (TTH)
- GOST P34.11-94 (GOST 34.311-95)
- IP Internet Checksum (RFC 1071)
For giving to the ciphered information of bigger cryptographic firmness, in a cryptographic system rather simple transformations – primitives can repeatedly be applied. As primitives substitutions, shifts, non-arithmetical shift or a gammirovaniye can be used.
The quantum cryptography by right is considered a new round in evolution of information protection. She allows to create almost absolute protection of the encoded data against cracking. The idea to use quantum objects for data protection from counterfeit and unauthorized access was for the first time stated by Stefan Veysner in 1970. 10 years later scientists Bennet and Brassard who were familiar with Veysner's work suggested to use quantum objects for transfer of secret key. Read article"Quantum cryptography (enciphering)"
Cryptography in digital technologies
The cryptography in digital technologies is necessary as the instrument of confidential data protection and just as means of counteraction to illegal copying and dissemination of the data which are intellectual property. Read article"Cryptography in digital technologies"
The cryptography is the most ancient science, and text messages which using certain algorithms lost sense for all, not having special knowledge of decoding of this message – a key were its initial objects.
The methods today applied unless to puzzles, i.e., according to the contemporary, protozoa were initially used. Treat such methods of enciphering, for example, a replacement method when each letter is replaced with another, remote from it at strictly certain distance in the alphabet. Or a method of permutable enciphering when interchange the position of letters in a certain sequence in a word.
In ancient times enciphering was applied mainly in military and trade science, espionage, among smugglers.
A bit later scientists-historians define date of emergence of other related science – a steganography. This science is engaged in masking of the fact of transfer of the message. It arose in antiquity, and here receiving by the Spartan tsar Leonid before fight with Persians of the provoshchenny plate with the text covered with the dry easily washed away solution can be an example. When cleaning the signs left on wax the stylus became clearly seen. Today for concealment of the message sympathetic ink, micropoints, microfilms, etc. serve.
With development of mathematics mathematical encryption algorithms began to appear, but all these types of cryptographic information protection saved statistical data in different volume degree and remained vulnerable. Vulnerability became especially notable with the invention of frequency analysis which was developed in the 9th century of our era by presumably Arab Encyclopaedist al-Kindi. And only in the 15th century, after the invention of polyalphabetic fonts Leon Battista Alberti (presumably), protection moved to qualitatively new level. However in the middle of the 17th century Charlz Babbage produced the convincing evidence of partial vulnerability of polyalphabetic fonts to frequency analysis.
Development of mechanics allowed to create the devices and mechanisms facilitating enciphering – there were such devices as a square board of Tritemius, the disk cipher of Thomas Jefferson. But all these devices ri to what comparison do not go with those, were created in the 20th century. At this particular time different cipher machines and mechanisms of high complexity, for example, rotor machines, the most known of which is Enigma, began to appear
Before rapid development of science in the 20th century cryptographers had to deal only with linguistic objects, and in the XX century possibilities of application of different mathematical methods and theories, statistics, combination theory, the number theory and abstrakny algebra opened.
But this break in cryptographic science happened to emergence of a possibility of submission of any information in a binary type separated into bits using computers that allowed to create fonts with unprecedented cryptographic firmness hitherto. Such encryption systems, of course, can be subjected to cracking, but time expenditure on cracking in most cases is not repaid.
Today it is possible to speak about considerable developments in a quantum cryptography.
- Barichev S. G., Goncharov V.V., Serov R.E. Fundamentals of modern cryptography. — M.: * Varfolomeyev A. A., Zhukov A. E., Pudovkina M.A. Line cryptosystems. Main properties and methods of the analysis of firmness. M.: PAIMS, 2000.
- Yashchenko V. V. Introduction to cryptography. SPb.: St. Petersburg, 2001. ISBN 5-318-00443-1.
- GOST 28147-89. Information processing systems. Cryptographic protection. Algorithm of cryptographic conversion. M.: USSR Group according to standards, 1989.
- GOST P 34.10-94. Information technology. Cryptographic information protection. * GOST P 34.11-94. Information technology. Cryptographic information protection. Hashing function. M, 1995.
- GOST P 34.10-2001 Information technology. Cryptographic information protection. Processes of formation and verification of the electronic digital signature. M, 2001.
- Nechayev V.I. Cryptography elements (Bases of the theory of data protection). M.: The higher school, 1999.
- Zhelnikov V. Cryptography from papyrus to the computer. M.: ABP,1996.
- Information security and enciphering
- Cryptographic educational program
- Cryptographic reference book
- Cryptolog blog
- The collection of articles on cryptography