Four $$\mathbb {Q}$$ : Four-Dimensional Decompositions on a $$\mathbb {Q}$$ -curve over the Mersenne Prime

DOI10.1007/978-3-662-48797-6_10zbMath1396.94070OpenAlexW2306397823MaRDI QIDQ2811132

Patrick Longa, Craig Costello

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_10

Mathematics Subject Classification ID

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

Related Items (12)

Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves ⋮ Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography ⋮ The complete cost of cofactor \(h=1\) ⋮ Efficient and Provable White-Box Primitives ⋮ Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation ⋮ How to (pre-)compute a ladder -- improving the performance of X25519 and X448 ⋮ New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions ⋮ Kummer for genus one over prime-order fields ⋮ Koblitz curves over quadratic fields ⋮ Efficient arithmetic in (pseudo-)Mersenne prime order fields

This page was built for publication: Four $$\mathbb {Q}$$ : Four-Dimensional Decompositions on a $$\mathbb {Q}$$ -curve over the Mersenne Prime