TM completed segments: 0
Other segments: 441
TM completed words: 0
Other words: 3923
Original | Translated |
---|
Original | Similar TM records |
---|---|
Introduction to Cryptography | Introduction to Cryptography Cryptography |
Cryptography | Cryptography History of Cryptography Modern cryptography |
Cryptography or cryptology (from | Cryptography or cryptology (from History of Cryptography Cryptography |
https://en.wikipedia.org/wiki/Ancient_Greek_language | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-1 | |
https://en.wikipedia.org/wiki/Secure_communication | |
https://en.wikipedia.org/wiki/Adversary_(cryptography) | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-rivest90-2 | |
https://en.wikipedia.org/wiki/Communications_protocol | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-modern-crypto-3 | |
https://en.wikipedia.org/wiki/Information_security | |
https://en.wikipedia.org/wiki/Confidentiality | |
https://en.wikipedia.org/wiki/Data_integrity | |
https://en.wikipedia.org/wiki/Authentication | |
https://en.wikipedia.org/wiki/Non-repudiation | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-hac-4 | |
Modern cryptography exists at the intersection of the disciplines of | Modern cryptography exists at the intersection of the disciplines of |
https://en.wikipedia.org/wiki/Mathematics | |
https://en.wikipedia.org/wiki/Computer_science | |
https://en.wikipedia.org/wiki/Electrical_engineering | |
https://en.wikipedia.org/wiki/Communication_science | |
https://en.wikipedia.org/wiki/Physics | |
Applications of cryptography include | Applications of cryptography include |
https://en.wikipedia.org/wiki/Electronic_commerce | |
https://en.wikipedia.org/wiki/Credit_card_chip | |
https://en.wikipedia.org/wiki/Digital_currencies | |
https://en.wikipedia.org/wiki/Password | |
https://en.wikipedia.org/wiki/Military_communications | |
Cryptography prior to the modern age was effectively synonymous with | Cryptography prior to the modern age was effectively synonymous with |
https://en.wikipedia.org/wiki/Encryption | |
https://en.wikipedia.org/wiki/Nonsense | |
The originator of an encrypted message shares the decoding technique only with intended recipients to preclude access from adversaries. | The originator of an encrypted message shares the decoding technique only with intended recipients to preclude access from adversaries. |
The cryptography literature | The cryptography literature Modern cryptography Cryptography |
https://en.wikipedia.org/wiki/Alice_and_Bob | |
https://en.wikipedia.org/wiki/Eavesdropper | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-codesintro-5 | |
https://en.wikipedia.org/wiki/Rotor_machine | |
https://en.wikipedia.org/wiki/World_War_I | |
https://en.wikipedia.org/wiki/Computer | |
https://en.wikipedia.org/wiki/World_War_II | |
Modern cryptography is heavily based on mathematical theory and computer science practice; cryptographic | Modern cryptography is heavily based on mathematical theory and computer science practice; cryptographic |
https://en.wikipedia.org/wiki/Algorithm | |
https://en.wikipedia.org/wiki/Computational_hardness_assumption | |
It is theoretically possible to break such a system, but it is infeasible to do so by any known practical means. | It is theoretically possible to break such a system, but it is infeasible to do so by any known practical means. |
These schemes are therefore termed computationally secure; theoretical advances, e.g., improvements in | These schemes are therefore termed computationally secure; theoretical advances, e.g., improvements in |
https://en.wikipedia.org/wiki/Integer_factorization | |
There exist | There exist |
https://en.wikipedia.org/wiki/Information_theoretic_security | |
https://en.wikipedia.org/wiki/One-time_pad | |
The growth of cryptographic technology has raised a number of legal issues in the information age. | The growth of cryptographic technology has raised a number of legal issues in the information age. |
Cryptography’s potential for use as a tool for | Cryptography’s potential for use as a tool for |
https://en.wikipedia.org/wiki/Espionage | |
https://en.wikipedia.org/wiki/Sedition | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-cryptolaw-6 | |
https://en.wikipedia.org/wiki/Key_disclosure_law | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-UK_law-7 | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-RangerSteve1-8 | |
https://en.wikipedia.org/wiki/Digital_rights_management | |
https://en.wikipedia.org/wiki/Copyright_infringement | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-AACS-9 | |
Terminology | Terminology |
The first use of the term |
The first use of the term |
https://en.wikipedia.org/wiki/The_Gold-Bug | |
https://en.wikipedia.org/wiki/Edgar_Allan_Poe | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-10 | |
10 | |
Until modern times, cryptography referred almost exclusively to | Until modern times, cryptography referred almost exclusively to |
https://en.wikipedia.org/wiki/Plaintext | |
https://en.wikipedia.org/wiki/Ciphertext | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-kahnbook-11 | |
11 | |
Decryption is the reverse, in other words, moving from the unintelligible ciphertext back to plaintext. | Decryption is the reverse, in other words, moving from the unintelligible ciphertext back to plaintext. |
A | A |
https://en.wikipedia.org/wiki/Cipher | |
The detailed operation of a cipher is controlled both by the algorithm and in each instance by a “ |
The detailed operation of a cipher is controlled both by the algorithm and in each instance by a “ |
https://en.wikipedia.org/wiki/Key_(cryptography) | |
The key is a secret (ideally known only to the communicants), usually a short string of characters, which is needed to decrypt the ciphertext. | The key is a secret (ideally known only to the communicants), usually a short string of characters, which is needed to decrypt the ciphertext. |
Formally, a “ |
Formally, a “ |
https://en.wikipedia.org/wiki/Cryptosystem | |
Keys are important both formally and in actual practice, as ciphers without variable keys can be trivially broken with only the knowledge of the cipher used and are therefore useless (or even counter-productive) for most purposes. | Keys are important both formally and in actual practice, as ciphers without variable keys can be trivially broken with only the knowledge of the cipher used and are therefore useless (or even counter-productive) for most purposes. |
Historically, ciphers were often used directly for encryption or decryption without additional procedures such as | Historically, ciphers were often used directly for encryption or decryption without additional procedures such as |
https://en.wikipedia.org/wiki/Authentication | |
There are two kinds of cryptosystems: | There are two kinds of cryptosystems: |
https://en.wikipedia.org/wiki/Symmetric-key_algorithm | |
https://en.wikipedia.org/wiki/Public-key_cryptography | |
In symmetric systems the same key (the secret key) is used to encrypt and decrypt a message. | In symmetric systems the same key (the secret key) is used to encrypt and decrypt a message. Asymmetric systems use a public key to encrypt a message and a private key to decrypt it. |
Data manipulation in symmetric systems is faster than asymmetric systems as they generally use shorter key lengths. | Data manipulation in symmetric systems is faster than asymmetric systems as they generally use shorter key lengths. |
Asymmetric systems use a public key to encrypt a message and a private key to decrypt it. | Asymmetric systems use a public key to encrypt a message and a private key to decrypt it. In symmetric systems the same key (the secret key) is used to encrypt and decrypt a message. |
Use of asymmetric systems enhances the security of communication. | Use of asymmetric systems enhances the security of communication. |
https://en.wikipedia.org/wiki/Cryptography#cite_note-12 | |
12 | |
Examples of asymmetric systems include RSA ( |
Examples of asymmetric systems include RSA ( |
https://en.wikipedia.org/wiki/Rivest-Shamir-Adleman | |
https://en.wikipedia.org/wiki/Elliptic_Curve_Cryptography | |
Symmetric models include the commonly used AES ( |
Symmetric models include the commonly used AES ( |
https://en.wikipedia.org/wiki/Advanced_Encryption_Standard | |
https://en.wikipedia.org/wiki/Data_Encryption_Standard | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-13 | |
13 | |
In | In |
https://en.wikipedia.org/wiki/Colloquial | |
https://en.wikipedia.org/wiki/Code_(cryptography) | |
However, in cryptography, | However, in cryptography, Modern cryptography Cryptography |
It means the replacement of a unit of plaintext (i.e., a meaningful word or phrase) with a | It means the replacement of a unit of plaintext (i.e., a meaningful word or phrase) with a |
https://en.wikipedia.org/wiki/Code_word | |
https://en.wikipedia.org/wiki/Cryptanalysis | |
Some use the terms | Some use the terms |
https://en.wikipedia.org/wiki/Cryptography#cite_note-goldreichbook-14 | |
14 | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-websters-15 | |
15 | |
English is more flexible than several other languages in which | English is more flexible than several other languages in which |
https://en.wikipedia.org/wiki/Request_for_Comments_(identifier) | |
https://tools.ietf.org/html/rfc2828 | |
https://en.wikipedia.org/wiki/Steganography | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-16 | |
16 | |
The study of characteristics of languages that have some application in cryptography or cryptology (e.g. frequency data, letter combinations, universal patterns, etc.) is called cryptolinguistics. | The study of characteristics of languages that have some application in cryptography or cryptology (e.g. frequency data, letter combinations, universal patterns, etc.) is called cryptolinguistics. |
History of Cryptography | History of Cryptography Cryptography Cryptography is also a branch of |
Before the modern era, cryptography focused on message confidentiality (i.e., encryption)—conversion of | Before the modern era, cryptography focused on message confidentiality (i.e., encryption)—conversion of |
https://en.wikipedia.org/wiki/Information | |
Encryption attempted to ensure | Encryption attempted to ensure |
https://en.wikipedia.org/wiki/Secrecy | |
https://en.wikipedia.org/wiki/Communications | |
https://en.wikipedia.org/wiki/Spy | |
https://en.wikipedia.org/wiki/Diplomat | |
In recent decades, the field has expanded beyond confidentiality concerns to include techniques for message integrity checking, sender/receiver identity | In recent decades, the field has expanded beyond confidentiality concerns to include techniques for message integrity checking, sender/receiver identity |
https://en.wikipedia.org/wiki/Authentication | |
https://en.wikipedia.org/wiki/Digital_signature | |
https://en.wikipedia.org/wiki/Interactive_proof_system | |
https://en.wikipedia.org/wiki/Secure_multiparty_computation | |
Computer era | Computer era |
Prior to the early 20th century, cryptography was mainly concerned with | Prior to the early 20th century, cryptography was mainly concerned with |
https://en.wikipedia.org/wiki/Language | |
https://en.wikipedia.org/wiki/Lexicographic_code | |
Since then the emphasis has shifted, and cryptography now makes extensive use of mathematics, including aspects of | Since then the emphasis has shifted, and cryptography now makes extensive use of mathematics, including aspects of |
https://en.wikipedia.org/wiki/Information_theory | |
https://en.wikipedia.org/wiki/Computational_complexity_theory | |
https://en.wikipedia.org/wiki/Statistics | |
https://en.wikipedia.org/wiki/Combinatorics | |
https://en.wikipedia.org/wiki/Abstract_algebra | |
https://en.wikipedia.org/wiki/Number_theory | |
Cryptography is also a branch of | Cryptography is also a branch of Cryptography History of Cryptography |
https://en.wikipedia.org/wiki/Engineering | |
https://en.wikipedia.org/wiki/Security_engineering | |
There is also active research examining the relationship between cryptographic problems and | There is also active research examining the relationship between cryptographic problems and |
https://en.wikipedia.org/wiki/Quantum_physics | |
https://en.wikipedia.org/wiki/Quantum_cryptography | |
https://en.wikipedia.org/wiki/Quantum_computer | |
Just as the development of digital computers and electronics helped in cryptanalysis, it made possible much more complex ciphers. | Just as the development of digital computers and electronics helped in cryptanalysis, it made possible much more complex ciphers. |
Furthermore, computers allowed for the encryption of any kind of data representable in any binary format, unlike classical ciphers which only encrypted written language texts; this was new and significant. | Furthermore, computers allowed for the encryption of any kind of data representable in any binary format, unlike classical ciphers which only encrypted written language texts; this was new and significant. |
Computer use has thus supplanted linguistic cryptography, both for cipher design and cryptanalysis. | Computer use has thus supplanted linguistic cryptography, both for cipher design and cryptanalysis. |
Many computer ciphers can be characterized by their operation on | Many computer ciphers can be characterized by their operation on |
https://en.wikipedia.org/wiki/Binary_numeral_system | |
binary | binary |
https://en.wikipedia.org/wiki/Bit | |
However, computers have also assisted cryptanalysis, which has compensated to some extent for increased cipher complexity. | However, computers have also assisted cryptanalysis, which has compensated to some extent for increased cipher complexity. |
Nonetheless, good modern ciphers have stayed ahead of cryptanalysis; it is typically the case that use of a quality cipher is very efficient (i.e., fast and requiring few resources, such as memory or CPU capability), while breaking it requires an effort many orders of magnitude larger, and vastly larger than that required for any classical cipher, making cryptanalysis so inefficient and impractical as to be effectively impossible. | Nonetheless, good modern ciphers have stayed ahead of cryptanalysis; it is typically the case that use of a quality cipher is very efficient (i.e., fast and requiring few resources, such as memory or CPU capability), while breaking it requires an effort many orders of magnitude larger, and vastly larger than that required for any classical cipher, making cryptanalysis so inefficient and impractical as to be effectively impossible. |
Advent of modern cryptography | Advent of modern cryptography Modern cryptography However, in cryptography, |
https://en.wikipedia.org/wiki/Cryptanalysis | |
In the United Kingdom, cryptanalytic efforts at | In the United Kingdom, cryptanalytic efforts at |
https://en.wikipedia.org/wiki/Bletchley_Park | |
This culminated in the development of the | This culminated in the development of the |
https://en.wikipedia.org/wiki/Colossus_computer | |
https://en.wikipedia.org/wiki/Computer_programming | |
https://en.wikipedia.org/wiki/Lorenz_SZ40/42 | |
Extensive open academic research into cryptography is relatively recent; it began only in the mid-1970’s. | Extensive open academic research into cryptography is relatively recent; it began only in the mid-1970’s. |
In recent times, IBM personnel designed the algorithm that became the Federal (i.e., US) | In recent times, IBM personnel designed the algorithm that became the Federal (i.e., US) |
https://en.wikipedia.org/wiki/Data_Encryption_Standard | |
https://en.wikipedia.org/wiki/Whitfield_Diffie | |
https://en.wikipedia.org/wiki/Martin_Hellman | |
https://en.wikipedia.org/wiki/Diffie-Hellman | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-dh2-30 | |
30 | |
and the | and the and |
https://en.wikipedia.org/wiki/RSA_(algorithm) | |
https://en.wikipedia.org/wiki/Martin_Gardner | |
https://en.wikipedia.org/wiki/Scientific_American | |
Following their work in 1976, it became popular to consider cryptography systems based on mathematical problems that are easy to state but have been found difficult to solve. | Following their work in 1976, it became popular to consider cryptography systems based on mathematical problems that are easy to state but have been found difficult to solve. |
https://en.wikipedia.org/wiki/Cryptography#cite_note-31 | |
31 | |
Since then, cryptography has become a widely used tool in communications, | Since then, cryptography has become a widely used tool in communications, |
https://en.wikipedia.org/wiki/Computer_network | |
https://en.wikipedia.org/wiki/Computer_security | |
Some modern cryptographic techniques can only keep their keys secret if certain mathematical problems are | Some modern cryptographic techniques can only keep their keys secret if certain mathematical problems are |
https://en.wikipedia.org/wiki/Computational_complexity_theory#Intractability | |
https://en.wikipedia.org/wiki/Integer_factorization | |
https://en.wikipedia.org/wiki/Discrete_logarithm | |
https://en.wikipedia.org/wiki/Abstract_mathematics | |
There are very few cryptosystems that are proven to be unconditionally secure. | There are very few cryptosystems that are proven to be unconditionally secure. |
The | The The US |
https://en.wikipedia.org/wiki/One-time_pad | |
There are a few important algorithms that have been proven secure under certain assumptions. | There are a few important algorithms that have been proven secure under certain assumptions. |
For example, the infeasibility of factoring extremely large integers is the basis for believing that | For example, the infeasibility of factoring extremely large integers is the basis for believing that |
https://en.wikipedia.org/wiki/RSA_(cryptosystem) | |
In practice, these are widely used, and are believed unbreakable in practice by most competent observers. | In practice, these are widely used, and are believed unbreakable in practice by most competent observers. |
There are systems similar to RSA, such as one by | There are systems similar to RSA, such as one by |
https://en.wikipedia.org/wiki/Michael_O._Rabin | |
The | The The US |
https://en.wikipedia.org/wiki/Discrete_logarithm_problem | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-32 | |
32 | |
As well as being aware of cryptographic history, cryptographic algorithm and system designers must also sensibly consider probable future developments while working on their designs. | As well as being aware of cryptographic history, cryptographic algorithm and system designers must also sensibly consider probable future developments while working on their designs. |
For instance, continuous improvements in computer processing power have increased the scope of | For instance, continuous improvements in computer processing power have increased the scope of |
https://en.wikipedia.org/wiki/Brute-force_attack | |
https://en.wikipedia.org/wiki/Key_length | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-fortify-33 | |
33 | |
The potential effects of | The potential effects of |
https://en.wikipedia.org/wiki/Quantum_computing | |
https://en.wikipedia.org/wiki/Post-quantum_cryptography | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-hac-4 | |
Symmetric-key cryptography | Symmetric-key cryptography Public-key cryptography |
Main article: |
Main article: |
https://en.wikipedia.org/wiki/Symmetric-key_algorithm | |
https://en.wikipedia.org/wiki/File:Symmetric_key_encryption.svg | |
https://upload.wikimedia.org/wikipedia/commons/thumb/2/27/Symmetric_key_encryption.svg/250px-Symmetric_key_encryption.svg.png | |
diagram showing encrypt with a key and decrypt process | diagram showing encrypt with a key and decrypt process |
Symmetric-key cryptography, where a single key is used for encryption and decryption | Symmetric-key cryptography, where a single key is used for encryption and decryption Public-key cryptography, where different keys are used for encryption and decryption. |
Symmetric-key cryptography refers to encryption methods in which both the sender and receiver share the same key (or, less commonly, in which their keys are different, but related in an easily computable way). | Symmetric-key cryptography refers to encryption methods in which both the sender and receiver share the same key (or, less commonly, in which their keys are different, but related in an easily computable way). |
This was the only kind of encryption publicly known until June 1976. | This was the only kind of encryption publicly known until June 1976. |
https://en.wikipedia.org/wiki/Cryptography#cite_note-dh2-30 | |
30 | |
https://en.wikipedia.org/wiki/File:International_Data_Encryption_Algorithm_InfoBox_Diagram.svg | |
https://upload.wikimedia.org/wikipedia/commons/thumb/a/af/International_Data_Encryption_Algorithm_InfoBox_Diagram.svg/220px-International_Data_Encryption_Algorithm_InfoBox_Diagram.svg.png | |
logic diagram showing International Data Encryption Algorithm cypher process | logic diagram showing International Data Encryption Algorithm cypher process |
One round (out of 8.5) of the |
|
https://en.wikipedia.org/wiki/International_Data_Encryption_Algorithm | |
https://en.wikipedia.org/wiki/Pretty_Good_Privacy | |
Symmetric key ciphers are implemented as either | Symmetric key ciphers are implemented as either |
https://en.wikipedia.org/wiki/Block_ciphers | |
https://en.wikipedia.org/wiki/Stream_ciphers | |
A block cipher enciphers input in blocks of plaintext as opposed to individual characters, the input form used by a stream cipher. | A block cipher enciphers input in blocks of plaintext as opposed to individual characters, the input form used by a stream cipher. |
The | The The US |
https://en.wikipedia.org/wiki/Data_Encryption_Standard | |
https://en.wikipedia.org/wiki/Advanced_Encryption_Standard | |
https://en.wikipedia.org/wiki/Cryptography_standards | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-aes-34 | |
34 | |
Despite its deprecation as an official standard, DES (especially its still-approved and much more secure | Despite its deprecation as an official standard, DES (especially its still-approved and much more secure |
https://en.wikipedia.org/wiki/Triple-DES | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-atm-35 | |
35 | |
to | to |
https://en.wikipedia.org/wiki/E-mail_privacy | |
e-mail privacy | e-mail privacy |
https://en.wikipedia.org/wiki/Cryptography#cite_note-opgp-36 | |
36 | |
and | and and the |
https://en.wikipedia.org/wiki/Secure_Shell | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-ssh-37 | |
37 | |
Many other block ciphers have been designed and released, with considerable variation in quality. | Many other block ciphers have been designed and released, with considerable variation in quality. |
Many, even some designed by capable practitioners, have been thoroughly broken, such as | Many, even some designed by capable practitioners, have been thoroughly broken, such as |
https://en.wikipedia.org/wiki/FEAL | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-hac-4 | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-schneierbook-38 | |
38 | |
Stream ciphers, in contrast to the ‘block’ type, create an arbitrarily long stream of key material, which is combined with the plaintext bit-by-bit or character-by-character, somewhat like the | Stream ciphers, in contrast to the ‘block’ type, create an arbitrarily long stream of key material, which is combined with the plaintext bit-by-bit or character-by-character, somewhat like the |
https://en.wikipedia.org/wiki/One-time_pad | |
In a stream cipher, the output stream is created based on a hidden internal state that changes as the cipher operates. | In a stream cipher, the output stream is created based on a hidden internal state that changes as the cipher operates. |
That internal state is initially set up using the secret key material. | That internal state is initially set up using the secret key material. |
https://en.wikipedia.org/wiki/RC4 | |
https://en.wikipedia.org/wiki/Category:Stream_ciphers | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-hac-4 | |
https://en.wikipedia.org/wiki/Block_cipher_modes_of_operation | |
https://en.wikipedia.org/wiki/Cryptographic_hash_functions | |
They take a message of any length as input, and output a short, fixed length | They take a message of any length as input, and output a short, fixed length |
https://en.wikipedia.org/wiki/Hash_function | |
For good hash functions, an attacker cannot find two messages that produce the same hash. | For good hash functions, an attacker cannot find two messages that produce the same hash. |
https://en.wikipedia.org/wiki/MD4 | |
https://en.wikipedia.org/wiki/MD5 | |
The US | The US The |
https://en.wikipedia.org/wiki/National_Security_Agency | |
https://en.wikipedia.org/wiki/SHA-1 | |
https://en.wikipedia.org/wiki/SHA-2 | |
https://en.wikipedia.org/wiki/National_Institute_of_Standards_and_Technology | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-39 | |
39 | |
Thus, a | Thus, a |
https://en.wikipedia.org/wiki/NIST_hash_function_competition | |
https://en.wikipedia.org/wiki/SHA-3 | |
The competition ended on October 2, 2012 when the NIST announced that | The competition ended on October 2, 2012 when the NIST announced that |
https://en.wikipedia.org/wiki/Keccak | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-40 | |
40 | |
Unlike block and stream ciphers that are invertible, cryptographic hash functions produce a hashed output that cannot be used to retrieve the original input data. | Unlike block and stream ciphers that are invertible, cryptographic hash functions produce a hashed output that cannot be used to retrieve the original input data. |
Cryptographic hash functions are used to verify the authenticity of data retrieved from an untrusted source or to add a layer of security. | Cryptographic hash functions are used to verify the authenticity of data retrieved from an untrusted source or to add a layer of security. |
https://en.wikipedia.org/wiki/Message_authentication_code | |
https://en.wikipedia.org/wiki/Cryptography#cite_note-hac-4 | |
https://en.wikipedia.org/wiki/Md5 | |
Modern cryptography | Modern cryptography Advent of modern cryptography Cryptography |
The modern field of cryptography can be divided into several areas of study. | The modern field of cryptography can be divided into several areas of study. |
The chief ones are discussed here; see | The chief ones are discussed here; see |
https://en.wikipedia.org/wiki/Topics_in_Cryptography | |
Public-key cryptography | Public-key cryptography Symmetric-key cryptography Cryptography |
https://en.wikipedia.org/wiki/File:Public_key_encryption.svg | |
https://upload.wikimedia.org/wikipedia/commons/thumb/f/f9/Public_key_encryption.svg/250px-Public_key_encryption.svg.png | |
diagram of Public-key cryptography showing public key and private key | diagram of Public-key cryptography showing public key and private key |
Public-key cryptography, where different keys are used for encryption and decryption. | Public-key cryptography, where different keys are used for encryption and decryption. Symmetric-key cryptography, where a single key is used for encryption and decryption |
Symmetric-key cryptosystems use the same key for encryption and decryption of a message, although a message or group of messages can have a different key than others. | Symmetric-key cryptosystems use the same key for encryption and decryption of a message, although a message or group of messages can have a different key than others. |
A significant disadvantage of symmetric ciphers is the | A significant disadvantage of symmetric ciphers is the |
https://en.wikipedia.org/wiki/Key_management | |
Each distinct pair of communicating parties must, ideally, share a different key, and perhaps for each ciphertext exchanged as well. | Each distinct pair of communicating parties must, ideally, share a different key, and perhaps for each ciphertext exchanged as well. |
The number of keys required increases as the | The number of keys required increases as the |
https://en.wikipedia.org/wiki/Square_(algebra) | |
https://en.wikipedia.org/wiki/File:Diffie_and_Hellman.jpg | |
https://upload.wikimedia.org/wikipedia/commons/thumb/8/88/Diffie_and_Hellman.jpg/220px-Diffie_and_Hellman.jpg | |
headshots of Whitfield Diffie and Martin Hellman | headshots of Whitfield Diffie and Martin Hellman |
Optional | Optional |