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

DOI10.3233/FI-2015-1161zbMATH Open1394.11053OpenAlexW1647710932MaRDI QIDQ2805409FDOQ2805409

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)

Cited In (6)

• Building Cyclic Elliptic Curves Modulo Large Primes
• Finding composite order ordinary elliptic curves using the Cocks-Pinch method
• A variant of the large sieve inequality with explicit constants
• Title not available (Why is that?)
• On the efficient generation of prime-order elliptic curves
• EXPLICIT ZERO-COUNTING THEOREM FOR HECKE–LANDAU ZETA-FUNCTIONS

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)