This action might not be possible to undo. Are you sure you want to continue?

BooksAudiobooksComicsSheet Music### Categories

### Categories

Scribd Selects Books

Hand-picked favorites from

our editors

our editors

Scribd Selects Audiobooks

Hand-picked favorites from

our editors

our editors

Scribd Selects Comics

Hand-picked favorites from

our editors

our editors

Scribd Selects Sheet Music

Hand-picked favorites from

our editors

our editors

Top Books

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Audiobooks

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Comics

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Sheet Music

What's trending, bestsellers,

award-winners & more

award-winners & more

P. 1

Cryptography|Views: 50|Likes: 4

Published by નિતીશ સેરસિયા

See more

See less

https://www.scribd.com/doc/36713214/Cryptography

04/04/2013

text

original

Cryptography is the practice and study of hiding information. In modern times, cryptography is considered a branch of both mathematics and computer science, and is affiliated closely with information theory, computer security, and engineering. Cryptography is used in applications present in technologically advanced societies; examples include the security of ATM cards, computer passwords, and electronic commerce, which all depend on cryptography. concealment of meaning. However, in cryptography, code has a more specific meaning; it means the replacement of a unit of plaintext (i.e., a meaningful word or phrase) with a code word (for example, apple pie replaces attack at dawn). Codes are no longer used in serious cryptography except incidentally for such things as unit designations (e.g., Bronco Flight or Operation Overlord) since properly chosen ciphers are both more practical and more secure than even the best codes, and better adapted to computers as well. Some use the terms cryptography and cryptology interchangeably in English, while others (including US military practice generally) use cryptography to refer specifically to the use and practice of cryptographic techniques, and cryptology to refer to the combined study of cryptography and cryptanalysis. English is more flexible than some other languages in which cryptology (done by cryptologists) is used in the second sense above. In the English Wikipedia, the general term used is cryptography (done by cryptographers). The study of characteristics of languages which have some application in cryptography (or cryptology), i.e. frequency data, letter combinations, universal patterns, etc. is called cryptolinguistics.

The German Lorenz cipher machine, used in World War II for encryption of very high-level general staff messages

Terminology

Until modern times, cryptography referred almost exclusively to encryption, the process of converting ordinary information (plaintext) into unintelligible gibberish (i.e., ciphertext). Decryption is the reverse, moving from unintelligible ciphertext to plaintext. A cipher (or cypher) is a pair of algorithms which creates the encryption and the reversing decryption. The detailed operation of a cipher is controlled both by the algorithm and, in each instance, by a key. This is a secret parameter (ideally, known only to the communicants) for a specific message exchange context. Keys are important, as ciphers without variable keys are trivially breakable and therefore less than useful for most purposes. Historically, ciphers were often used directly for encryption or decryption, without additional procedures such as authentication or integrity checks. In colloquial use, the term "code" is often used to mean any method of encryption or

Modern cryptography

The modern field of cryptography can be divided into several areas of study. The chief ones are discussed here; see Topics in Cryptography for more.

