6 main = interact (decrypt 2036450659413645137870851576872812267542175329986469156678671505255564383842535488743101632280716717779536712424613501441720195827856504007305662157107
7 5282760067491066073559694937813662322539426172665930660813609694132726350877)
13 main = interact (prompt . keys . lines)
15 keys (x:y:xs) = makeKeys (read x) (read y)
16 prompt ks = "\nEnter two random numbers on separate lines:\n" ++
18 (n,e,d) -> "The numbers n, e, and d are:\n" ++
19 unlines (map show [n,e,d]) ++ "\n"
29 main = interact (encrypt 2036450659413645137870851576872812267542175329986469156678671505255564383842535488743101632280716717779536712424613501441720195827856504007305662157107
31 387784473137902876992546516170169092918207676456888779623592396031349415024943784869634893342729620092877891356118467738167515879252473323905128540213)
32 module Rsa (encrypt, decrypt, makeKeys)
36 encrypt, decrypt :: Integer -> Integer -> String -> String
37 encrypt n e = unlines . map (show . power e n . code) . collect (size n)
38 decrypt n d = concat . map (decode . power d n . read) . lines
41 -------- Converting between Strings and Integers -----------
43 code :: String -> Integer
45 where accum x y = (128 * x) + fromIntegral (ord y)
47 decode :: Integer -> String
48 decode n = reverse (expand n)
50 expand x = chr (fromIntegral (x `mod` 128)) : expand (x `div` 128)
52 collect :: Int -> [a] -> [[a]]
55 collect n xs = take n xs : collect n (drop n xs)
57 size :: Integer -> Int
58 size n = (length (show n) * 47) `div` 100 -- log_128 10 = 0.4745
61 ------- Constructing keys -------------------------
63 makeKeys :: Integer -> Integer -> (Integer, Integer, Integer)
64 makeKeys p' q' = (n, invert phi d, d)
65 where p = nextPrime p'
71 nextPrime :: Integer -> Integer
72 nextPrime a = head (filter prime [odd,odd+2..])
73 where odd | even a = a+1
75 prime p = and [power (p-1) p x == 1 | x <- [3,5,7]]
77 invert :: Integer -> Integer -> Integer
78 invert n a = if e<0 then e+n else e
81 iter :: Integer -> Integer -> Integer -> Integer -> Integer
83 iter g v h w = iter h w (g - fact * h) (v - fact * w)
84 where fact = g `div` h
87 ------- Fast exponentiation, mod m -----------------
89 power :: Integer -> Integer -> Integer -> Integer
91 power n m x | even n = sqr (power (n `div` 2) m x) `mod` m
92 | True = (x * power (n-1) m x) `mod` m
94 sqr :: Integer -> Integer