An Algorithmic Construction of Finite Elliptic Curves of Order Divisible by a Large Prime

DOI10.3233/FI-2015-1161zbMath1394.11053OpenAlexW1647710932MaRDI QIDQ2805409

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) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20)

Related Items (2)

A variant of the large sieve inequality with explicit constants ⋮ 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