Efficient identity based parameter selection for elliptic curve cryptosystems

DOI10.1007/3-540-48970-3_24MaRDI QIDQ4250648zbMATH OpenFDO

Authors Arjen K. Lenstra

Publication date 17 June 1999

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

Full work available at URL https://doi.org/10.1007/3-540-48970-3_24

zbMATH Keywords

elliptic curve cryptosystemWeierstraß equation

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Cryptography (94A60)

Recommendations

• Elliptic curves over \(\mathbb{F}_ p\) suitable for cryptosystems
• Elliptic Curve Cryptosystems
• Hyperelliptic curves with compact parameters
• Efficient implementation of Schoof's algorithm in case of characteristic 2

Cited in

(2)

• Efficient ephemeral elliptic curve cryptographic keys
• Parameters for secure elliptic curve cryptosystem -- improvements on Schoof's algorithm

This page was built for publication: Efficient identity based parameter selection for elliptic curve cryptosystems

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