Protocol.Arithmetic

Documentation

class ToNatural a where

Methods

nat :: a -> Natural

Instances

ToNatural (E q)

Defined in Protocol.Arithmetic

Methods

nat :: E q -> Natural

ToNatural (G q)

Defined in Protocol.Arithmetic

Methods

nat :: G q -> Natural

ToNatural (F p)

Defined in Protocol.Arithmetic

Methods

nat :: F p -> Natural

class FromNatural a where

Methods

fromNatural :: Natural -> a

Instances

SubGroup q => FromNatural (E q)

Defined in Protocol.Arithmetic

Methods

fromNatural :: Natural -> E q

PrimeField (P q) => FromNatural (G q)

Defined in Protocol.Arithmetic

Methods

fromNatural :: Natural -> G q

PrimeField p => FromNatural (F p)

Defined in Protocol.Arithmetic

Methods

fromNatural :: Natural -> F p

data BeleniosParams

Parameters used in Belenios. A 2048-bit fieldCharac of a PrimeField, with a 256-bit groupOrder for a Multiplicative SubGroup generated by groupGen.

Instances

SubGroup BeleniosParams

Defined in Protocol.Arithmetic

Associated Types

type P BeleniosParams :: Type

Methods

groupGen :: G BeleniosParams

groupOrder :: F (P BeleniosParams)

groupGenInverses :: [G BeleniosParams]

PrimeField BeleniosParams

Defined in Protocol.Arithmetic

Methods

fieldCharac :: Natural

type P BeleniosParams

Defined in Protocol.Arithmetic

type P BeleniosParams = BeleniosParams

data WeakParams

Weak parameters for debugging purposes only.

Instances

SubGroup WeakParams

Defined in Protocol.Arithmetic

Associated Types

type P WeakParams :: Type

Methods

groupGen :: G WeakParams

groupOrder :: F (P WeakParams)

groupGenInverses :: [G WeakParams]

PrimeField WeakParams

Defined in Protocol.Arithmetic

Methods

fieldCharac :: Natural

type P WeakParams

Defined in Protocol.Arithmetic

type P WeakParams = WeakParams

type RandomGen = RandomGen

newtype E q

An exponent of a (necessarily cyclic) SubGroup of a PrimeField. The value is always in [0..groupOrder-1].

Constructors

E

Fields

• unE :: F (P q)

Instances

SubGroup q => Enum (E q)

Defined in Protocol.Arithmetic

Methods

succ :: E q -> E q

pred :: E q -> E q

toEnum :: Int -> E q

fromEnum :: E q -> Int

enumFrom :: E q -> [E q]

enumFromThen :: E q -> E q -> [E q]

enumFromTo :: E q -> E q -> [E q]

enumFromThenTo :: E q -> E q -> E q -> [E q]

Eq (E q)

Defined in Protocol.Arithmetic

Methods

(==) :: E q -> E q -> Bool

(/=) :: E q -> E q -> Bool

Ord (E q)

Defined in Protocol.Arithmetic

Methods

compare :: E q -> E q -> Ordering

(<) :: E q -> E q -> Bool

(<=) :: E q -> E q -> Bool

(>) :: E q -> E q -> Bool

(>=) :: E q -> E q -> Bool

max :: E q -> E q -> E q

min :: E q -> E q -> E q

Show (E q)

Defined in Protocol.Arithmetic

Methods

showsPrec :: Int -> E q -> ShowS

show :: E q -> String

showList :: [E q] -> ShowS

SubGroup q => Random (E q)

Defined in Protocol.Arithmetic

Methods

randomR :: RandomGen g => (E q, E q) -> g -> (E q, g)

random :: RandomGen g => g -> (E q, g)

randomRs :: RandomGen g => (E q, E q) -> g -> [E q]

randoms :: RandomGen g => g -> [E q]

randomRIO :: (E q, E q) -> IO (E q)

randomIO :: IO (E q)

ToNatural (E q)

Defined in Protocol.Arithmetic

Methods

nat :: E q -> Natural

SubGroup q => FromNatural (E q)

Defined in Protocol.Arithmetic

Methods

fromNatural :: Natural -> E q

