Abstract
Polynomial basis hardware architectures are described for the mathematical operations required in pairing based cryptosystems in characteristic p = 3. In hardware, arithmetic operations in extension fields of GF(3m) can be parallelised, and this results in high performance dedicated processors for efficient Tate pairing calculation. The implementation aspects of two such hardware processors are discussed through prototyping over GF(397) on the Xilinx Virtex2 and Virtex2Pro FPGA technologies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.