in which their keys are different. in a sense. DES (especially its still-approved and much more secure triple-DES variant) remains quite popular. share a different key. A significant disadvantage of symmetric ciphers is the key management necessary to use them securely. for instance. called asymmetric key) cryptography in which two & & & & ¢ ¤ £ ¦ ¦ ¡ Symmetric-key cryptosystems use the same key for encryption and decryption of a message. § § © ¨§ ¥¥ One round (out o 8.5) o the patented IDEA cipher. used in some versions o PGP for high-speed encryption of. some method of knitting together successive blocks is re uired. The Data Encryption Standard (DES and the Advanced Encryption Standard (AES are block cipher designs which have been designated cryptography standards by the S government (though DES's designation was finally withdrawn after the AES was adopted). also presents a chicken-and-egg problem which is a considerable practical obstacle for cryptography users in the real world. The difficulty of securely establishing a secret key between two communicating parties. but related in an easily computable way This was the only kind of encryption publicly known until June 1976. . some with better security in one aspect or another than others. See Category:Block ciphers. less commonly. Public-key cryptogr p y " " # % $ ! A cred card with smart card capabilities. with considerable variation in quality. ideally.ey cy y re ers to e cry tion methods in which both the sender and receiver share the same key (or. e-mail The modern study of symmetric-key ciphers relates mainly to the study of block ciphers and stream ciphers and to their applications. when a secure channel doesn't already e ist between them. and output a block of cipherte t of the same size. The 3 b 5 mm chip embedded in the card is shown enlarged in the insert. A block cipher is. Many other block ciphers have been designed and released. though a message or group of messages may have a different key than others. Symmetric-key cryptogr p y Sy e c. Since messages are almost always longer than a In a groundbreaking 1976 paper. it is used across a wide range of applications. Many have been thoroughly broken. and perhaps each cipherte t e changed as well. Whitfield Diffie and Martin Hellman proposed the notion of public-key (also. Each distinct pair of communicating parties must.single block. Despite its deprecation as an official standard. which very quickly requires comple key management schemes to keep them all straight and secret. They are the modes of operation and must be carefully considered when using a block cipher in a cryptosystem. The number of keys required increases as the square of the number of network members. Smart cards attempt to combine portability with the power to compute modern cryptographic algorithms. Several have been developed. more generally. from ATM encryption to e-mail privacy and secure remote access. a modern embodiment of Alberti's polyalphabetic cipher: block ciphers take as input a block of plainte t and a key.

is quite arbitrary. the public key may be freely distributed. exponentially dependent on the key size. in Shannon's terms) is beyond the ability of any adversary. Finally. In public-key cryptosystems. for example. Also important.e. Since no such showing can be made currently. while its paired private key must remain secret.Whitfield Diffie and Martin Hellman. In a known-plaintext attack. often overwhelmingly so.. as of today. Diffie and Hellman showed that public-key cryptography was possible by presenting the Diffie-Hellman key exchange protocol. A public key system is so constructed that calculation of one key (the 'private key') is computationally infeasible from the other (the 'public key'). thus permitting its subversion or evasion. In connection with his WWII work at Bell Labs. as compared to the effort needed to use the cipher. Instead. but the amount of effort needed may be ( ' ( Cryptographic primitives Much of the theoretical work in cryptography concerns cryptographic primitives algorithms with basic cryptographic properties and their relationship to other cryptographic problems. and of equal or greater length than the message. kept secret from all possible attackers. the cryptanalyst may choose a plaintext and learn its corresponding ciphertext (perhaps many times). see Cryptanalysis of the Enigma for some historical examples of this). as an interrelated pair. the one-time-pad remains the only theoretically unbreakable cipher. In a chosenplaintext attack. It is a commonly held misconception that every encryption method can be broken. are mistakes (generally in the design or use of one of the protocols involved. while the private or secret ey is used for decryption. which are used to develop more complex tools called cryptosystems or cryptographic protocols. in a chosen-ciphertext attack. the cryptanalyst has access to a ciphertext and its corresponding plaintext (or to many such pairs). "work factor". Note however. There are a wide variety of cryptanalytic attacks. authors of the first paper on public. the cryptanalyst has access only to the ciphertext (good modern cryptosystems are usually effectively immune to ciphertext-only attacks). used by the British during WWII. The historian David Kahn described public-key cryptography as "the most revolutionary new concept in the field since polyalphabetic substitution emerged in the Renaissance". apart from the one-time pad. and they can be classified in any of several ways. In a ciphertext-only attack. Most ciphers. never reused. which guarantee one or more high-level security properties. effective security could be achieved if it is proven that the effort required (i. even though they are necessarily related. can be broken with enough computational effort by brute force attack. Cryptanalysis The goal of cryptanalysis is to find some weakness or insecurity in a cryptographic scheme.ey cryptography different but mathematically related keys are used a public key and a private key. an example is gardening. the cryptanalyst may be able to choose ciphertexts and learn their corresponding plaintexts. that the distinction between cryptographic primitives and cryptosystems. provided the key material is truly random. In such cases. Claude Shannon proved that the one-time pad cipher is unbreakable. This means it must be shown that no efficient method (as opposed to the time-consuming brute force method) can be found to break the cipher. A common distinction turns on what an attacker knows and what capabilities are available. both keys are generated secretly. These primitives provide fundamental properties. More complicated cryptographic tools are then built from these basic primitives. The public ey is typically used for encryption. .

or cryptosystem. Cryptosystems (e. CPA security in the random oracle model).g. the cryptosystem's structure involves back and forth communication among two or more parties in space (e. etc. Till recently.. one-way functions. PGP.co. signcryption systems.org/wiki/cryptography Image source: images. Such cryptosystems are sometimes called cryptographic protocols.the RSA algorithm is sometimes considered a cryptosystem. Some widely known cryptosystems include RSA encryption. Cryptosystems use the properties of the underlying cryptographic primitives to support the system's security properties. More complex cryptosystems include electronic cash systems. The general idea of provable security is to give arguments about the computational difficulty needed to Reference Data source: www. Typical examples of cryptographic primitives include pseudorandom functions. public key encryption) while guaranteeing certain security properties (e.. between the sender of a secure message and its receiver) or across time (e.g.g. this has been generally called provable security. as the distinction between primitives and cryptosystems is somewhat arbitrary. less practical) cryptosystems include interactive proof systems. The study of how best to implement and integrate cryptography in software applications is itself a distinct field. (like zeroknowledge proofs. El-Gamal encryption) are designed to provide particular functionality (e.). called a cryptographic system. there has been considerable effort to develop formal techniques for establishing the security of cryptosystems. and sometimes a primitive. or using ad hoc reasoning. most security properties of most cryptosystems were demonstrated using empirical techniques. etc.e.google. In many cases. Cryptosystems One or more cryptographic primitives are often used to develop a more complex algorithm. Of course. Some more 'theoretical' (i. etc. etc. Recently.in . a sophisticated cryptosystem can be derived from a combination of several more primitive cryptosystems. systems for secret sharing. to any adversary).wikipedia.. El-Gamal encryption.g.g. compromise some security aspect of the cryptosystem (ie. Schnorr signature. cryptographically protected backup data). see: cryptographic engineering and security engineering.

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd