Modulecrypton-2.1.7Haskell2010

Crypto.PubKey.Rabin.RW

Rabin-Williams cryptosystem for public-key encryption and digital signature. See pages 323 - 324 in "Computational Number Theory and Modern Cryptography" by Song Y. Yan. Also inspired by https://github.com/vanilala/vncrypt/blob/master/vncrypt/vnrw_gmp.c. 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
6 values

Packagecrypton-2.1.7
Exports8
LanguageHaskell2010
LicenceBSD-3-Clause AND MIT AND ISC
SourceRW.hs

datadata PublicKey

Represent a Rabin-Williams public key.

Constructors

PublicKey
- public_size :: Int
  size of key in bytes
- public_n :: Integer
  public p*q

Instances4Eq, Data, Read, Show

Eq PublicKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.RW
Data PublicKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.RW
Read PublicKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.RW
Show PublicKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.RW

datadata PrivateKey

Represent a Rabin-Williams private key.

Constructors

PrivateKey
- private_pub :: PublicKey
- private_p :: Integer
  p prime number
- private_q :: Integer
  q prime number
- private_d :: Integer

Instances5Eq, Data, Read, Show, DebugShow

Eq PrivateKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.RW
Data PrivateKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.RW
Read PrivateKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.RW
Show PrivateKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.RW
The public part is shown; the secret fields are not. Use debugShow to see them.
DebugShow PrivateKeyDefined in crypton-2.1.7 · Crypto.PubKey.Rabin.RW

valuegenerate :: MonadRandom m => Int -> m (PublicKey, PrivateKey)

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.

valueencrypt

:: (HashAlgorithm hash, MonadRandom m)
=> OAEPParams hash ByteString ByteString
OAEP padding parameters
-> PublicKey
public key
-> ByteString
plaintext
-> m (Either Error ByteString)

Encrypt plaintext using public key.

valueencryptWithSeed

:: HashAlgorithm hash
=> ByteString
Seed
-> OAEPParams hash ByteString ByteString
OAEP padding
-> PublicKey
public key
-> ByteString
plaintext
-> Either Error ByteString

Encrypt plaintext using public key an a predefined OAEP seed.

See algorithm 8.11 in "Handbook of Applied Cryptography" by Alfred J. Menezes et al.

valuedecrypt

:: HashAlgorithm hash
=> OAEPParams hash ByteString ByteString
OAEP padding parameters
-> PrivateKey
private key
-> ByteString
ciphertext
-> Maybe ByteString

Decrypt ciphertext using private key.

The ciphertext has to be what encrypt produces: the big-endian encoding, with no leading zero octet, of a value below the modulus. The primitives work modulo n, so without that condition c and c + n -- and c with a zero octet in front of it -- would all decrypt to the same message, and a ciphertext would not be unique to its plaintext.

valuesign

:: HashAlgorithm hash
=> PrivateKey
private key
-> hash
hash function
-> ByteString
message to sign
-> Either Error Integer

Sign message using hash algorithm and private key.

valueverify

:: HashAlgorithm hash
=> PublicKey
public key
-> hash
hash function
-> ByteString
message
-> Integer
signature
-> Bool

Verify signature using hash algorithm and public key.