Algorithmic Number Theory
From MaRDI portal
Publication:5899268
DOI10.1007/11792086zbMath1143.14302arXivmath/0601487WikidataQ29400612 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
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11G20: Curves over finite and local fields
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction, On Cycles of Pairing-Friendly Elliptic Curves, An efficient ring signature scheme from pairings, Efficient selective identity-based encryption without random oracles, Generating pairing-friendly elliptic curve parameters using sparse families, Solving discrete logarithms on a 170-bit MNT curve by pairing reduction, Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves, A taxonomy of pairing-friendly elliptic curves, TNFS resistant families of pairing-friendly elliptic curves, Finding composite order ordinary elliptic curves using the Cocks-Pinch method, Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case, Faster Hashing to ${\mathbb G}_2$, Subgroup Security in Pairing-Based Cryptography, Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree, Efficient Multiplication in Finite Field Extensions of Degree 5, Computing Hilbert class polynomials with the Chinese remainder theorem, On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant, 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, Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
