<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=DrCrypto</id>
	<title>Conservapedia - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=DrCrypto"/>
	<link rel="alternate" type="text/html" href="https://www.conservapedia.com/Special:Contributions/DrCrypto"/>
	<updated>2026-11-19T03:17:36Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.35.14</generator>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=478627</id>
		<title>Binary tree</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Binary_tree&amp;diff=478627"/>
		<updated>2008-06-20T16:33:20Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: New page: A '''binary treee''' is one of the fundamental data structures of computer science, along with the array, the index, and the look-up table. The prima...&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;A '''binary treee''' is one of the [[fundamentalism|fundamental]] [[data structure]]s of [[computer science]], along with the [[array]], the [[index]], and the [[look-up table]]. The primary distinguishing features of a binary tree data structure are that it is tree-shaped, and that it consists solely of [[binary]] data (therefore the binary tree, unlike the list and the hash, is a ''homogeneous'' data structure).&lt;br /&gt;
&lt;br /&gt;
==Applications==&lt;br /&gt;
Binary trees are traditionally used in the implementation of [Huffman encoding]]. They are also used in the [[sorting]] algorithms [[heapsort]] and [[mergesort]]. Certain complex algorithms, such as [[MapReduce]], also make heavy use of binary trees. Finally, the binary tree can be used to represent certain dynamic processes, such as the distribution pattern of a file in a [[peer-to-peer]] network or the [[genealology|genealological]] history of a person who is the product of a long line of two-parent families (for example, [[Mary]], but not [[Jesus]]).&lt;br /&gt;
&lt;br /&gt;
[[Category:Data structures]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=C%2B%2B_programming_language&amp;diff=478366</id>
		<title>C++ programming language</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=C%2B%2B_programming_language&amp;diff=478366"/>
		<updated>2008-06-20T03:49:01Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: Redirecting to C++&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#REDIRECT [[C++]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Computer_program&amp;diff=478363</id>
		<title>Computer program</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Computer_program&amp;diff=478363"/>
		<updated>2008-06-20T03:48:02Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: /* See Also */ fomatting&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;A '''computer program''' is a set of instructions for a [[machine]] to follow, usually to perform a task for humans.  &lt;br /&gt;
&lt;br /&gt;
The earliest [[computer]]s were literally mechanical, and the instructions caused their gears and wheels to take various courses.&lt;br /&gt;
&lt;br /&gt;
With the invention of electronic computers, computational speed increased and the complexity of the tasks assigned them could be higher.  &lt;br /&gt;
&lt;br /&gt;
Where once a program consisted of a stack of punchcards or a roll of punched tape, modern programs are written, stored and run from various [[digital]] media, chief among them CD-ROMs and magnetic disks.  Programs are now usually called &amp;quot;software,&amp;quot; as distinct from the machines that run them, the &amp;quot;hardware&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
Computer programs are broadly broken down by the functional level they work at:&lt;br /&gt;
&lt;br /&gt;
*[[Bootstrap]]ping programs, which operate on power up, and ready the machine for further instructions.&lt;br /&gt;
*[[Operating system]]s, which create a platform on which applications can be run, and manage the interface with data reading devices and peripherals such as printers, video monitors, etc.&lt;br /&gt;
*Applications, which are programs that accomplish specific tasks, such as [[spreadsheet]]s, [[word processor]]s, [[CAD]] programs, web browsers, etc.&lt;br /&gt;
&lt;br /&gt;
== Legal definition ==&lt;br /&gt;
&lt;br /&gt;
A &amp;quot;computer program&amp;quot; is a set of statements or instructions to be used directly or indirectly in a computer in order to bring about a certain result.&amp;lt;ref&amp;gt;The [[Copyright Act]], [[17 U.S.C. § 101]].&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references/&amp;gt; &lt;br /&gt;
[[Category:Law]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Algorithm]]&lt;br /&gt;
&lt;br /&gt;
[[category:technology]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Category:Data_Structures&amp;diff=478361</id>
		<title>Category:Data Structures</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Category:Data_Structures&amp;diff=478361"/>
		<updated>2008-06-20T03:46:57Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: oops, category Computers&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This category is about [[data structure]]s.&lt;br /&gt;
&lt;br /&gt;
[[Category:Computers]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Category:Data_Structures&amp;diff=478360</id>
		<title>Category:Data Structures</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Category:Data_Structures&amp;diff=478360"/>
		<updated>2008-06-20T03:46:38Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: category Computer science&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This category is about [[data structure]]s.&lt;br /&gt;
&lt;br /&gt;
[[Category:Computer science]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Disease_vector&amp;diff=478351</id>
		<title>Disease vector</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Disease_vector&amp;diff=478351"/>
		<updated>2008-06-20T03:41:26Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: wikify C++ programming language&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;A '''disease vector''' is an insect, animal or other organism which spreads disease indirectly. It  is not the the thing which ''causes'' the disease, but is a &amp;quot;carrier&amp;quot;. Mosquitoes carry a [[parasite]] which causes [[malaria]]. Dogs can carry a germ which cause [[rabies]]. &lt;br /&gt;
&lt;br /&gt;
In [[genetics]], a '''vector''' is an agent, such as a virus or a small piece of [[DNA]] called a [[plasmid]], that carries a modified or foreign gene. When used in gene therapy, a vector delivers the desired gene to a target cell.&lt;br /&gt;
----&lt;br /&gt;
In [[mathematics]], a '''vector''' is a quantity with magnitude and direction. For example, an airplane has [[speed]] and a compass heading (e.g., 600 MPH, headed North).&lt;br /&gt;
&lt;br /&gt;
In [[physics]], [[velocity]] is often considered a vector quantity while speed by itself is a ''scalar'' quantity. &lt;br /&gt;
&lt;br /&gt;
Vectors in math and physics are typically graphed as arrows pointing in the direction of a quantity such as velocity. The length of the arrow shows its magnitude. This makes it easy to add vector quantities (you line up the tail of one arrow with the point of the other). &lt;br /&gt;
----&lt;br /&gt;
In [[computer]] science, '''vector''' has two meanings: that of mathematics (as described above), and as a synonym of [[array]].  The [[C++]] [[programming language]] [[Standard Template Library]] uses the term in the second sense.  The term is used in both senses in the domain of 3D graphics programming.&lt;br /&gt;
&lt;br /&gt;
In computer hardware, '''vector''' indicates an [[array]] of numeric values stored in memory.  For instance, a '''vector processor''' is a processor which specializes in performing operations on these arrays of numbers.&lt;br /&gt;
&lt;br /&gt;
== Sources ==&lt;br /&gt;
http://www.genome.gov/glossary.cfm?key=vector&lt;br /&gt;
&lt;br /&gt;
[[Category:Genetics]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Array&amp;diff=478350</id>
		<title>Array</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Array&amp;diff=478350"/>
		<updated>2008-06-20T03:40:21Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: add category&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[computer]] science, an '''array''' is a data structure which consists of a collection of homogenous data accessed via an '''index'''.  The index is usually a scalar value, such as an [[integer]].  The index specifies one of the '''elements''', or values, within the array.  For instance, in the [[C++ programming language]], the nth element of an array named '''array''' would be accessed via the following source code:&lt;br /&gt;
&lt;br /&gt;
array[ n ]&lt;br /&gt;
&lt;br /&gt;
Arrays may be single-dimensional, or mutli-dimensional (aka poly-dimensional).  A 2-dimensional array with data consisting of numbers can be thought of as a form of mathematical '''Matrix'''.  Although implementations vary, a multi-dimensional array can be conceptualized as an array of other arrays.  For instance, a 3-dimensional array could be accessed as&lt;br /&gt;
&lt;br /&gt;
array[ x ][ y ][ z ]&lt;br /&gt;
&lt;br /&gt;
or (in a short-hand version) as&lt;br /&gt;
&lt;br /&gt;
array[ x, y, z ]&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
'''Array''' may also refer to a collection of hardware components, such as a '''Disk array''', or as a synonym to [[vector]].&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
*[http://library.thinkquest.org/C0111571/manual.php?tid=22]&lt;br /&gt;
*[http://www.homeandlearn.co.uk/NET/nets6p1.html]&lt;br /&gt;
&lt;br /&gt;
[[Category:Computers]]&lt;br /&gt;
[[Category:Data structures]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Category:Data_Structures&amp;diff=478349</id>
		<title>Category:Data Structures</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Category:Data_Structures&amp;diff=478349"/>
		<updated>2008-06-20T03:39:58Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: New page: This category is about data structures.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This category is about [[data structure]]s.&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Linked_list&amp;diff=478333</id>
		<title>Linked list</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Linked_list&amp;diff=478333"/>
		<updated>2008-06-20T03:14:35Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: fix indentation&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[computer science]], the invented term '''linked list''' refers to a linear [[data structure]] that is composed of similar elements, all of which are typically related in some way; hence the term ''linked'' list. Traditional linked lists, in which the elements are all linked in some way, should be distinguished from [[Lisp]]'s non-linked &amp;quot;lists&amp;quot;, which can contain heterogeneous data.&lt;br /&gt;
&lt;br /&gt;
In [[The Greatest Commandment|imperative]] [[programming language]]s, it is common to keep data in [[record]]s, thus:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;&lt;br /&gt;
 record Employee&lt;br /&gt;
    string[255] name;&lt;br /&gt;
    integer age;&lt;br /&gt;
 endrecord&lt;br /&gt;
&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The programmer can make a collection of records by adding a [[pointer]] field to each record, thus:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;&lt;br /&gt;
 record EmployeeL&lt;br /&gt;
    string[255] name;&lt;br /&gt;
    integer age;&lt;br /&gt;
    EmployeeL ^l;  (* &amp;quot;l&amp;quot; for &amp;quot;link&amp;quot; *)&lt;br /&gt;
 endrecord&lt;br /&gt;
&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Such a record collection is the canonical example of a linked list. In this example, since all of the records are singles, we term it a '''singly linked list'''. We can make the list more robust by adding a &amp;quot;Prev&amp;quot; field, pointing to the element before the current one, thus:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;&lt;br /&gt;
 record EmployeeLP&lt;br /&gt;
    string[255] name;&lt;br /&gt;
    integer age;&lt;br /&gt;
    EmployeeL ^l;  (* &amp;quot;l&amp;quot; for &amp;quot;link&amp;quot; *)&lt;br /&gt;
    EmployeeL ^p;  (* &amp;quot;p&amp;quot; for &amp;quot;prevlink&amp;quot; *)&lt;br /&gt;
 endrecord&lt;br /&gt;
&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This collection of L/P records is a '''doubly linked list'''.&lt;br /&gt;
&lt;br /&gt;
==Applications==&lt;br /&gt;
Linked lists are applicable in several ways. The first, most obvious application is data storage. For example, whether you have a large amount of decoded [[DNA|genetic material]], or merely a set of [[dentist|dental]] [[X-ray]]s, you will eventually need to store that data in a [[computer]], and one possible way of doing that is to put it in a linked list.&lt;br /&gt;
&lt;br /&gt;
A second, less obvious application is to the construction of fast [[sorting]] [[algorithm]]s. Suppose you have a set of homogeneous records in memory, and need to put them in order. The problem can be restated as &amp;quot;Produce a [[total ordering]] over this set of records.&amp;quot; Since each pair of elements in a non-cyclic linked list has exactly one predecessor and one successor, all you need to do to produce a total order over the set is to assign its members into a linked list, which can be done in [[line]]ar time (O(n)). This is one of the fastest sorting algorithms known today, outstripped only by the [[hash table]] approach.&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Data structure]]&lt;br /&gt;
*[[Array]]&lt;br /&gt;
*[[List]]&lt;br /&gt;
*[[Binary tree]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Data structures]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Linked_list&amp;diff=478332</id>
		<title>Linked list</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Linked_list&amp;diff=478332"/>
		<updated>2008-06-20T03:13:44Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: New page: In computer science, the invented term '''linked list''' refers to a linear data structure that is composed of similar elements, all of which are typically related in some way; hen...&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;In [[computer science]], the invented term '''linked list''' refers to a linear [[data structure]] that is composed of similar elements, all of which are typically related in some way; hence the term ''linked'' list. Traditional linked lists, in which the elements are all linked in some way, should be distinguished from [[Lisp]]'s non-linked &amp;quot;lists&amp;quot;, which can contain heterogeneous data.&lt;br /&gt;
&lt;br /&gt;
In [[The Greatest Commandment|imperative]] [[programming language]]s, it is common to keep data in [[record]]s, thus:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;&lt;br /&gt;
record Employee&lt;br /&gt;
    string[255] name;&lt;br /&gt;
    integer age;&lt;br /&gt;
endrecord&lt;br /&gt;
&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The programmer can make a collection of records by adding a [[pointer]] field to each record, thus:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;&lt;br /&gt;
record EmployeeL&lt;br /&gt;
    string[255] name;&lt;br /&gt;
    integer age;&lt;br /&gt;
    EmployeeL ^l;  (* &amp;quot;l&amp;quot; for &amp;quot;link&amp;quot; *)&lt;br /&gt;
endrecord&lt;br /&gt;
&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Such a record collection is the canonical example of a linked list. In this example, since all of the records are singles, we term it a '''singly linked list'''. We can make the list more robust by adding a &amp;quot;Prev&amp;quot; field, pointing to the element before the current one, thus:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;&lt;br /&gt;
record EmployeeLP&lt;br /&gt;
    string[255] name;&lt;br /&gt;
    integer age;&lt;br /&gt;
    EmployeeL ^l;&lt;br /&gt;
    EmployeeL ^p;&lt;br /&gt;
endrecord&lt;br /&gt;
&amp;lt;/code&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This collection of L/P records is a '''doubly linked list'''.&lt;br /&gt;
&lt;br /&gt;
==Applications==&lt;br /&gt;
Linked lists are applicable in several ways. The first, most obvious application is data storage. For example, whether you have a large amount of decoded [[DNA|genetic material]], or merely a set of [[dentist|dental]] [[X-ray]]s, you will eventually need to store that data in a [[computer]], and one possible way of doing that is to put it in a linked list.&lt;br /&gt;
&lt;br /&gt;
A second, less obvious application is to the construction of fast [[sorting]] [[algorithm]]s. Suppose you have a set of homogeneous records in memory, and need to put them in order. The problem can be restated as &amp;quot;Produce a [[total ordering]] over this set of records.&amp;quot; Since each pair of elements in a non-cyclic linked list has exactly one predecessor and one successor, all you need to do to produce a total order over the set is to assign its members into a linked list, which can be done in [[line]]ar time (O(n)). This is one of the fastest sorting algorithms known today, outstripped only by the [[hash table]] approach.&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Data structure]]&lt;br /&gt;
*[[Array]]&lt;br /&gt;
*[[List]]&lt;br /&gt;
*[[Binary tree]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Data structures]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Zero-knowledge&amp;diff=478117</id>
		<title>Zero-knowledge</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Zero-knowledge&amp;diff=478117"/>
		<updated>2008-06-19T21:29:43Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: Redirecting to Zero-knowledge proof&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#REDIRECT [[Zero-knowledge proof]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=ZKP&amp;diff=478116</id>
		<title>ZKP</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=ZKP&amp;diff=478116"/>
		<updated>2008-06-19T21:29:20Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: Redirecting to Zero-knowledge proof&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;#REDIRECT [[Zero-knowledge proof]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Zero-knowledge_proof&amp;diff=478112</id>
		<title>Zero-knowledge proof</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Zero-knowledge_proof&amp;diff=478112"/>
		<updated>2008-06-19T21:28:55Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: New page: A '''zero-knowledge proof''' ('''ZKP''') is a proof of a conjecture which does not rely on the verifier's having any knowledge whether the conjecture is true or false. The concept ...&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;A '''zero-knowledge proof''' ('''ZKP''') is a [[proof]] of a conjecture which does not rely on the verifier's having any [[knowledge]] whether the conjecture is true or false. The concept of zero-knowledge proof is typically invoked in the field of [[cryptography]], although zero-knowledge proofs have applications in other arenas as well.&lt;br /&gt;
&lt;br /&gt;
To construct a zero-knowledge proof, one must postulate the existence of two [[party|parties]], the Prover (traditionally called &amp;quot;Pat&amp;quot;) and the Verifier (traditionally called &amp;quot;Victor&amp;quot;). The Prover's job is to convince the Verifier of the truth of his argument, while having zero knowledge of the field. A series of steps are postulated, at the end of which Victor is convinced (to within 1/''f'', thus accounting for the possibility of [[noise]] in the data) that Pat indeed believes the given conjecture to be [[true]].&lt;br /&gt;
&lt;br /&gt;
==Example: ZKP of the Three-Color Theorem==&lt;br /&gt;
Let the conjecture in this case be, &amp;quot;All 3-[[regular graph|regular]] [[planar graph]]s ''G'' can be colored using only 3 colors.&amp;quot; Pat believes this conjecture to be true. Victor does not know whether it is true or false. Therefore, a zero-knowledge proof from Pat to Victor is possible. Here is how we construct it:&lt;br /&gt;
&lt;br /&gt;
# Pat draws a graph ''G'' satisfying the requirements above.&lt;br /&gt;
# Pat shows the graph to Victor, so that Victor is convinced that it is both 3-regular and planar.&lt;br /&gt;
# Victor chooses a planar subgraph ''H'' of ''G'', and [[challenge]]s Pat to color that subgraph using only three colors.&lt;br /&gt;
# Pat secretly 3-colors ''H''.&lt;br /&gt;
# Victor chooses two vertices ''v1'', ''v2'' in ''H'' and asks Pat to reveal their colors. Pat tells Victor that (for example) ''v1'' is red and ''v2'' is green. If Pat had not actually 3-colored the graph, Pat would be unable some fraction of the time to name the colors of ''v1'' and ''v2''; therefore, Victor must necessarily accept that Pat ''did'' in fact three-color the given graph, and therefore all planar 3-regular graphs are 3-colorable. Pat has proven the conjecture to Victor's satisfaction, but (in accordance with the rules of ZKP) Victor is still in the dark as to how she did it.&lt;br /&gt;
&lt;br /&gt;
[[Category:Cryptography]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Cryptography&amp;diff=476367</id>
		<title>Cryptography</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Cryptography&amp;diff=476367"/>
		<updated>2008-06-17T16:24:00Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: /* External Links */ category&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Cryptography''' is the writing of secrets. The word 'cryptography' comes from the Greek 'cryptos', secret, and 'graphos', writing.&lt;br /&gt;
&lt;br /&gt;
All of cryptography (debatable since the dawn of quantum cryptography) can be described as one of two methods.&lt;br /&gt;
&lt;br /&gt;
== Codes ==&lt;br /&gt;
&lt;br /&gt;
Codes are, in their simplest terms, replacing words and phrases in a message with other words and phrases whose meaning is known to the recipient. For example:&lt;br /&gt;
&lt;br /&gt;
Take the phrase: &amp;quot;The bombers require a fighter escort at Newcastle, 2300 hours&amp;quot;&lt;br /&gt;
&lt;br /&gt;
There are many ways to encode this. Some appropriate rules must be created and shared with the recipient. Because to anyone who intercepts the message, something that sounds like a code could arouse their suspicions, causing the message to be &amp;quot;cracked&amp;quot; (decoded) or to be destroyed or otherwise delayed. Therefore it is wise to create a code that produces innocent sounding messages:&lt;br /&gt;
&lt;br /&gt;
:11.00pm, Newcastle: Mother birds look for duckling flock&lt;br /&gt;
&lt;br /&gt;
The above message simply substitutes &amp;quot;mother bird&amp;quot; for bomber, &amp;quot;duckling&amp;quot; for fighter and &amp;quot;flock&amp;quot; for escort. The message could now be transmitted, and if intercepted could easily be mistaken for a diary entry of a birdwatcher.&lt;br /&gt;
&lt;br /&gt;
Codes also include methods of hiding a message within a seemingly normal message (used frequently by POW's). A famous example of this is the [http://www.flickr.com/photos/8443340@N06/sets/72157600242068267/ September 1992 edition of Autocar]&lt;br /&gt;
&lt;br /&gt;
James May amused himself while compiling a top 100 list of the cars that year arranged the capitalised letters across many pages to spell out &amp;quot;So, you think it's really good yeah? You should try making the bloody thing up. It's a real pain in the arse&amp;quot; (punctuation and spaces added for clarity).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Of course there is a very obvious problem with codes, find out the rules governing what is substituted for what and an intercepted message can be read easily. And in order to produce any useful codesets, large &amp;quot;dictionaries&amp;quot; were required by both sender and receiver.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Ciphers ==&lt;br /&gt;
&lt;br /&gt;
Cipher: a method of changing the plaintext (normal written word) into ciphertext and back again.&lt;br /&gt;
&lt;br /&gt;
A cipher can be as simple, or as complex, as the user requires. For the most part (see RSA later for exception) ciphers require both a rule and a key. The key is used by the recipient of the message to turn the ciphertext back into plaintext using the reverse of the rule.&lt;br /&gt;
&lt;br /&gt;
'''Some examples of ciphers:'''&lt;br /&gt;
 &lt;br /&gt;
:Plaintext: &amp;quot;HELLO WORLD&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Even without substituting letters as commonly done in ciphers, by reflecting the message, words, or blocks of letters it is possible to make it difficult to decrypt the message without knowing the rule, even for computers. Note that processes like this are not commutative.&lt;br /&gt;
&lt;br /&gt;
:Word Reversal: &amp;quot;OLLEH DLROW&amp;quot;&lt;br /&gt;
&lt;br /&gt;
:Message Reversal: &amp;quot;DLROW OLLEH&amp;quot;&lt;br /&gt;
&lt;br /&gt;
:3-Letter block reversal: &amp;quot;LEH OLROWDL&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Using a cipher historically attributed to Julius Caeser, wherein the letters are moved along in the alphabet by the number of letters represented by the key (note Z+1 = A). This example uses a key of 1&lt;br /&gt;
&lt;br /&gt;
:Caeser: &amp;quot;IFMMP XPSME&amp;quot;&lt;br /&gt;
&lt;br /&gt;
However this cipher can be easily broken by modern computers as it uses a 1:1 alphabet substitution. It can be made more secure by encrypting each letter with a different key. In this example the letter key will be its position in the text.&lt;br /&gt;
&lt;br /&gt;
:Letter Key Caeser: &amp;quot;IGOPT DWAVO&amp;quot;&lt;br /&gt;
&lt;br /&gt;
Note that although O appears twice in the ciphertext, the first time it represents an L, the second time a D, making this a much harder cipher to break.&lt;br /&gt;
&lt;br /&gt;
== Historical Uses Of Cryptography ==&lt;br /&gt;
&lt;br /&gt;
Generally speaking, cryptography has been the sole domain of governments. All governments of the world have a branch dedicated to the interception and decryption of encoded information. In America, this is the CIA; in Britain, it's MI5; in Vatican City it's Iscariot (Vatican Section XIII).&lt;br /&gt;
&lt;br /&gt;
Cryptography has played a large part in many wars. In the [[World War I|First World War]], [[Mata Hari]] was responsible for carrying messages back and forth for the [[Germany|German]] government, causing the deaths of thousands of [[France|French]] soldiers.&amp;lt;ref&amp;gt;http://www.firstworldwar.com/bio/matahari.htm&amp;lt;/ref&amp;gt; In the [[World War II|Second World War]], [[United Kingdom|British]] soldiers captured the crew and The [[Enigma]] Engine of German U-boat U-571, leading to the decryption of Nazi communications and the end of the war. &lt;br /&gt;
&lt;br /&gt;
Other examples of the importance of cryptography include Ethel and Julius Rosenberg. &lt;br /&gt;
&lt;br /&gt;
[[Ethel Rosenberg]] and [[Julius Rosenberg]] sold US atomic secrets to the USSR at the height of the cold war. They were convicted and executed in the electric chair at Sing Sing prison.&lt;br /&gt;
&lt;br /&gt;
== Modern Uses Of Cryptography ==&lt;br /&gt;
&lt;br /&gt;
Currently the most common form of cryptography is public key encryption. This relies on the fact that it takes significantly (order 10&amp;lt;sup&amp;gt;8&amp;lt;/sup&amp;gt; times) longer to find two prime factors of 1000 or more digit numbers than it does to multiply the numbers together to create the 1000 digit number in the first place.&lt;br /&gt;
&lt;br /&gt;
In this system there are two keys, the first is the &amp;quot;private key&amp;quot;, which only the '''recipient''' knows. The second is the &amp;quot;public key&amp;quot; which can be sent freely to anyone, allowing them to encrypt messages with it such that only the owner of the private key can decrypt them. These public keys are calculated from the private keys, but as they are often over 1000 digits long and would take many decades to calculate the private key from them (RSA, the most commonly used encryption protocol uses 2048 digit numbers which would take over 4000 years to crack with a desktop computer).&lt;br /&gt;
&lt;br /&gt;
This technology is put to use mostly on the internet. It allows sensitive data, eg. credit card numbers, phone numbers, social security numbers etc. to be transmitted without fear of interception and use by malevolent third parties. All internet banking and shopping uses this technology (whenever you see &amp;quot;https://&amp;quot; instead of &amp;quot;http://&amp;quot; in the address bar a public key algorithm is in use, most likely RSA&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==External Links==&lt;br /&gt;
[http://www.pbs.org/wgbh/nova/sciencenow/3411/03.html Kryptos]&lt;br /&gt;
&lt;br /&gt;
[[category:information technology]]&lt;br /&gt;
[[Category:Cryptography]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Category:Cryptography&amp;diff=476365</id>
		<title>Category:Cryptography</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Category:Cryptography&amp;diff=476365"/>
		<updated>2008-06-17T16:23:34Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: New page: This category is about Cryptography.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This category is about [[Cryptography]].&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Public-key_encryption&amp;diff=476364</id>
		<title>Public-key encryption</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Public-key_encryption&amp;diff=476364"/>
		<updated>2008-06-17T16:23:16Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: /* References */ category&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Public-key encryption''' is a kind of [[encryption]] in which both the message and the key are public. This differs from the traditional (so-called &amp;quot;private-key&amp;quot;) encryption, in which the key is kept secret from the intended recipient. Public-key encryption is a form of ''[[symmetry|asymmetric]] encryption'', meaning that it is much easier to encrypt a message than to decrypt it, at least without knowing the encryption key; this is the reason that the key has to be made public.&lt;br /&gt;
&lt;br /&gt;
Well-known public-key encryption algorithms include '''Diffie-Hellman''',&lt;br /&gt;
'''El-Gamal''', and '''RSA'''. These algorithms all work on the same basic&lt;br /&gt;
model, which is that of a [[cyclic group]] ''G'' distributing over an operation ''o'' which may or may not be [[commutative]]. In Diffie-Hellman and El-Gamal, the basic operation is the [[discrete logarithm]]; in RSA it is [[factoring]].&lt;br /&gt;
&lt;br /&gt;
==Diffie-Hellman encryption==&lt;br /&gt;
Diffie-Hellman encryption, also known as &amp;quot;Diffie-Hellman key exchange&amp;quot;, relies on the [[fundamentalism|fundamental]] [[hardness|difficulty]] of computing the discrete logarithm ''g&amp;lt;sup&amp;gt;a&amp;lt;/sup&amp;gt;'' of a number ''x'' in the [[group]] ''G''. It was invented by [[Whitfield Diffie]] and [[Lillian Hellman]] in 1976. The protocol proceeds in three steps:&lt;br /&gt;
&lt;br /&gt;
# Alice and Bob secretly decide on a large prime number ''p'' and a group ''G'' in which to work, with [[generator]] ''g''.&lt;br /&gt;
# Alice chooses a secret integer ''a'', for example 6. She sends ''a&amp;lt;sup&amp;gt;g&amp;lt;/sup&amp;gt;'' mod ''p'' to Bob.&lt;br /&gt;
# Bob chooses a different integer ''b'', for example 7, and sends ''b&amp;lt;sup&amp;gt;g&amp;lt;/sup&amp;gt;'' mod ''p'' to Alice.&lt;br /&gt;
# Alice computes ''(a&amp;lt;sup&amp;gt;g&amp;lt;/sup&amp;gt;)&amp;lt;sup&amp;gt;b&amp;lt;/sup&amp;gt;'', while Bob computes ''(b&amp;lt;sup&amp;gt;g&amp;lt;/sup&amp;gt;)&amp;lt;sup&amp;gt;a&amp;lt;/sup&amp;gt;''. Whoever finishes first sends their result to the other person.&lt;br /&gt;
&lt;br /&gt;
At this point both parties (Alice and Bob) have the same (secret) information, and can use the shared secret as a key for sending [[encryption|encrypted]] messages back and forth by the usual methods.&lt;br /&gt;
&lt;br /&gt;
==El-Gamal encryption==&lt;br /&gt;
El-Gamal encryption was invented by the [[Egyptian]] mathematician [[Taher El-Gamal]] in 1984, shortly after the assassination of [[Anwar Sadat]]. Like the Diffie-Hellman protocol, El-Gamal encryption relies on the discrete logarithm function, which can be used to unobtrusively compute the inverse of the [[exponentiation]] operation within a cyclic group.&lt;br /&gt;
&lt;br /&gt;
Unlike classical encryption schemes such as ''ENIGMA'' (see [[Encryption]]), El-Gamal's cryptosystem actually expands the plaintext by a factor of&amp;amp;nbsp;2, in order to make the message harder to [[decrypt]]. (Because information density is exponential, with ''two'' times as many bits in the ciphertext an attacker would have to work 2&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;&amp;amp;nbsp;=&amp;amp;nbsp;''four'' times as hard to decode the message, assuming he did not already possess the key.) However, the usual implementation simply sets these extra bits to zero by default, rendering the security gain infinitesimal at best.&lt;br /&gt;
&lt;br /&gt;
The El-Gamal encryption algorithm was added to the [[C programming language]] in 1999, as the math function &amp;lt;tt&amp;gt;lgammal()&amp;lt;/tt&amp;gt; [sic]. (Only implementations conforming to TR1 provide this function.)&lt;br /&gt;
&lt;br /&gt;
==RSA encryption==&lt;br /&gt;
&amp;quot;RSA&amp;quot; stands for &amp;quot;[[Ron Rivest|Rivest]]&amp;amp;ndash;[[Shamir]]&amp;amp;ndash;[[Adelson]]&amp;quot;,&amp;lt;ref&amp;gt;[http://www.all-acronyms.com/?t=rsa&amp;amp;d=rivest%2Dshamir%2Dadelson ''AllAcronyms.com'']&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;[http://www.cogs.susx.ac.uk/courses/mct/Handouts/notes-6.pdf Course notes] from G6016 &amp;quot;Networks&amp;quot;, at the [[University of Sussex]]&amp;lt;/ref&amp;gt; the three [[MIT]] researchers who discovered the RSA algorithm in 1977, seven years before Taher El-Gamal developed his competing system.&lt;br /&gt;
&lt;br /&gt;
RSA, unlike the previous two systems, is based on the fundamental difficulty of [[factoring]] large [[prime]]s. For example, although it is easy to factor 6=2&amp;amp;times;3, it is exponentially more difficult to factor 6000000=2000&amp;amp;times;3000. (Of course, the digital computers that implement RSA encryption use numbers that are bigger still; a &amp;quot;strong&amp;quot; key used by an organization such as the [[NSA]] might have 6000000=2000&amp;amp;times;3000 ''digits!'')&lt;br /&gt;
&lt;br /&gt;
The RSA algorithm was put to the test in 1991, when RSA Laboratories released the &amp;quot;RSA Factoring Challenge&amp;quot;. The challenge consisted of a list of progressively larger numbers, which, when fully decrypted, read &amp;quot;The magic words are [[squeamish ossifrage]].&amp;quot;&amp;lt;ref&amp;gt;[http://citeseer.ist.psu.edu/1393.html &amp;quot;The Magic Words Are Squeamish Ossifrage&amp;quot;], by Atkins, Graff, Lenstra, and Leyl&amp;lt;/ref&amp;gt; Although the challenge was withdrawn in 2007, the RSA algorithm is still widely considered acceptable for business purposes.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Cryptography]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Public-key_encryption&amp;diff=476363</id>
		<title>Public-key encryption</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Public-key_encryption&amp;diff=476363"/>
		<updated>2008-06-17T16:22:11Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: New page: '''Public-key encryption''' is a kind of encryption in which both the message and the key are public. This differs from the traditional (so-called &amp;quot;private-key&amp;quot;) encryption, in which t...&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Public-key encryption''' is a kind of [[encryption]] in which both the message and the key are public. This differs from the traditional (so-called &amp;quot;private-key&amp;quot;) encryption, in which the key is kept secret from the intended recipient. Public-key encryption is a form of ''[[symmetry|asymmetric]] encryption'', meaning that it is much easier to encrypt a message than to decrypt it, at least without knowing the encryption key; this is the reason that the key has to be made public.&lt;br /&gt;
&lt;br /&gt;
Well-known public-key encryption algorithms include '''Diffie-Hellman''',&lt;br /&gt;
'''El-Gamal''', and '''RSA'''. These algorithms all work on the same basic&lt;br /&gt;
model, which is that of a [[cyclic group]] ''G'' distributing over an operation ''o'' which may or may not be [[commutative]]. In Diffie-Hellman and El-Gamal, the basic operation is the [[discrete logarithm]]; in RSA it is [[factoring]].&lt;br /&gt;
&lt;br /&gt;
==Diffie-Hellman encryption==&lt;br /&gt;
Diffie-Hellman encryption, also known as &amp;quot;Diffie-Hellman key exchange&amp;quot;, relies on the [[fundamentalism|fundamental]] [[hardness|difficulty]] of computing the discrete logarithm ''g&amp;lt;sup&amp;gt;a&amp;lt;/sup&amp;gt;'' of a number ''x'' in the [[group]] ''G''. It was invented by [[Whitfield Diffie]] and [[Lillian Hellman]] in 1976. The protocol proceeds in three steps:&lt;br /&gt;
&lt;br /&gt;
# Alice and Bob secretly decide on a large prime number ''p'' and a group ''G'' in which to work, with [[generator]] ''g''.&lt;br /&gt;
# Alice chooses a secret integer ''a'', for example 6. She sends ''a&amp;lt;sup&amp;gt;g&amp;lt;/sup&amp;gt;'' mod ''p'' to Bob.&lt;br /&gt;
# Bob chooses a different integer ''b'', for example 7, and sends ''b&amp;lt;sup&amp;gt;g&amp;lt;/sup&amp;gt;'' mod ''p'' to Alice.&lt;br /&gt;
# Alice computes ''(a&amp;lt;sup&amp;gt;g&amp;lt;/sup&amp;gt;)&amp;lt;sup&amp;gt;b&amp;lt;/sup&amp;gt;'', while Bob computes ''(b&amp;lt;sup&amp;gt;g&amp;lt;/sup&amp;gt;)&amp;lt;sup&amp;gt;a&amp;lt;/sup&amp;gt;''. Whoever finishes first sends their result to the other person.&lt;br /&gt;
&lt;br /&gt;
At this point both parties (Alice and Bob) have the same (secret) information, and can use the shared secret as a key for sending [[encryption|encrypted]] messages back and forth by the usual methods.&lt;br /&gt;
&lt;br /&gt;
==El-Gamal encryption==&lt;br /&gt;
El-Gamal encryption was invented by the [[Egyptian]] mathematician [[Taher El-Gamal]] in 1984, shortly after the assassination of [[Anwar Sadat]]. Like the Diffie-Hellman protocol, El-Gamal encryption relies on the discrete logarithm function, which can be used to unobtrusively compute the inverse of the [[exponentiation]] operation within a cyclic group.&lt;br /&gt;
&lt;br /&gt;
Unlike classical encryption schemes such as ''ENIGMA'' (see [[Encryption]]), El-Gamal's cryptosystem actually expands the plaintext by a factor of&amp;amp;nbsp;2, in order to make the message harder to [[decrypt]]. (Because information density is exponential, with ''two'' times as many bits in the ciphertext an attacker would have to work 2&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;&amp;amp;nbsp;=&amp;amp;nbsp;''four'' times as hard to decode the message, assuming he did not already possess the key.) However, the usual implementation simply sets these extra bits to zero by default, rendering the security gain infinitesimal at best.&lt;br /&gt;
&lt;br /&gt;
The El-Gamal encryption algorithm was added to the [[C programming language]] in 1999, as the math function &amp;lt;tt&amp;gt;lgammal()&amp;lt;/tt&amp;gt; [sic]. (Only implementations conforming to TR1 provide this function.)&lt;br /&gt;
&lt;br /&gt;
==RSA encryption==&lt;br /&gt;
&amp;quot;RSA&amp;quot; stands for &amp;quot;[[Ron Rivest|Rivest]]&amp;amp;ndash;[[Shamir]]&amp;amp;ndash;[[Adelson]]&amp;quot;,&amp;lt;ref&amp;gt;[http://www.all-acronyms.com/?t=rsa&amp;amp;d=rivest%2Dshamir%2Dadelson ''AllAcronyms.com'']&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;[http://www.cogs.susx.ac.uk/courses/mct/Handouts/notes-6.pdf Course notes] from G6016 &amp;quot;Networks&amp;quot;, at the [[University of Sussex]]&amp;lt;/ref&amp;gt; the three [[MIT]] researchers who discovered the RSA algorithm in 1977, seven years before Taher El-Gamal developed his competing system.&lt;br /&gt;
&lt;br /&gt;
RSA, unlike the previous two systems, is based on the fundamental difficulty of [[factoring]] large [[prime]]s. For example, although it is easy to factor 6=2&amp;amp;times;3, it is exponentially more difficult to factor 6000000=2000&amp;amp;times;3000. (Of course, the digital computers that implement RSA encryption use numbers that are bigger still; a &amp;quot;strong&amp;quot; key used by an organization such as the [[NSA]] might have 6000000=2000&amp;amp;times;3000 ''digits!'')&lt;br /&gt;
&lt;br /&gt;
The RSA algorithm was put to the test in 1991, when RSA Laboratories released the &amp;quot;RSA Factoring Challenge&amp;quot;. The challenge consisted of a list of progressively larger numbers, which, when fully decrypted, read &amp;quot;The magic words are [[squeamish ossifrage]].&amp;quot;&amp;lt;ref&amp;gt;[http://citeseer.ist.psu.edu/1393.html &amp;quot;The Magic Words Are Squeamish Ossifrage&amp;quot;], by Atkins, Graff, Lenstra, and Leyl&amp;lt;/ref&amp;gt; Although the challenge was withdrawn in 2007, the RSA algorithm is still widely considered acceptable for business purposes.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Encryption&amp;diff=476361</id>
		<title>Encryption</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Encryption&amp;diff=476361"/>
		<updated>2008-06-17T16:12:17Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: typos&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Encryption''' is the process of changing [[data]] into a secret [[code]].&amp;lt;ref&amp;gt;http://www.webopedia.com/TERM/E/encryption.html&amp;lt;/ref&amp;gt; It is usually carried out today by [[computer]]s, although in the past it was traditionally carried out by analog machines or by specialists known as [[cryptographer]]s.&lt;br /&gt;
&lt;br /&gt;
The earliest known form of encryption is that known as &amp;quot;ROT-13&amp;quot;, or the &amp;quot;[[Caesar]] cipher&amp;quot;, because its invention was once reportedly attributed to [[Julius Caesar]].&amp;lt;ref&amp;gt;Far more likely, however, is that the Caesar cipher was invented by a [[mathematician]] in Caesar's employ, and Caesar merely took the credit, much as [[Henry VIII]] took credit for the melody of &amp;quot;[[Greensleeves]]&amp;quot;, or President [[James Garfield]] claimed to have discovered a novel proof of the [[Pythagorean Theorem]].&amp;lt;/ref&amp;gt; In the Caesar cipher, each letter of the message (or &amp;quot;plaintext&amp;quot;) is shifted forward in the alphabet by 13 places; for example, &amp;quot;CIPHER&amp;quot; becomes &amp;quot;PVCURE&amp;quot;.&amp;lt;ref&amp;gt;The lack of the letters &amp;quot;J&amp;quot;, &amp;quot;Q&amp;quot;, &amp;quot;U&amp;quot;, and &amp;quot;W&amp;quot; in the [[Latin]] alphabet posed an impediment to the Caesar shift's widespread adoption, since the encoded ciphertext would actually have read &amp;quot;PVCVRE&amp;quot; and thus had four different possible decodings.&amp;lt;/ref&amp;gt; The Caesar cipher is what is called a ''[[symmetry|symmetric]] cipher'', meaning that the method of encryption is the same as the method of decryption (rotate by 13 characters), and therefore it is just as easy to decode any message as it was to encode it. For this reason, modern cryptanalysts tend to view most symmetric encryption methods as flawed.&amp;lt;ref&amp;gt;http://www.centurionsoft.com/centurionmail/wpencryption.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another popular historical encryption method was the &amp;quot;enigma machine&amp;quot; developed by [[Nazi Germany]] during [[World War II]]. The enigma machine (or ''ENIGMA'' for short) worked on the plugboard principle. It had the ability to generate many different ciphertexts for the same plaintext, which meant that Allied cryptographers could no longer rely on being able to match encoded texts with plaintexts. Prior to World War II, cryptographers had gotten used to being able to collate messages with their ciphertexts to create large &amp;quot;dictionaries&amp;quot; (for example, matching the ciphertext &amp;quot;PVCURE&amp;quot; with its plaintext &amp;quot;CIPHER&amp;quot; in the above example). These code dictionaries could then be used to launch dictionary attacks against messages whose decodings were not yet known. ''ENIGMA'' rendered this tactic hopeless. For example, while &amp;quot;PVCURE&amp;quot; might mean &amp;quot;CIPHER&amp;quot; on Monday, it might mean &amp;quot;ATTACK&amp;quot; on Tuesday.&lt;br /&gt;
&lt;br /&gt;
The Enigma cipher was eventually cracked by homosexual&amp;lt;ref&amp;gt;http://thomasj1776.multiply.com/journal/item/69?&amp;amp;item_id=69&amp;lt;/ref&amp;gt; British mathematician [[Alan Turing]], with the aid of a computer. This was the beginning of modern cryptography as a science, although few advancements were made from the end of WWII until the rise of the [[Internet]] in the 1980s.&lt;br /&gt;
&lt;br /&gt;
Today, encryption is used primarily by [[hacker]]s and other anti-government types to conceal their activities from the federal government. For example, the leftist [[GNU]] organization provides a program called &amp;quot;[[Pretty Good Privacy]]&amp;quot; (PGP) for encrypting [[e-mail]]. Several forms of &amp;quot;strong&amp;quot; encryption are considered [[munitions]] under federal law, and may not be exported to belligerent countries such as [[Iran]].&amp;lt;ref&amp;gt;[http://www.stanford.edu/dept/DoR/exp_controls/encryption1.html &amp;quot;Encryption Export Controls&amp;quot;] at ''stanford.edu''&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Public-key encryption]]&lt;br /&gt;
*[[Steganography]]&lt;br /&gt;
*[[State secret]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Cryptography]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Encryption&amp;diff=476360</id>
		<title>Encryption</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Encryption&amp;diff=476360"/>
		<updated>2008-06-17T16:11:36Z</updated>

		<summary type="html">&lt;p&gt;DrCrypto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Encryption''' is the process of changing [[data]] into a secret [[code]].&amp;lt;ref&amp;gt;http://www.webopedia.com/TERM/E/encryption.html&amp;lt;/ref&amp;gt; It is usually carried out today by [[computer]]s, although in the past it was traditionally carried out by analog machines or by specialists known as [[cryptographer]]s.&lt;br /&gt;
&lt;br /&gt;
The earliest known form of encryption is that known as &amp;quot;ROT-13&amp;quot;, or the &amp;quot;[{Caesar]] cipher&amp;quot;, because its invention was once reportedly attributed to [[Julius Caesar]].&amp;lt;ref&amp;gt;Far more likely, however, is that the Caesar cipher was invented by a [[mathematician]] in Caesar's employ, and Caesar merely took the credit, much as [[Henry VIII]] took credit for the melody of &amp;quot;[[Greensleeves]]&amp;quot;, or President [[James Garfield]] claimed to have discovered a novel proof of [[Pythagorean Theorem]].&amp;lt;/ref&amp;gt; In the Caesar cipher, each letter of the message (or &amp;quot;plaintext&amp;quot;) is shifted forward in the alphabet by 13 places; for example, &amp;quot;CIPHER&amp;quot; becomes &amp;quot;PVCURE&amp;quot;.&amp;lt;ref&amp;gt;The lack of the letters &amp;quot;J&amp;quot;, &amp;quot;Q&amp;quot;, &amp;quot;U&amp;quot;, and &amp;quot;W&amp;quot; in the [[Latin]] alphabet posed an impediment to the Caesar shift's widespread adoption, since the encoded ciphertext would actually have read &amp;quot;PVCVRE&amp;quot; and thus had four different possible decodings.&amp;lt;/ref&amp;gt; The Caesar cipher is what is called a ''[[symmetry|symmetric]] cipher'', meaning that the method of encryption is the same as the method of decryption (rotate by 13 characters), and therefore it is just as easy to decode any message as it was to encode it. For this reason, modern cryptanalysts tend to view most symmetric encryption methods as flawed.&amp;lt;ref&amp;gt;http://www.centurionsoft.com/centurionmail/wpencryption.html&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Another popular historical encryption method was the &amp;quot;enigma machine&amp;quot; developed by [[Nazi Germany]] during [[World War II]]. The enigma machine (or ''ENIGMA'' for short) worked on the plugboard principle. It had the ability to generate many different ciphertexts for the same plaintext, which meant that Allied cryptographers could no longer rely on being able to match encoded texts with plaintexts. Prior to World War II, cryptographers had gotten used to being able to collate messages with their ciphertexts to create large &amp;quot;dictionaries&amp;quot; (for example, matching the ciphertext &amp;quot;PVCURE&amp;quot; with its plaintext &amp;quot;CIPHER&amp;quot; in the above example). These code dictionaries could then be used to launch dictionary attacks against messages whose decodings were not yet known. ''ENIGMA'' rendered this tactic hopeless. For example, while &amp;quot;PVCURE&amp;quot; might mean &amp;quot;CIPHER&amp;quot; on Monday, it might mean &amp;quot;ATTACK&amp;quot; on Tuesday.&lt;br /&gt;
&lt;br /&gt;
The Enigma cipher was eventually cracked by homosexual&amp;lt;ref&amp;gt;http://thomasj1776.multiply.com/journal/item/69?&amp;amp;item_id=69&amp;lt;/ref&amp;gt; British mathematician [[Alan Turing]], with the aid of a computer. This was the beginning of modern cryptography as a science, although few advancements were made from the end of WWII until the rise of the [[Internet]] in the 1980s.&lt;br /&gt;
&lt;br /&gt;
Today, encryption is used primarily by [[hacker]]s and other anti-government types to conceal their activities from the federal government. For example, the leftist [[GNU]] organization provides a program called &amp;quot;[[Pretty Good Privacy]]&amp;quot; (PGP) for encrypting [[e-mail]]. Several forms of &amp;quot;strong&amp;quot; encryption are considered [[munitions]] under federal law, and may not be exported to belligerent countries such as [[Iran]].&amp;lt;ref&amp;gt;[http://www.stanford.edu/dept/DoR/exp_controls/encryption1.html &amp;quot;Encryption Export Controls&amp;quot;] at ''stanford.edu''&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Public-key encryption]]&lt;br /&gt;
*[[Steganography]]&lt;br /&gt;
*[[State secret]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Cryptography]]&lt;/div&gt;</summary>
		<author><name>DrCrypto</name></author>
	</entry>
</feed>