Efficient and low0complexity hardware architecture of Gaussian normal basis multiplication over GF (2 m ) for elliptic curve cryptosystems

Efficient and low0complexity hardware architecture of Gaussian normal basis multiplication over GF (2 m ) for elliptic curve cryptosystems
-

Article type
Journal
https://people.iut.ac.ir/en/sayedi/content/1615210