(SubGroup q, Multiplicative (F (P q))) => Multiplicative (E q)

Defined in Protocol.Arithmetic

Methods

one :: E q

(*) :: E q -> E q -> E q

(SubGroup q, Negable (F (P q))) => Negable (E q)

Defined in Protocol.Arithmetic

Methods

neg :: E q -> E q

(-) :: E q -> E q -> E q

(SubGroup q, Additive (F (P q))) => Additive (E q)

Defined in Protocol.Arithmetic

Methods

zero :: E q

(+) :: E q -> E q -> E q

sum :: Foldable f => f (E q) -> E q

class (PrimeField (P q), Multiplicative (F (P q))) => SubGroup q where

A SubGroup of a Multiplicative group of a PrimeField. Used for signing (Schnorr) and encrypting (ElGamal).

Minimal complete definition

groupGen, groupOrder

Associated Types

type P q :: *

Setting q determines p, equals to P q.

Methods

groupGen :: G q

A generator of the SubGroup. NOTE: since F p is a PrimeField, the Multiplicative SubGroup is cyclic, and there are phi(fieldCharac-1) many choices for the generator of the group, where phi is the Euler totient function.

groupOrder :: F (P q)

The order of the SubGroup.

WARNING: groupOrder MUST be a prime number dividing (fieldCharac-1) to ensure that ElGamal is secure in terms of the DDH assumption.

groupGenInverses :: [G q]

groupGenInverses returns the infinite list of inverse powers of groupGen: [groupGen ^ neg i | i <- [0..]], but by computing each value from the previous one.

NOTE: groupGenInverses is in the SubGroup class in order to keep computed terms in memory across calls to groupGenInverses.

Used by intervalDisjunctions.

Instances

SubGroup BeleniosParams

Defined in Protocol.Arithmetic

Associated Types

type P BeleniosParams :: Type

Methods

groupGen :: G BeleniosParams

groupOrder :: F (P BeleniosParams)

groupGenInverses :: [G BeleniosParams]

SubGroup WeakParams

Defined in Protocol.Arithmetic

Associated Types

type P WeakParams :: Type

Methods

groupGen :: G WeakParams

groupOrder :: F (P WeakParams)

groupGenInverses :: [G WeakParams]

newtype G q

The type of the elements of a Multiplicative SubGroup of a PrimeField.

Constructors

G

Fields

• unG :: F (P q)

Instances

Eq (G q)

Defined in Protocol.Arithmetic

Methods

(==) :: G q -> G q -> Bool

(/=) :: G q -> G q -> Bool

Ord (G q)

Defined in Protocol.Arithmetic

Methods

compare :: G q -> G q -> Ordering

(<) :: G q -> G q -> Bool

(<=) :: G q -> G q -> Bool

(>) :: G q -> G q -> Bool

(>=) :: G q -> G q -> Bool

max :: G q -> G q -> G q

min :: G q -> G q -> G q

Show (G q)

Defined in Protocol.Arithmetic

Methods

showsPrec :: Int -> G q -> ShowS

show :: G q -> String

showList :: [G q] -> ShowS

ToNatural (G q)

Defined in Protocol.Arithmetic

Methods

nat :: G q -> Natural

PrimeField (P q) => FromNatural (G q)

Defined in Protocol.Arithmetic

Methods

fromNatural :: Natural -> G q

(SubGroup q, Multiplicative (F (P q))) => Invertible (G q)

Defined in Protocol.Arithmetic

Methods

inv :: G q -> G q

(/) :: G q -> G q -> G q

(SubGroup q, Multiplicative (F (P q))) => Multiplicative (G q)

Defined in Protocol.Arithmetic

Methods

one :: G q

(*) :: G q -> G q -> G q

class Multiplicative a => Invertible a where

Minimal complete definition

inv

Methods

inv :: a -> a

(/) :: a -> a -> a infixl 7

Instances

(SubGroup q, Multiplicative (F (P q))) => Invertible (G q)

Defined in Protocol.Arithmetic

Methods

inv :: G q -> G q

(/) :: G q -> G q -> G q

class Multiplicative a where

Methods

