Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves

DOI10.1109/TC.2011.78MaRDI QIDQ5277605zbMATH OpenFDO

Authors Junfeng Fan, Frederik Vercauteren, Ingrid Verbauwhede

Publication date 12 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2011.78

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04) Data encryption (aspects in computer science) (68P25)

Cited in

(2)

• Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$
• Pseudo 8–Sparse Multiplication for Efficient Ate–Based Pairing on Barreto–Naehrig Curve

This page was built for publication: Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277605)