Represent a Modified-Rabin public key.
Constructors
PublicKeypublic_size :: Intsize of key in bytes
public_n :: Integerpublic p*q
Modulecrypton-2.1.7Haskell2010
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. The Jacobi symbols here are taken modulo the public modulus, not the private primes, so what Crypto.PubKey.Rabin.Basic says about that does not apply; the note there about Integer arithmetic does.
- 2 types
- 3 values
- Packagecrypton-2.1.7
- Exports5
- LanguageHaskell2010
- LicenceBSD-3-Clause AND MIT AND ISC
- SourceModified.hs
Represent a Modified-Rabin private key.
Constructors
Instances5Eq, Data, Read, Show, DebugShow
Eq PrivateKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.ModifiedData PrivateKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.ModifiedRead PrivateKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.ModifiedShow PrivateKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.ModifiedThe public part is shown; the secret fields are not. Use debugShow to see them.
DebugShow PrivateKeyDefined in crypton-2.1.7 · 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.