module Crypto.Classical.Test
(
cycleT
, notSelfT
, testAll
) where
import Control.Lens
import Control.Monad (void)
import Crypto.Classical.Cipher
import Crypto.Classical.Letter
import Crypto.Classical.Types
import Crypto.Classical.Util (prng)
import Data.ByteString.Lazy.Char8 (ByteString)
import qualified Data.ByteString.Lazy.Char8 as B
import Test.QuickCheck
instance Arbitrary ByteString where
arbitrary = B.pack . map _char <$> arbitrary
testAll :: IO ()
testAll = void $ sequence [ cycleT $ view caesar
, cycleT $ view affine
, cycleT $ view substitution
, cycleT $ view stream
, cycleT $ view vigenère
, cycleT $ view enigma
, notSelfT $ view caesar
, notSelfT $ view affine
, notSelfT $ view substitution
, notSelfT $ view stream
, notSelfT $ view vigenère
, notSelfT $ view enigma
, diffKeyT $ view caesar
, diffKeyT $ view affine
, diffKeyT $ view substitution
, diffKeyT $ view stream
, diffKeyT $ view vigenère
, diffKeyT $ view enigma
, noSelfMappingT
]
cycleT :: (Monad c, Cipher k c) => (c ByteString -> ByteString) -> IO ()
cycleT f = do
k <- key <$> prng
quickCheck (\m -> f (encrypt k m >>= decrypt k) == m)
notSelfT :: (Monad c, Cipher k c) => (c ByteString -> ByteString) -> IO ()
notSelfT f = do
k <- key <$> prng
quickCheck (\m -> B.length m > 1 ==> m /= e f k m)
diffKeyT :: (Eq k,Monad c,Cipher k c) => (c ByteString -> ByteString) -> IO ()
diffKeyT f = do
k <- key <$> prng
k' <- key <$> prng
quickCheck (\m -> k /= k' && B.length m > 1 ==> e f k m /= e f k' m)
noSelfMappingT :: IO ()
noSelfMappingT = do
k <- key <$> prng
quickCheck (\m -> all (\(a,b) -> a /= b) $ B.zip m (e _enigma k m))
e :: Cipher k a => (a ByteString -> t) -> k -> ByteString -> t
e f k m = f $ encrypt k m
enig :: IO ByteString
enig = do
k <- key <$> prng
return $ encrypt k "Das ist ein Wetterbericht. Heil Hitler." ^. enigma