An algorithmic construction of finite elliptic curves of order divisible by a large prime

DOI10.3233/FI-2015-1161MaRDI QIDQ2805409zbMATH OpenOpenAlexFDO

Authors Maciej Grześkowiak

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1161

zbMATH Keywords

public key cryptographyelliptic curves over finite field

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Efficient CM-constructions of elliptic curves over finite fields
• Constructing elliptic curves of prime order
• Construction of elliptic curves over finite fields with a point of given order
• Finding elliptic curves with a subgroup of prescribed size
• scientific article; zbMATH DE number 1878329

Cited in

(12)

• Construction of elliptic curves over finite fields with a point of given order
• Efficient CM-constructions of elliptic curves over finite fields
• Constructing elliptic curves of prime order
• Building Cyclic Elliptic Curves Modulo Large Primes
• Building curves with arbitrary small MOV degree over finite prime fields
• Algorithms for pairing-friendly primes
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method
• A variant of the large sieve inequality with explicit constants
• scientific article; zbMATH DE number 1588468 (Why is no real title available?)
• Finding elliptic curves with a subgroup of prescribed size
• EXPLICIT ZERO-COUNTING THEOREM FOR HECKE–LANDAU ZETA-FUNCTIONS
• On the efficient generation of prime-order elliptic curves

This page was built for publication: An algorithmic construction of finite elliptic curves of order divisible by a large prime

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