Enigma - Revision history

Heth: /* Footnotes */

2010-12-07T14:47:32Z

‎Footnotes

2010-12-05T14:42:04Z

‎Programs and files

2010-12-05T14:41:45Z

2010-12-05T09:17:45Z

‎Enigma Articles

2010-12-05T09:15:07Z

‎8 bit Enigma machine

2010-12-05T09:11:33Z

‎8 bit Enigma machine

2010-12-05T09:06:12Z

‎8 bit Enigma machine

2010-12-04T07:55:36Z

‎Number of possible keys when using three wheels

2010-12-04T07:53:17Z

‎When the wheels are known

2010-12-04T07:52:47Z

‎When the wheels are known

@@ Line 11: / Line 11: @@
 *[[Enigma/enigma8.|enigma8.c]] whild will Crypt and Decrypt plainfiles.
 *[[Enigma/enigma8crack.c|enigma8crack.c]] is a singlethreaded attempt to break a crypted file with a known Crib<ref>A Crib is a known plaintext message in the crypted message. You can Brute-force the crypted message until you get a match on the Crib</ref>
 =Footnotes=
 <references/>
 [[Category:CoE]]

@@ Line 11: / Line 11: @@
 *[[Enigma/enigma8.|enigma8.c]] whild will Crypt and Decrypt plainfiles.
 *[[Enigma/enigma8crack.c|enigma8crack.c]] is a singlethreaded attempt to break a crypted file with a known Crib<ref>A Crib is a known plaintext message in the crypted message. You can Brute-force the crypted message until you get a match on the Crib</ref>
 <references/>
 [[Category:CoE]]

@@ Line 11: / Line 11: @@
 *[[Enigma/enigma8.|enigma8.c]] whild will Crypt and Decrypt plainfiles.
 *[[Enigma/enigma8crack.c|enigma8crack.c]] is a singlethreaded attempt to break a crypted file with a known Crib<ref>A Crib is a known plaintext message in the crypted message. You can Brute-force the crypted message until you get a match on the Crib</ref>
 <references/>
 [[Category:CoE]]

@@ Line 1: / Line 1: @@
 =Enigma Articles=
 *[http://en.wikipedia.org/wiki/Enigma_machine Wikipedia article: Enigma machine]
 = 8 bit Enigma machine =

@@ Line 3: / Line 3: @@
 = 8 bit Enigma machine =
 There are three C-programs and four file in this project. All singlethreaded C programs.
 *[[Enigma/makewheel.c|makewheel.c]] which will make Random 8 bit Enigma Wheels
@@ Line 8: / Line 10: @@
 *[[Enigma/enigma8.|enigma8.c]] whild will Crypt and Decrypt plainfiles.
 *[[Enigma/enigma8crack.c|enigma8crack.c]] is a singlethreaded attempt to break a crypted file with a known Crib<ref>A Crib is a known plaintext message in the crypted message. You can Brute-force the crypted message until you get a match on the Crib</ref>
 == Number of possible keys when using three wheels==
 In the example below there is a caculation of possible keys that is

@@ Line 7: / Line 7: @@
 In the example below there is a caculation of possible keys that is
 *Three whells of 8 bit each diffently coded (fx. wheel[0]=67,wheel[1]=234 .. wheel[67]=165 .. )
-*An 8 bit Rotor-Reflector which is symmetricaly coded. (Fx. rr[0]=67 then rr[67]=0 etc. )
+*An 8 bit Rotor-Reflector which is symmetricaly coded. (Fx. rr[0]=67 then rr[67]=0, rr[87]=167 then rr[167]=87 etc. )
 *When the encryption/decryption starts each wheel can be in 1 of 256 positions. Called the notch position
 <source lang=cli>
@@ Line 124: / Line 124: @@
 00000000000000000000000000000000000000000000000000000000
 </source>
 ==When the wheels are known==
 Like during [http://en.wikipedia.org/wiki/World_War_II World War II] the [http://en.wikipedia.org/wiki/Enigma_machine Allied] get hold of the Wheels for the Enigma and only had to find the order of the Wheels and the startposiotion of each installed wheel.

@@ Line 129: / Line 129: @@
 So with the 8 bit Enigma engine with three wheels installed. There are 10 known wheels in the example below.
 <source lang=cli>
-/* Total number of wheels possible */
+<input>/* Total number of wheels possible */
 wheelstotal=10
@@ Line 139: / Line 139: @@
 /* Total number of keys, when the wheels are known */
-wheelstotal*wheelcombinations*notches
+wheelstotal*wheelcombinations*notches</input>
 120795955200
 </Source>
 [[Category:CoE]]