<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=User%3AMatt_Crypto%2FSimplified_Cryptography</id>
	<title>User:Matt Crypto/Simplified Cryptography - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=User%3AMatt_Crypto%2FSimplified_Cryptography"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=User:Matt_Crypto/Simplified_Cryptography&amp;action=history"/>
	<updated>2026-05-07T22:20:00Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=User:Matt_Crypto/Simplified_Cryptography&amp;diff=774720&amp;oldid=prev</id>
		<title>imported&gt;Matt Crypto: Reverted edits by 59.99.134.164 (talk) to last version by Kevyn</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=User:Matt_Crypto/Simplified_Cryptography&amp;diff=774720&amp;oldid=prev"/>
		<updated>2009-02-17T12:13:16Z</updated>

		<summary type="html">&lt;p&gt;Reverted edits by &lt;a href=&quot;/wiki143/index.php?title=Special:Contributions/59.99.134.164&quot; title=&quot;Special:Contributions/59.99.134.164&quot;&gt;59.99.134.164&lt;/a&gt; (&lt;a href=&quot;/wiki143/index.php?title=User_talk:59.99.134.164&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;User talk:59.99.134.164 (page does not exist)&quot;&gt;talk&lt;/a&gt;) to last version by Kevyn&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;&amp;#039;Cryptography&amp;#039;&amp;#039;&amp;#039; (from [[Greek language|Greek]] &amp;#039;&amp;#039;krypt&amp;amp;oacute;s&amp;#039;&amp;#039;, &amp;quot;hidden&amp;quot;, and &amp;#039;&amp;#039;gr&amp;amp;aacute;phein&amp;#039;&amp;#039;, &amp;quot;to write&amp;quot;) is, traditionally, the practice of rendering [[information]] in an obscured form in order to prevent others from understanding it. In recent decades, cryptography has expanded its remit and now provides mechanisms for a wide range of [[security]] goals, in addition to the ever-important task of ensuring [[secrecy]] in [[communication]]s. Cryptography is an [[interdisciplinary]] subject, drawing from several fields: it can be viewed as an application of [[information theory]], and yet it makes extensive use of other areas of [[mathematics]] too, notably [[number theory]]. It is also a branch of [[engineering]], but an unusual one as it must deal with active, intelligent and malevolent opposition (see [[cryptographic engineering]] and [[security engineering]]).&lt;br /&gt;
