License	BSD-style
Maintainer	Carlos Rodriguez-Vega <crodveg@yahoo.es>
Stability	experimental
Portability	unknown
Safe Haskell	None
Language	Haskell2010

Crypto.PubKey.Rabin.RW

Description

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 .

Synopsis

data PublicKey = PublicKey {
- public_size :: Int
- public_n :: Integer
}
data PrivateKey = PrivateKey {
- private_pub :: PublicKey
- private_p :: Integer
- private_q :: Integer
- private_d :: Integer
}
generate :: MonadRandom m => Int -> m ( PublicKey , PrivateKey )
encrypt :: ( HashAlgorithm hash, MonadRandom m) => OAEPParams hash ByteString ByteString -> PublicKey -> ByteString -> m ( Either Error ByteString )
encryptWithSeed :: HashAlgorithm hash => ByteString -> OAEPParams hash ByteString ByteString -> PublicKey -> ByteString -> Either Error ByteString
decrypt :: HashAlgorithm hash => OAEPParams hash ByteString ByteString -> PrivateKey -> ByteString -> Maybe ByteString
sign :: HashAlgorithm hash => PrivateKey -> hash -> ByteString -> Either Error Integer
verify :: HashAlgorithm hash => PublicKey -> hash -> ByteString -> Integer -> Bool

Documentation

data PublicKey Source #

Represent a Rabin-Williams public key.

Constructors

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

Instances

Instances details

Eq PublicKey Source #
Instance details Defined in Crypto.PubKey.Rabin.RW Methods (==) :: PublicKey -> PublicKey -> Bool Source # (/=) :: PublicKey -> PublicKey -> Bool Source #
Data PublicKey Source #
Instance details Defined in Crypto.PubKey.Rabin.RW Methods gfoldl :: ( forall d b. Data d => c (d -> b) -> d -> c b) -> ( forall g. g -> c g) -> PublicKey -> c PublicKey Source # gunfold :: ( forall b r. Data b => c (b -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c PublicKey Source # toConstr :: PublicKey -> Constr Source # dataTypeOf :: PublicKey -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c PublicKey ) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c PublicKey ) Source # gmapT :: ( forall b. Data b => b -> b) -> PublicKey -> PublicKey Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> PublicKey -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> PublicKey -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> PublicKey -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> PublicKey -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> PublicKey -> m PublicKey Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> PublicKey -> m PublicKey Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> PublicKey -> m PublicKey Source #
Read PublicKey Source #
Instance details Defined in Crypto.PubKey.Rabin.RW Methods readsPrec :: Int -> ReadS PublicKey Source # readList :: ReadS [ PublicKey ] Source # readPrec :: ReadPrec PublicKey Source # readListPrec :: ReadPrec [ PublicKey ] Source #
Show PublicKey Source #
Instance details Defined in Crypto.PubKey.Rabin.RW Methods showsPrec :: Int -> PublicKey -> ShowS Source # show :: PublicKey -> String Source # showList :: [ PublicKey ] -> ShowS Source #

data PrivateKey Source #

Represent a Rabin-Williams private key.

Constructors

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

Instances

Instances details

Eq PrivateKey Source #
Instance details Defined in Crypto.PubKey.Rabin.RW Methods (==) :: PrivateKey -> PrivateKey -> Bool Source # (/=) :: PrivateKey -> PrivateKey -> Bool Source #
Data PrivateKey Source #
Instance details Defined in Crypto.PubKey.Rabin.RW Methods gfoldl :: ( forall d b. Data d => c (d -> b) -> d -> c b) -> ( forall g. g -> c g) -> PrivateKey -> c PrivateKey Source # gunfold :: ( forall b r. Data b => c (b -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c PrivateKey Source # toConstr :: PrivateKey -> Constr Source # dataTypeOf :: PrivateKey -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c PrivateKey ) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c PrivateKey ) Source # gmapT :: ( forall b. Data b => b -> b) -> PrivateKey -> PrivateKey Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> PrivateKey -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> PrivateKey -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> PrivateKey -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> PrivateKey -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> PrivateKey -> m PrivateKey Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> PrivateKey -> m PrivateKey Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> PrivateKey -> m PrivateKey Source #
Read PrivateKey Source #
Instance details Defined in Crypto.PubKey.Rabin.RW Methods readsPrec :: Int -> ReadS PrivateKey Source # readList :: ReadS [ PrivateKey ] Source # readPrec :: ReadPrec PrivateKey Source # readListPrec :: ReadPrec [ PrivateKey ] Source #
Show PrivateKey Source #
Instance details Defined in Crypto.PubKey.Rabin.RW Methods showsPrec :: Int -> PrivateKey -> ShowS Source # show :: PrivateKey -> String Source # showList :: [ PrivateKey ] -> ShowS Source #

generate :: MonadRandom m => Int -> m ( PublicKey , PrivateKey ) Source #

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.

encrypt Source #

Arguments

:: ( 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.

encryptWithSeed Source #

Arguments

:: 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.

decrypt Source #

Arguments

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

Decrypt ciphertext using private key.

sign Source #

Arguments

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

Sign message using hash algorithm and private key.

verify Source #

Arguments

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

Verify signature using hash algorithm and public key.