Version française
Home     About     Download     Resources     Contact us    
Browse thread
Big_int a^x mod m
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Remi VANICAT <remi.vanicat@l...>
Subject: Re: Big_int a^x mod m
Julian Assange <proff@iq.org> writes:

>  val (**/) : num -> num -> num 
>  val power_num : num -> num -> num
>    Exponentiation
> 
> The num library documentation doesn't seem to support modular
> exponentiation. This is seems to be an unusual oversight, and means
> the library isn't useful for real-world cryptographic applications.
> 
> Is anyone working on adding mod exp's? Or are there other bigint
> ocaml libraries?

there is at least two other bigint libraries :
one is MLGMP a binding for GNU MP :
  http://www.di.ens.fr/~monniaux/programmes.html.en 
the other is numerix : http://pauillac.inria.fr/~quercia/

-- 
Rémi Vanicat
vanicat@labri.u-bordeaux.fr
http://dept-info.labri.u-bordeaux.fr/~vanicat