&lt;br /&gt;
Closely related fields are [[steganography]], which is distinguished from cryptography as the study of ways of obscuring the very &amp;#039;&amp;#039;existence&amp;#039;&amp;#039; of a [[message]], and not the contents of the message itself; and [[traffic analysis]], which is the analysis of patterns of communication in order to gain knowledge.&lt;br /&gt;
&lt;br /&gt;
==Terminology==&lt;br /&gt;
The original information which is to be protected by cryptography is called the &amp;#039;&amp;#039;[[plaintext]]&amp;#039;&amp;#039;. &amp;#039;&amp;#039;[[Encryption]]&amp;#039;&amp;#039; is the process of converting plaintext into an unreadable form, termed &amp;#039;&amp;#039;[[ciphertext]]&amp;#039;&amp;#039;, or, occasionally, a &amp;#039;&amp;#039;[[cryptogram]]&amp;#039;&amp;#039;. &amp;#039;&amp;#039;[[Decryption]]&amp;#039;&amp;#039; is the reverse process, recovering the plaintext back from the ciphertext. &amp;#039;&amp;#039;Enciphering&amp;#039;&amp;#039; and &amp;#039;&amp;#039;deciphering&amp;#039;&amp;#039; are alternative terms. A &amp;#039;&amp;#039;[[cipher]]&amp;#039;&amp;#039; is an [[algorithm]] for encryption and decryption. The exact operation of a cipher is almost always controlled by one or more &amp;#039;&amp;#039;[[Cryptographic key|keys]]&amp;#039;&amp;#039; &amp;amp;mdash pieces of information that customise the encryption and decryption. &amp;#039;&amp;#039;[[cryptographic protocol|Protocol]]s&amp;#039;&amp;#039; specify the details of how ciphers (and other cryptographic primitives) are to be used to achieve specific tasks. Protocols, cryptographic algorithms, prescribed actions and other specifics are combined together and implemented in a &amp;#039;&amp;#039;[[crypto system|cryptosystem]]&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
In ordinary parlance, a (secret) &amp;quot;[[code]]&amp;quot; is synonymous with &amp;quot;cipher&amp;quot;. In cryptography, however, the term has a specialised, [[code|technical meaning]], and should be avoided unless this is intended.&lt;br /&gt;
&lt;br /&gt;
The study of how to circumvent the use of cryptography is called &amp;#039;&amp;#039;[[cryptanalysis]]&amp;#039;&amp;#039;; an &amp;#039;&amp;#039;attack&amp;#039;&amp;#039; is a specific attempt at or method for cryptanalysis. Cryptography and cryptanalysis are sometimes linked together under the umbrella term &amp;quot;cryptology&amp;quot;, though &amp;quot;cryptography&amp;quot; also has this wider meaning, and both are acceptable terms for the entire field. &amp;quot;Crypto&amp;quot; is a common informal abbreviation for cryptography&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Cipher&amp;quot; is alternatively spelt &amp;quot;cypher&amp;quot;; similarly &amp;quot;ciphertext&amp;quot; and &amp;quot;cyphertext&amp;quot;, and so forth. Although both spellings have long histories in English, there is occasional tension between their adherents.&lt;br /&gt;
&lt;br /&gt;
==Cryptanalysis==&lt;br /&gt;
&amp;#039;&amp;#039;Main article&amp;#039;&amp;#039;: [[Cryptanalysis]]&lt;br /&gt;
&lt;br /&gt;
A cryptanalyst might appear to be the natural adversary of a cryptographer, and to an extent this is true: one can view this contest all through the [[history of cryptography]]. However, it is also possible to interpret the two roles as complementary: a thorough understanding of cryptanalysis is necessary to create secure cryptography.&lt;br /&gt;
&lt;br /&gt;
A variety of different assumptions are considered regarding what an attacker can know and do in order to learn secret information. One important distinction is whether the cryptanalyst has access only to ciphertext, whether he also knows or can guess some corresponding plaintexts, or even if he can &amp;#039;&amp;#039;choose&amp;#039;&amp;#039; plaintexts to be encrypted; (see [[ciphertext-only attack|ciphertext only]], [[known-plaintext attack|known plaintext]] and [[chosen plaintext attack|chosen plaintext]]). These scenarios all view the cipher as a [[black box]]. Some attacks, however, are based on the [[implementation]] of the cipher. If a cryptanalyst has access to, for example, [[Timing attack|timing]] or power consumption, he may be able to deduce secret information.&lt;br /&gt;
&lt;br /&gt;
Notable methods of cryptanalysis include [[Brute force attack|exhaustive search]] for the key, which is a risk for all ciphers. [[Linear cryptanalysis]] and [[differential cryptanalysis]] are general methods for [[symmetric key algorithm|symmetric key cryptography]]. When cryptography relies on [[NP-hard|hard]] mathematical problems, as is usually the case in [[asymmetric key algorithm|asymmetric cryptography]], algorithms for tasks such as [[factoring]] become potential tools for cryptanalysis.&lt;br /&gt;
&lt;br /&gt;
==History of cryptography==&lt;br /&gt;
&amp;#039;&amp;#039;Main article&amp;#039;&amp;#039;: [[History of cryptography]]&lt;br /&gt;
&lt;br /&gt;
Cryptography has had a long and colourful [[history of cryptography|history]]. &lt;br /&gt;
The earliest forms of secret writing required only pen and paper, and are now collectively termed &amp;#039;&amp;#039;classical&amp;#039;&amp;#039; cryptography. The two main categories are [[transposition cipher]]s, which rearrange the order of letters in a message, and [[substitution cipher]]s, which systematically replace groups of letters with others. Classical ciphers tend to leak varying amounts of information about the [[statistics]] of the plaintext, and because of this they are easily broken, for example by [[frequency analysis]]. Classical ciphers still enjoy popularity today, though mostly as [[puzzle]]s (see [[cryptogram]]).&lt;br /&gt;
&lt;br /&gt;
Early in the 20th century, several mechanical devices were invented for performing encryption, including [[rotor machine]]s &amp;amp;mdash most famously the [[Enigma]] cipher used in [[World War II]]. The ciphers implemented by these machines brought about a significant increase in the complexity of cryptanalysis. The various attacks on Enigma, for example, succeeded only after considerable effort.&lt;br /&gt;
&lt;br /&gt;
With the advent of digital [[computers]] and [[electronics]], very complex ciphers could be implemented. A characteristic of computer ciphers is that they operate on binary strings unlike classical and mechanical schemes, which use an alphabet of around 26 letters, depending on the language. Computer ciphers are also much more resistant to cryptanalysis; few are susceptible to a ciphertext-only attack.&lt;br /&gt;
&lt;br /&gt;
Extensive academic research into modern cryptography is relatively recent &amp;amp;mdash it only began in the open community during the 1970s with the specification of [[DES]] and the invention of [[RSA]]. It is well that much progress has been made in a short time; popular applications such as the [[Internet]] and [[mobile phone]]s have repositioned cryptography, historically the sole province of a few groups with exceptional needs for secrecy, into a mainstream technology on which millions rely.&lt;br /&gt;
&lt;br /&gt;
As well as noting lessons from its history, cryptographers are also careful to consider the future. [[Moore&amp;#039;s law]] is routinely taken into account when specifying [[Cryptographic_key_length|key-lengths]], and the potential effects of [[Quantum_Cryptography#Quantum_Computing_applications_for_Cryptanalysis|quantum computing]] have already been considered. Note also [[quantum cryptography]].&lt;br /&gt;
&lt;br /&gt;
==Secure communications==&lt;br /&gt;
&amp;#039;&amp;#039;See also:&amp;#039;&amp;#039; [[Information security]]&lt;br /&gt;
&lt;br /&gt;
Cryptography is commonly used for [[Information_security|securing]] [[communication]]s. Four desirable properties are:&lt;br /&gt;
&lt;br /&gt;
# [[confidentiality]], also known as [[secrecy]]: only an authorised recipient should be able to extract the contents of the message from its encrypted form. Otherwise, it should not be possible to obtain any significant information about the message contents.&lt;br /&gt;
# [[data integrity|integrity]]: the recipient should be able to determine if the message has been altered during transmission.&lt;br /&gt;
# [[authentication]]: the recipient should be able to identify the sender, and verify that the purported sender actually did send the message.&lt;br /&gt;
# [[non-repudiation]]: the sender should not be able to deny sending the message.&lt;br /&gt;
&lt;br /&gt;
Cryptography can provide mechanisms to help achieve all of the above. However, some goals aren&amp;#039;t always necessary, practical or even desirable in some contexts. For example, the sender of a message may wish to remain anonymous; clearly non-repudiation would be inappropriate.&lt;br /&gt;
&lt;br /&gt;
==Symmetric key cryptography==&lt;br /&gt;
&amp;#039;&amp;#039;Main article&amp;#039;&amp;#039;: [[Symmetric key algorithm]]&lt;br /&gt;
&lt;br /&gt;
Symmetric key ciphers use the same key for encryption and decryption, or a little more precisely, the key used for decryption is &amp;quot;easy&amp;quot; to calculate from the key used for encryption. Other terms include &amp;quot;private-key&amp;quot;, &amp;quot;one-key&amp;quot; and &amp;quot;single-key&amp;quot; cryptography. &lt;br /&gt;
&lt;br /&gt;
Symmetric key ciphers can be broadly grouped into [[block cipher]]s and [[stream cipher]]s. Stream ciphers encrypt one bit at a time, in contrast to a block cipher, which operates on a group of bits (a &amp;quot;block&amp;quot;) of a certain length all in one go. The block ciphers [[DES]], [[International Data Encryption Algorithm|IDEA]] and [[AES]], and the stream cipher [[RC4 (cipher)|RC4]], are among the most well-known symmetric key ciphers.&lt;br /&gt;
&lt;br /&gt;
Other cryptographic primitives are sometimes classified as symmetric cryptography:&lt;br /&gt;
* [[Cryptographic hash function]]s produce a [[hash function|hash]] of a message. While it should be easy to compute, it must be very difficult to invert ([[one way function|one-way]]-ness, though other properties are usually needed as well). [[MD5]] and [[SHA-1]] are well-known hash functions.&lt;br /&gt;
* [[Message authentication code]]s (MACs), also known as &amp;#039;&amp;#039;keyed-hash functions&amp;#039;&amp;#039;, are similar to hash functions, except that a key is needed to compute the hash. As the name suggests, they are commonly used for message authentication. They are often constructed from other primitives, such as block ciphers, unkeyed-hash functions or stream ciphers.&lt;br /&gt;
&lt;br /&gt;
==Public key cryptography==&lt;br /&gt;
&amp;#039;&amp;#039;Main article&amp;#039;&amp;#039;: [[Public key cryptography]] / [[Asymmetric key algorithm]]&lt;br /&gt;
&lt;br /&gt;
Symmetric key encryption has a troublesome drawback &amp;amp;mdash two people who wish to exchange confidential messages must share a secret key. The key must be exchanged in a secure way, and not by the means they would normally communicate. This is usually inconvenient, and public-key (or aysmmetric) cryptography provides an alternative. In public key encryption there are two keys used, a &amp;#039;&amp;#039;public&amp;#039;&amp;#039; and a &amp;#039;&amp;#039;private&amp;#039;&amp;#039; key, for encryption and decryption respectively. It must be &amp;quot;difficult&amp;quot; to derive the private key from the public key. This means that someone can freely send their public key out over an insecure [[channel]] and yet be sure that only they can decrypt messages encrypted with it.&lt;br /&gt;
&lt;br /&gt;
Public key algorithms are usually based on [[NP-hard|hard]] mathematical problems. [[RSA]], for example, relies on the (conjectured) difficulty of [[factorisation]]. For efficiency reasons, &amp;#039;&amp;#039;hybrid&amp;#039;&amp;#039; encryption systems are usually used in practice; a key is exchanged using a public-key cipher, and the rest of the communication is encrypted using a symmetric-key algorithm (which is typically much faster). [[Elliptic curve cryptography]] is a type of public-key algorithm that may offer efficiency gains over other schemes.&lt;br /&gt;
&lt;br /&gt;
Assymetric cryptography also provides mechanisms for [[digital signature]]s, which are a digital equivalent of physical signatures for paper documents, for example [[DSA]] and [[ElGamal]].&lt;br /&gt;
&lt;br /&gt;
==Other Topics==&lt;br /&gt;
&amp;#039;&amp;#039;See also&amp;#039;&amp;#039;: [[Topics in cryptography]]&lt;br /&gt;
&lt;br /&gt;
The security of all practical encryption schemes remains unproven, both for symmetric and asymmetric schemes. For symmetric ciphers, confidence gained in an algorithm is usually anecdotal &amp;amp;mdash e.g. no successful attack has been reported on an algorithm for several years despite intensive analysis. Such a cipher might also have provable security against a limited class of attacks. For asymmetric schemes, it is common to rely on the difficulty of the associated mathematical problem, but this, too, is not provably secure.&lt;br /&gt;
&lt;br /&gt;
Surprisingly, cryptography does have provably secure ciphers &amp;amp;mdash the [[one time pad]], for example. However, such schemes require keys as long as the plaintext, so are almost always too cumbersome to use.&lt;br /&gt;
&lt;br /&gt;
When the security of a system fails, it is rare that a weakness in the cryptographic algorithms is exploited. More often, it is a mistake in the implementation, the protocols used or some other human error. The study of how best to implement and integrate cryptography is a field in itself, see: [[cryptographic engineering]], [[security engineering]] and [[crypto system|cryptosystem]].&lt;br /&gt;
&lt;br /&gt;
Cryptography can be used to implement some remarkable protocols: [[zero-knowledge proof]], [[secure multiparty computation]] and [[secret sharing]], for example.&lt;br /&gt;
&lt;br /&gt;
==Warnings==&lt;br /&gt;
Myths and misunderstandings about cryptography are widespread, and there is an abundance of insecure cryptographic software on the market, sometimes referred to (perjoratively) as [[snake oil]]. Readers, buyers, and users should therefore exercise substantial caution when selecting books and products; self-education is advised.&lt;br /&gt;
&lt;br /&gt;
==Further reading==&lt;br /&gt;
* [[Topics in cryptography]] &amp;amp;mdash an analytical list of articles and terms.&lt;br /&gt;
* [[List of cryptology topics]] &amp;amp;mdash an alphabetical list of article and terms.&lt;br /&gt;
* [[Books on cryptography]] &amp;amp;mdash an annotated list of suggested readings.&lt;br /&gt;
* [[List of cryptographers]] &amp;amp;mdash an annotated list of cryptographers.&lt;br /&gt;
* [[List of important publications in computer science#Cryptography|Important publications in cryptography]] &amp;amp;mdash some cryptography papers in computer science.&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
* [http://www.tcs.hut.fi/~helger/crypto/ Helger&amp;#039;s cryptography pointers]&lt;br /&gt;
* [http://www.rsasecurity.com/rsalabs/faq/index.html RSA Laboratories&amp;#039; FAQ About today&amp;#039;s cryptography ]&lt;br /&gt;
* [http://www.faqs.org/faqs/by-newsgroup/sci/sci.crypt.html The sci.crypt FAQ]&lt;br /&gt;
* [http://www.mindspring.com/~schlafly/crypto/faq.htm sci.crypt mini-FAQ (more recent)]&lt;br /&gt;
* [http://groups.google.com/groups?q=sci.crypt The sci.crypt newsgroup]&lt;br /&gt;
* [http://home.ecn.ab.ca/~jsavard/crypto/jscrypt.htm Savard&amp;#039;s glossary]&lt;br /&gt;
* [http://www.murky.org/cryptography/index.shtml The Beginner&amp;#039;s Guide to Cryptography] - An elementary overview of a few basic areas of cryptography.&lt;br /&gt;
* [http://www.hermetic.ch/crypto/intro.htm An Introduction to the Use of Encryption] - A fairly non-technical introduction to the subject.&lt;br /&gt;
* [http://www.mycrypto.net Encryption and Privacy]&lt;br /&gt;
&lt;br /&gt;
[[da:Dekryptering]]&lt;br /&gt;
[[de:Kryptografie]]&lt;br /&gt;
[[es:Criptografía]]&lt;br /&gt;
[[fr:Cryptographie]]&lt;br /&gt;
[[it:Crittografia]]&lt;br /&gt;
[[he:&amp;amp;#1511;&amp;amp;#1512;&amp;amp;#1497;&amp;amp;#1508;&amp;amp;#1496;&amp;amp;#1493;&amp;amp;#1490;&amp;amp;#1512;&amp;amp;#1508;&amp;amp;#1497;&amp;amp;#1492;]]&lt;br /&gt;
[[nl:Encryptie]]&lt;br /&gt;
[[ja:&amp;amp;#26263;&amp;amp;#21495;]]&lt;br /&gt;
[[pl:Kryptografia]]&lt;br /&gt;
[[pt:Criptografia]]&lt;br /&gt;
[[fi:Kryptografia]]&lt;br /&gt;
[[sv:Kryptografi]]&lt;/div&gt;</summary>
		<author><name>imported&gt;Matt Crypto</name></author>
	</entry>
</feed>