Medien Zeghid

Efficient hardware multiplier design for pairing computation

2015

In Public Key Cryptography, the most costly arithmetic operation is first inversion then multiplication. There aren't big researches concerning modular inversion, it exist two famous algorithms which are Fermat and Extended Euclid algorithms. All researches …