Heuristics of the Cocks-Pinch method
From MaRDI portal
Publication:2437964
DOI10.3934/amc.2014.8.103zbMath1291.14050arXiv1211.0971OpenAlexW2963218589MaRDI QIDQ2437964
Publication date: 10 March 2014
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.0971
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52) Curves over finite and local fields (11G20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elliptic curves with low embedding degree
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Short signatures from the Weil pairing
- The Weil pairing, and its efficient calculation
- A taxonomy of pairing-friendly elliptic curves
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Computing Hilbert class polynomials with the Chinese remainder theorem
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- Roots of unity and nullity modulo $n$
- Average prime-pair counting formula
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Heuristics on pairing-friendly elliptic curves
- Identity-Based Encryption from the Weil Pairing
- Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
- On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves
- Pairing-Friendly Elliptic Curves of Prime Order
- Advances in Elliptic Curve Cryptography
- Theory of Cryptography
- Cryptography and Coding
This page was built for publication: Heuristics of the Cocks-Pinch method
