Finding composite order ordinary elliptic curves using the Cocks-Pinch method

DOI10.1016/j.jnt.2010.05.001zbMath1217.11061OpenAlexW1998927873WikidataQ116216023 ScholiaQ116216023MaRDI QIDQ2430983

Dan Boneh, Alice Silverberg, Karl Rubin

Publication date: 8 April 2011

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2010.05.001

zbMATH Keywords

elliptic curvespairing-based cryptographycomposite order groups

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over global fields (11G05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (8)

Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions ⋮ Spreading alerts quietly and the subgroup escape problem ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Heuristics of the Cocks-Pinch method ⋮ Anonymous spatial encryption under affine space delegation functionality with full security ⋮ Heuristics on pairing-friendly elliptic curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2

Uses Software

• ECPP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Building curves with arbitrary small MOV degree over finite prime fields
• The Weil pairing, and its efficient calculation
• A taxonomy of pairing-friendly elliptic curves
• Elliptic curves suitable for pairing based cryptography
• Computing Hilbert class polynomials with the Chinese remainder theorem
• Elliptic Curves and Primality Proving
• Perfect Non-interactive Zero Knowledge for NP
• Compact Group Signatures Without Random Oracles
• Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Elliptic Curve Cryptosystems
• Building Cyclic Elliptic Curves Modulo Large Primes
• Pairing-Friendly Elliptic Curves of Prime Order
• Ring Signatures of Sub-linear Size Without Random Oracles
• Private Searching on Streaming Data
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Advances in Elliptic Curve Cryptography
• Theory of Cryptography
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures
• Efficient Ring Signatures Without Random Oracles
• Cryptography and Coding
• Algorithmic Number Theory

This page was built for publication: Finding composite order ordinary elliptic curves using the Cocks-Pinch method