Unified field multiplier for GF(p) and GF(2 n) with novel digit encoding
In recent years, there has been an increase in demand for unified field multipliers for Elliptic Curve Cryptography in the electronics industry because they provide flexibility for customers to choose between Prime (GF(p)) and Binary (GF(2")) Galois Fields. Also, having the ability to carry out...
| Main Author: | |
|---|---|
| Published: |
Cardiff University
2004
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.583500 |