one :: a

(*) :: a -> a -> a infixl 7

Instances

Multiplicative Int

Defined in Protocol.Arithmetic

Methods

one :: Int

(*) :: Int -> Int -> Int

Multiplicative Integer

Defined in Protocol.Arithmetic

Methods

one :: Integer

(*) :: Integer -> Integer -> Integer

Multiplicative Natural

Defined in Protocol.Arithmetic

Methods

one :: Natural

(*) :: Natural -> Natural -> Natural

(SubGroup q, Multiplicative (F (P q))) => Multiplicative (E q)

Defined in Protocol.Arithmetic

Methods

one :: E q

(*) :: E q -> E q -> E q

(SubGroup q, Multiplicative (F (P q))) => Multiplicative (G q)

Defined in Protocol.Arithmetic

Methods

one :: G q

(*) :: G q -> G q -> G q

PrimeField p => Multiplicative (F p)

Defined in Protocol.Arithmetic

Methods

one :: F p

(*) :: F p -> F p -> F p

class Additive a => Negable a where

Minimal complete definition

neg

Methods

neg :: a -> a

(-) :: a -> a -> a infixl 6

Instances

Negable Int

Defined in Protocol.Arithmetic

Methods

neg :: Int -> Int

(-) :: Int -> Int -> Int

Negable Integer

Defined in Protocol.Arithmetic

Methods

neg :: Integer -> Integer

(-) :: Integer -> Integer -> Integer

(SubGroup q, Negable (F (P q))) => Negable (E q)

Defined in Protocol.Arithmetic

Methods

neg :: E q -> E q

(-) :: E q -> E q -> E q

PrimeField p => Negable (F p)

Defined in Protocol.Arithmetic

Methods

neg :: F p -> F p

(-) :: F p -> F p -> F p

class Additive a where

Minimal complete definition

zero, (+)

Methods

zero :: a

(+) :: a -> a -> a infixl 6

sum :: Foldable f => f a -> a

Instances

Additive Int

Defined in Protocol.Arithmetic

Methods

zero :: Int

(+) :: Int -> Int -> Int

sum :: Foldable f => f Int -> Int

Additive Integer

Defined in Protocol.Arithmetic

Methods

zero :: Integer

(+) :: Integer -> Integer -> Integer

sum :: Foldable f => f Integer -> Integer

Additive Natural

Defined in Protocol.Arithmetic

Methods

zero :: Natural

(+) :: Natural -> Natural -> Natural

sum :: Foldable f => f Natural -> Natural

(SubGroup q, Additive (F (P q))) => Additive (E q)

Defined in Protocol.Arithmetic

Methods

zero :: E q

(+) :: E q -> E q -> E q

sum :: Foldable f => f (E q) -> E q

PrimeField p => Additive (F p)

Defined in Protocol.Arithmetic

Methods

zero :: F p

(+) :: F p -> F p -> F p

sum :: Foldable f => f (F p) -> F p

SubGroup q => Additive (Encryption q)

Additive homomorphism. Using the fact that: groupGen ^x * groupGen ^y == groupGen ^(x+y).

Defined in Protocol.Election

Methods

zero :: Encryption q

(+) :: Encryption q -> Encryption q -> Encryption q

sum :: Foldable f => f (Encryption q) -> Encryption q

class PrimeField p where

Parameter for a prime field.

Methods

fieldCharac :: Natural

The prime number characteristic of a PrimeField.

ElGamal's hardness to decrypt requires a large prime number to form the Multiplicative SubGroup.

Instances

PrimeField BeleniosParams

Defined in Protocol.Arithmetic

Methods

fieldCharac :: Natural

PrimeField WeakParams

Defined in Protocol.Arithmetic

Methods

fieldCharac :: Natural

newtype F p

The type of the elements of a PrimeField.

A field must satisfy the following properties:

• (f, (+), zero) forms an abelian group, called the Additive group of f.
• (NonNull f, (*), one) forms an abelian group, called the Multiplicative group of f.
• (*) is associative: (a*b)*c == a*(b*c) and a*(b*c) == (a*b)*c.
• (*) and (+) are both commutative: a*b == b*a and a+b == b+a
• (*) and (+) are both left and right distributive: a*(b+c) == (a*b) + (a*c) and (a+b)*c == (a*c) + (b*c)

