Effective compression maps for torus-based cryptography
From MaRDI portal
Publication:264119
DOI10.1007/s10623-014-0031-9zbMath1403.94072OpenAlexW2052090186MaRDI QIDQ264119
Publication date: 5 April 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-0031-9
algebraic toribirational mapsCEILIDHdiscrete logarithm problem (DLP)Hermitian curvespairing-based cryptographySinger arcXTR
Cryptography (94A60) Rational and birational maps (14E05) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Unital intersections in finite projective planes
- A taxonomy of pairing-friendly elliptic curves
- On the Function Field Sieve and the Impact of Higher Splitting Probabilities
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves
- On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
- On Compressible Pairings and Their Computation
- Compression in Finite Fields and Torus-Based Cryptography
- Factor-4 and 6 compression of cyclotomic subgroups of and
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- Looking beyond XTR
- Public-key cryptosystems based on cubic finite field extensions
- Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
- Torus-Based Compression by Factor 4 and 6
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Advances in Cryptology – CRYPTO 2004
- Practical Cryptography in High Dimensional Tori
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Pairing-Friendly Elliptic Curves of Prime Order
- Advances in Cryptology - CRYPTO 2003
- Algorithmic Number Theory
This page was built for publication: Effective compression maps for torus-based cryptography
