License	BSD-style
Maintainer	Vincent Hanquez <vincent@snarc.org>
Stability	experimental
Portability	Good
Safe Haskell	None
Language	Haskell2010

Crypto.PubKey.RSA.Types

Description

Synopsis

data Error
data Blinder = Blinder !Integer !Integer
data PublicKey = PublicKey {
- public_size :: Int
- public_n :: Integer
- public_e :: Integer
}
data PrivateKey = PrivateKey {
- private_pub :: PublicKey
- private_d :: Integer
- private_p :: Integer
- private_q :: Integer
- private_dP :: Integer
- private_dQ :: Integer
- private_qinv :: Integer
}
newtype KeyPair = KeyPair PrivateKey
toPublicKey :: KeyPair -> PublicKey
toPrivateKey :: KeyPair -> PrivateKey
private_size :: PrivateKey -> Int
private_n :: PrivateKey -> Integer
private_e :: PrivateKey -> Integer

Documentation

data Error Source #

error possible during encryption, decryption or signing.

Constructors

MessageSizeIncorrect	the message to decrypt is not of the correct size (need to be == private_size)
MessageTooLong	the message to encrypt is too long
MessageNotRecognized	the message decrypted doesn't have a PKCS15 structure (0 2 .. 0 msg)
SignatureTooLong	the message's digest is too long
InvalidParameters	some parameters lead to breaking assumptions.

Instances

Instances details

Show Error Source #
Instance details Defined in Crypto.PubKey.RSA.Types Methods showsPrec :: Int -> Error -> ShowS # show :: Error -> String # showList :: [Error] -> ShowS #
Eq Error Source #
Instance details Defined in Crypto.PubKey.RSA.Types Methods (==) :: Error -> Error -> Bool # (/=) :: Error -> Error -> Bool #

data Blinder Source #

A blinder, which keeps the timing of the private key operation from saying anything about the number it was given.

The private exponent is not what is at risk. expSafe, which the exponentiation goes through, keeps the value of an exponent out of the work it does.

What a blinder covers is the other side. Without one, the operation runs on the ciphertext as it arrived, so how long it takes depends on a number an attacker may have chosen and can vary -- which is what a remote timing attack on RSA needs. With one, the input is multiplied by a random value first and that value divided out afterwards, so the timing carries nothing an attacker can steer.

Every private key operation here takes a Maybe Blinder. The Safer form of each -- decryptSafer, signSafer and their kind -- generates one and is the one to reach for. Pass Nothing only where the input is not attacker controlled and you have decided that it is not.

A blinder costs one more exponentiation, by the public exponent, which is the cheap direction: measured on an Apple M4, PKCS#1 v1.5 signing goes from about 601 to about 620 microseconds.

Use a blinder once. generateBlinder makes a fresh one; carrying one across operations is not what it is for.

Constructors

Blinder !Integer !Integer

Instances

Instances details

Show Blinder Source #
Instance details Defined in Crypto.PubKey.RSA.Types Methods showsPrec :: Int -> Blinder -> ShowS # show :: Blinder -> String # showList :: [Blinder] -> ShowS #
Eq Blinder Source #
Instance details Defined in Crypto.PubKey.RSA.Types Methods (==) :: Blinder -> Blinder -> Bool # (/=) :: Blinder -> Blinder -> Bool #

data PublicKey Source #

Represent a RSA public key

Constructors

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

Instances

Instances details

Data PublicKey Source #

Instance details

PrivateKey
Fields private_pub :: PublicKey public part of a private key (size, n and e) private_d :: Integer private exponent d private_p :: Integer p prime number private_q :: Integer q prime number private_dP :: Integer d mod (p-1) private_dQ :: Integer d mod (q-1) private_qinv :: Integer q^(-1) mod p

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