Algorithmic Number Theory

DOI10.1007/11792086zbMath1143.14302arXivmath/0601487OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899268

No author found.

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0601487

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (23)

Faster Hashing to ${\mathbb G}_2$ ⋮ Efficient hash maps to \(\mathbb{G}_2\) on BLS curves ⋮ Generating pairing-friendly elliptic curve parameters using sparse families ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree ⋮ Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ Finding composite order ordinary elliptic curves using the Cocks-Pinch method ⋮ Efficient selective identity-based encryption without random oracles ⋮ Efficient Multiplication in Finite Field Extensions of Degree 5 ⋮ An efficient ring signature scheme from pairings ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field ⋮ Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction ⋮ Computing Hilbert class polynomials with the Chinese remainder theorem ⋮ Generating Pairing-Friendly Curves with the CM Equation of Degree 1 ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Fast Hashing to G 2 on Pairing-Friendly Curves ⋮ On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant ⋮ Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case ⋮ TNFS resistant families of pairing-friendly elliptic curves

This page was built for publication: Algorithmic Number Theory