The Natural is always within [0..fieldCharac-1].

Constructors

F

Fields

• unF :: Natural

Instances

Eq (F p)

Defined in Protocol.Arithmetic

Methods

(==) :: F p -> F p -> Bool

(/=) :: F p -> F p -> Bool

Ord (F p)

Defined in Protocol.Arithmetic

Methods

compare :: F p -> F p -> Ordering

(<) :: F p -> F p -> Bool

(<=) :: F p -> F p -> Bool

(>) :: F p -> F p -> Bool

(>=) :: F p -> F p -> Bool

max :: F p -> F p -> F p

min :: F p -> F p -> F p

Show (F p)

Defined in Protocol.Arithmetic

Methods

showsPrec :: Int -> F p -> ShowS

show :: F p -> String

showList :: [F p] -> ShowS

PrimeField p => Random (F p)

Defined in Protocol.Arithmetic

Methods

randomR :: RandomGen g => (F p, F p) -> g -> (F p, g)

random :: RandomGen g => g -> (F p, g)

randomRs :: RandomGen g => (F p, F p) -> g -> [F p]

randoms :: RandomGen g => g -> [F p]

randomRIO :: (F p, F p) -> IO (F p)

randomIO :: IO (F p)

ToNatural (F p)

Defined in Protocol.Arithmetic

Methods

nat :: F p -> Natural

PrimeField p => FromNatural (F p)

Defined in Protocol.Arithmetic

Methods

fromNatural :: Natural -> F p

PrimeField p => Multiplicative (F p)

Defined in Protocol.Arithmetic

Methods

one :: F p

(*) :: F p -> F p -> F p

PrimeField p => Negable (F p)

Defined in Protocol.Arithmetic

Methods

neg :: F p -> F p

(-) :: F p -> F p -> F p

PrimeField p => Additive (F p)

Defined in Protocol.Arithmetic

Methods

zero :: F p

(+) :: F p -> F p -> F p

sum :: Foldable f => f (F p) -> F p

hash :: SubGroup q => ByteString -> [G q] -> E q

(hash bs gs) returns as a number in E the SHA256 of the given ByteString bs prefixing the decimal representation of given SubGroup elements gs, with a comma (",") intercalated between them.

NOTE: to avoid any collision when the hash function is used in different contexts, a message gs is actually prefixed by a bs indicating the context.

Used by proveEncryption and verifyEncryption, where the bs usually contains the statement to be proven, and the gs contains the commitments.

(^) :: SubGroup q => G q -> E q -> G q infixr 8

(b ^ e) returns the modular exponentiation of base b by exponent e.

randomR :: Monad m => RandomGen r => Random i => Negable i => Multiplicative i => i -> StateT r m i

(randomR i) returns a random integer in [0..i-1].

random :: Monad m => RandomGen r => Random i => Negable i => Multiplicative i => StateT r m i

(random) returns a random integer in the range determined by its type.

bytesNat :: ToNatural n => n -> ByteString

(bytesNat x) returns the serialization of x.

data Natural

Type representing arbitrary-precision non-negative integers.

>>> 2^100 :: Natural
1267650600228229401496703205376

Operations whose result would be negative throw (Underflow :: ArithException),

>>> -1 :: Natural
*** Exception: arithmetic underflow

Since: base-4.8.0.0

Instances

Enum Natural

Since: base-4.8.0.0

Defined in GHC.Enum

Methods

succ :: Natural -> Natural

pred :: Natural -> Natural

toEnum :: Int -> Natural

fromEnum :: Natural -> Int

enumFrom :: Natural -> [Natural]

enumFromThen :: Natural -> Natural -> [Natural]

enumFromTo :: Natural -> Natural -> [Natural]

enumFromThenTo :: Natural -> Natural -> Natural -> [Natural]

Eq Natural

Since: base-4.8.0.0

Defined in GHC.Natural

Methods

(==) :: Natural -> Natural -> Bool

(/=) :: Natural -> Natural -> Bool

