Efficient implementation of Schoof's algorithm in case of characteristic 2

DOI10.1007/978-3-540-46588-1_15MaRDI QIDQ4950046zbMATH OpenFDO

Authors Tetsuya Izu, Jun Kogure, Kazuhiro Yokoyama

Publication date 2 October 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-46588-1_15

zbMATH Keywords

elliptic curve cryptosystemsICSimplementationintelligent choice systemSchoof's algorithmSchoof-Elkies-Atkin algorithm

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• Efficient implementation of Schoof's algorithm
• scientific article; zbMATH DE number 503248
• Schoof's point counting algorithm
• scientific article; zbMATH DE number 1273657

Cited in

(2)

• Efficient implementation of Schoof's algorithm
• Efficient identity based parameter selection for elliptic curve cryptosystems

This page was built for publication: Efficient implementation of Schoof's algorithm in case of characteristic 2

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