Represent a Modified-Rabin public key.
Constructors
PublicKeypublic_size :: Intsize of key in bytes
public_n :: Integerpublic p*q
Modulecryptonite-0.30Haskell2010
Crypto.PubKey.Rabin.Modified
Modified-Rabin public-key digital signature algorithm. See algorithm 11.30 in "Handbook of Applied Cryptography" by Alfred J. Menezes et al.
Synopsis
- data PublicKey
- data PrivateKey
- value generate
- value sign
- value verify
- Packagecryptonite-0.30
- Exports5
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceModified.hs
Represent a Modified-Rabin private key.
Constructors
Instances4Eq, Data, Read, Show
Eq PrivateKeyDefined in cryptonite-0.30 · Crypto.PubKey.Rabin.ModifiedData PrivateKeyDefined in cryptonite-0.30 · Crypto.PubKey.Rabin.ModifiedRead PrivateKeyDefined in cryptonite-0.30 · Crypto.PubKey.Rabin.ModifiedShow PrivateKeyDefined in cryptonite-0.30 · Crypto.PubKey.Rabin.Modified
Generate a pair of (private, public) key of size in bytes. Prime p is congruent 3 mod 8 and prime q is congruent 7 mod 8.
value
sign :: HashAlgorithm hash=> PrivateKeyprivate key
-> hashhash function
-> ByteStringmessage to sign
-> Either Error Integer
Sign message using hash algorithm and private key.
value
verify :: HashAlgorithm hash=> PublicKeypublic key
-> hashhash function
-> ByteStringmessage
-> Integersignature
-> Bool
Verify signature using hash algorithm and public key.