Effective compression maps for torus-based cryptography

DOI10.1007/S10623-014-0031-9MaRDI QIDQ264119zbMATH OpenOpenAlexFDO

Authors Andrea Montanari

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

zbMATH Keywords

algebraic toribirational mapsCEILIDHdiscrete logarithm problem (DLP)Hermitian curvespairing-based cryptographySinger arcXTR

Mathematics Subject Classification ID

Cryptography (94A60) Rational and birational maps (14E05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Compression in Finite Fields and Torus-Based Cryptography
• Practical Cryptography in High Dimensional Tori
• scientific article; zbMATH DE number 2154291
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology – CRYPTO 2004

Cites work

• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 15968 (Why is no real title available?)
• scientific article; zbMATH DE number 1204077 (Why is no real title available?)
• scientific article; zbMATH DE number 1024052 (Why is no real title available?)
• scientific article; zbMATH DE number 1024494 (Why is no real title available?)
• scientific article; zbMATH DE number 1979293 (Why is no real title available?)
• scientific article; zbMATH DE number 1504559 (Why is no real title available?)
• scientific article; zbMATH DE number 1759768 (Why is no real title available?)
• scientific article; zbMATH DE number 2154291 (Why is no real title available?)
• scientific article; zbMATH DE number 785453 (Why is no real title available?)
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
• A taxonomy of pairing-friendly elliptic curves
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology – CRYPTO 2004
• Algorithmic Number Theory
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
• Compression in Finite Fields and Torus-Based Cryptography
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Factor-4 and 6 compression of cyclotomic subgroups of \(\mathbb F^*_{2^{4m}}\) and \(\mathbb F^*_{3^{6m}}\)
• Faster explicit formulas for computing pairings over ordinary curves
• Looking beyond XTR
• Monte Carlo Methods for Index Computation (mod p)
• On Compressible Pairings and Their Computation
• On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
• On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
• Pairing-Friendly Elliptic Curves of Prime Order
• Practical Cryptography in High Dimensional Tori
• Public-key cryptosystems based on cubic finite field extensions
• Torus-Based Compression by Factor 4 and 6
• Unital intersections in finite projective planes
• Unitals in projective planes

Cited in

(3)

• Torus-Based Compression by Factor 4 and 6
• Practical Cryptography in High Dimensional Tori
• Compression in Finite Fields and Torus-Based Cryptography

This page was built for publication: Effective compression maps for torus-based cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264119)