Efficient time-area scalable ECC processor using -coding technique

DOI10.1007/978-3-642-13797-6_18MaRDI QIDQ3578480zbMATH OpenOpenAlexFDO

Authors Mohamed N. Hassan, Mohammed Benaissa

Publication date 20 July 2010

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13797-6_18

zbMATH Keywords

binary finite fieldsElliptic curve cryptographyFPGAMicrocode

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1878342
• scientific article; zbMATH DE number 1941127
• Design and implementation of elliptic curve point multiplication processor over GF\((2^m)\)
• High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\)
• scientific article; zbMATH DE number 1759281

This page was built for publication: Efficient time-area scalable ECC processor using \(\mu\)-coding technique

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