A study of polynomial residue number systems over binary Galois fields GF(2m) for cryptography
This thesis is concerned with GF(2m) Polynomial Residue Number Systems (PRNS) and their application in cryptography to provide resistance against side-channel- analysis and protection against fault attacks. PRNS operations over GF(2m) required in a number of cryptography primitives are investigated....
| Main Author: | |
|---|---|
| Published: |
University of Sheffield
2012
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575415 |