Useful Arithmetic for Cryptography

Évènement
Jean-Claude Bajard
Lundi 08 Juil 2013

Most of the asymetric cryptographic protocols are based on mathematical objects defined on finite fields (or finite rings). 
We present an overview of different representations and algorithms for fundamental operations like the modular multiplication.
Some of them are particularly dedicated to hardware and embedded systems.