hecc-0.3: Elliptic Curve Cryptography for Haskell

Maintainer	Marcel Fourné (hecc@bitrot.dyndns.org)
Safe Haskell	Safe-Infered

Codec.Crypto.ECC.F2

Description

F(2^e)-Backend

Synopsis

Documentation

f2eAdd :: Array U DIM1 Bool -> Array U DIM1 Bool -> Array U DIM1 Bool Source

binary addition of a1 and a2

f2eMul :: Array U DIM1 Bool -> Array U DIM1 Bool -> Array U DIM1 Bool Source

binary multiplication of a1 and a2

f2eBitshift :: Array U DIM1 Bool -> Int -> Array U DIM1 Bool Source

a simple bitshift where n shifts left, so a negative n shifts right

f2eReduceBy :: Array U DIM1 Bool -> Array U DIM1 Bool -> Array U DIM1 Bool Source

polynomial reduction of a via r

f2eFromInteger :: Integer -> Array U DIM1 Bool Source

f2ePow :: Array U DIM1 Bool -> Integer -> Array U DIM1 Bool Source

f2eToInteger :: Array U DIM1 Bool -> Integer Source

f2eTestBit :: Array U DIM1 Bool -> Int -> Bool Source

elimFalses :: Array U DIM1 Bool -> Array U DIM1 Bool Source

modinvF2 Source

Arguments

:: Array U DIM1 Bool	the polynomial to invert
-> Array U DIM1 Bool	the modulus
-> Array U DIM1 Bool	the inverted value

computing the modular inverse of a emod m, this is broken atm

f2eLen :: Unbox a => Array U sh a -> Int Source