Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

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: 2000-07-23 (22:24)
From: Julian Assange <proff@i...>
Subject: Big_int a^x mod m

 val (**/) : num -> num -> num 
 val power_num : num -> num -> num

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?