Crypto.Classical.Cipher.Enigma

Documentation

newtype Enigma a

Constructors

Enigma

Fields

• _enigma :: a

Instances

Monad Enigma

Defined in Crypto.Classical.Cipher.Enigma

Methods

(>>=) :: Enigma a -> (a -> Enigma b) -> Enigma b

(>>) :: Enigma a -> Enigma b -> Enigma b

return :: a -> Enigma a

fail :: String -> Enigma a

Functor Enigma

Defined in Crypto.Classical.Cipher.Enigma

Methods

fmap :: (a -> b) -> Enigma a -> Enigma b

(<$) :: a -> Enigma b -> Enigma a

Applicative Enigma

Defined in Crypto.Classical.Cipher.Enigma

Methods

pure :: a -> Enigma a

(<*>) :: Enigma (a -> b) -> Enigma a -> Enigma b

liftA2 :: (a -> b -> c) -> Enigma a -> Enigma b -> Enigma c

(*>) :: Enigma a -> Enigma b -> Enigma b

(<*) :: Enigma a -> Enigma b -> Enigma a

Cipher EnigmaKey Enigma

When a machine operator presses a key, the Rotors rotate. A circuit is then completed as they hold the key down, and a bulb is lit. Here, we make sure to rotate the Rotors before encrypting the character. NOTE: Decryption is the same as encryption.

Defined in Crypto.Classical.Cipher.Enigma

Methods

encrypt :: EnigmaKey -> ByteString -> Enigma ByteString

decrypt :: EnigmaKey -> ByteString -> Enigma ByteString

Eq a => Eq (Enigma a)

Defined in Crypto.Classical.Cipher.Enigma

Methods

(==) :: Enigma a -> Enigma a -> Bool

(/=) :: Enigma a -> Enigma a -> Bool

Show a => Show (Enigma a)

Defined in Crypto.Classical.Cipher.Enigma

Methods

showsPrec :: Int -> Enigma a -> ShowS

show :: Enigma a -> String

showList :: [Enigma a] -> ShowS

enigma :: forall a a. Lens (Enigma a) (Enigma a) a a

withInitPositions :: EnigmaKey -> EnigmaKey

Applies the initial Rotor settings as defined in the Key to the Rotors themselves. These initial rotations do not trigger the turnover of neighbouring Rotors as usual.

turn :: [Rotor] -> [Rotor]

Turn the (machine's) right-most (left-most in List) Rotor by one position. If its turnover value wraps back to 25, then turn the next Rotor as well.

rotate :: (ℤ / 26) -> Map (ℤ / 26) (ℤ / 26) -> Map (ℤ / 26) (ℤ / 26)

Rotate a Rotor by n positions. By subtracting 1 from every key and value, we perfectly simulate rotation. Example:

>>> rotate $ M.fromList [(0,2),(1,0),(2,3),(3,4),(4,1)]
M.fromList [(4,1),(0,4),(1,2),(2,3),(3,0)]