crypton-0.34: Cryptography Primitives sink

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

Crypto.PubKey.ECC.DH

Description

Elliptic curve Diffie Hellman

Synopsis

- data Curve
- type PublicPoint = Point
- type PrivateNumber = Integer
- newtype SharedKey = SharedKey ScrubbedBytes
- generatePrivate :: MonadRandom m => Curve -> m PrivateNumber
- calculatePublic :: Curve -> PrivateNumber -> PublicPoint
- getShared :: Curve -> PrivateNumber -> PublicPoint -> SharedKey

# Documentation

data Curve Source #

Define either a binary curve or a prime curve.

#### Instances

Instances details

Data Curve Source # |

Instance details

Defined in Crypto.PubKey.ECC.Types

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Curve -> c Curve Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Curve Source #

toConstr :: Curve -> Constr Source #

dataTypeOf :: Curve -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Curve) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Curve) Source #

gmapT :: (forall b. Data b => b -> b) -> Curve -> Curve Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Curve -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Curve -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Curve -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Curve -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Curve -> m Curve Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Curve -> m Curve Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Curve -> m Curve Source #

Read Curve Source # |
Instance details Defined in Crypto.PubKey.ECC.Types Methods readsPrec :: Int -> ReadS Curve Source # readList :: ReadS [Curve] Source # readPrec :: ReadPrec Curve Source # readListPrec :: ReadPrec [Curve] Source #
Show Curve Source # |
Instance details Defined in Crypto.PubKey.ECC.Types Methods showsPrec :: Int -> Curve -> ShowS Source # show :: Curve -> String Source # showList :: [Curve] -> ShowS Source #
Eq Curve Source # |
Instance details Defined in Crypto.PubKey.ECC.Types Methods (==) :: Curve -> Curve -> Bool Source # (/=) :: Curve -> Curve -> Bool Source #

type PublicPoint = Point Source #

ECC Public Point

type PrivateNumber = Integer Source #

ECC Private Number

newtype SharedKey Source #

Represent Diffie Hellman shared secret.

Constructors

SharedKey ScrubbedBytes |

#### Instances

Instances details

Show SharedKey Source # |
Instance details Defined in Crypto.PubKey.DH Methods showsPrec :: Int -> SharedKey -> ShowS Source # show :: SharedKey -> String Source # showList :: [SharedKey] -> ShowS Source #
NFData SharedKey Source # |
Instance details Defined in Crypto.PubKey.DH Methods rnf :: SharedKey -> () Source #
Eq SharedKey Source # |
Instance details Defined in Crypto.PubKey.DH Methods (==) :: SharedKey -> SharedKey -> Bool Source # (/=) :: SharedKey -> SharedKey -> Bool Source #
ByteArrayAccess SharedKey Source # |
Instance details Defined in Crypto.PubKey.DH Methods length :: SharedKey -> Int Source # withByteArray :: SharedKey -> (Ptr p -> IO a) -> IO a Source # copyByteArrayToPtr :: SharedKey -> Ptr p -> IO () Source #

generatePrivate :: MonadRandom m => Curve -> m PrivateNumber Source #

Generating a private number d.

calculatePublic :: Curve -> PrivateNumber -> PublicPoint Source #

Generating a public point Q.

getShared :: Curve -> PrivateNumber -> PublicPoint -> SharedKey Source #

Generating a shared key using our private number and the other party public point.