Integral Natural

Since: base-4.8.0.0

Defined in GHC.Real

Methods

quot :: Natural -> Natural -> Natural

rem :: Natural -> Natural -> Natural

div :: Natural -> Natural -> Natural

mod :: Natural -> Natural -> Natural

quotRem :: Natural -> Natural -> (Natural, Natural)

divMod :: Natural -> Natural -> (Natural, Natural)

toInteger :: Natural -> Integer

Num Natural

Note that Natural's Num instance isn't a ring: no element but 0 has an additive inverse. It is a semiring though.

Since: base-4.8.0.0

Defined in GHC.Num

Methods

(+) :: Natural -> Natural -> Natural

(-) :: Natural -> Natural -> Natural

(*) :: Natural -> Natural -> Natural

negate :: Natural -> Natural

abs :: Natural -> Natural

signum :: Natural -> Natural

fromInteger :: Integer -> Natural

Ord Natural

Since: base-4.8.0.0

Defined in GHC.Natural

Methods

compare :: Natural -> Natural -> Ordering

(<) :: Natural -> Natural -> Bool

(<=) :: Natural -> Natural -> Bool

(>) :: Natural -> Natural -> Bool

(>=) :: Natural -> Natural -> Bool

max :: Natural -> Natural -> Natural

min :: Natural -> Natural -> Natural

Real Natural

Since: base-4.8.0.0

Defined in GHC.Real

Methods

toRational :: Natural -> Rational

Show Natural

Since: base-4.8.0.0

Defined in GHC.Show

Methods

showsPrec :: Int -> Natural -> ShowS

show :: Natural -> String

showList :: [Natural] -> ShowS

Bits Natural

Since: base-4.8.0

Defined in Data.Bits

Methods

(.&.) :: Natural -> Natural -> Natural

(.|.) :: Natural -> Natural -> Natural

xor :: Natural -> Natural -> Natural

complement :: Natural -> Natural

shift :: Natural -> Int -> Natural

rotate :: Natural -> Int -> Natural

zeroBits :: Natural

bit :: Int -> Natural

setBit :: Natural -> Int -> Natural

clearBit :: Natural -> Int -> Natural

complementBit :: Natural -> Int -> Natural

testBit :: Natural -> Int -> Bool

bitSizeMaybe :: Natural -> Maybe Int

bitSize :: Natural -> Int

isSigned :: Natural -> Bool

shiftL :: Natural -> Int -> Natural

unsafeShiftL :: Natural -> Int -> Natural

shiftR :: Natural -> Int -> Natural

unsafeShiftR :: Natural -> Int -> Natural

rotateL :: Natural -> Int -> Natural

rotateR :: Natural -> Int -> Natural

popCount :: Natural -> Int

Subtractive Natural

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Natural :: Type

Methods

(-) :: Natural -> Natural -> Difference Natural

Random Natural

Defined in Protocol.Arithmetic

Methods

randomR :: RandomGen g => (Natural, Natural) -> g -> (Natural, g)

random :: RandomGen g => g -> (Natural, g)

randomRs :: RandomGen g => (Natural, Natural) -> g -> [Natural]

randoms :: RandomGen g => g -> [Natural]

randomRIO :: (Natural, Natural) -> IO Natural

randomIO :: IO Natural

Multiplicative Natural

Defined in Protocol.Arithmetic

Methods

one :: Natural

(*) :: Natural -> Natural -> Natural

Additive Natural

Defined in Protocol.Arithmetic

Methods

zero :: Natural

(+) :: Natural -> Natural -> Natural

sum :: Foldable f => f Natural -> Natural

type Difference Natural

Defined in Basement.Numerical.Subtractive

type Difference Natural = Maybe Natural

Orphan instances

Random Natural

Methods

randomR :: RandomGen g => (Natural, Natural) -> g -> (Natural, g)

random :: RandomGen g => g -> (Natural, g)

randomRs :: RandomGen g => (Natural, Natural) -> g -> [Natural]

randoms :: RandomGen g => g -> [Natural]

randomRIO :: (Natural, Natural) -> IO Natural

randomIO :: IO Natural