Four Q: four-dimensional decompositions on a Q-curve over the Mersenne prime

DOI10.1007/978-3-662-48797-6_10zbMATH Open1396.94070OpenAlexW2306397823MaRDI QIDQ2811132FDOQ2811132

Authors: Craig Costello, Patrick Longa 

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

Recommendations

• Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
• Four\(\mathbb {Q}\) on FPGA: new hardware speed records for elliptic curve cryptography over large prime characteristic fields
• Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
• Faster ECC over \(\mathbb {F}_{2^{521}-1}\)
• Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors

Mathematics Subject Classification ID

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

Cited In (17)

• Kummer for genus one over prime-order fields
• Koblitz curves over quadratic fields
• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• How to (pre-)compute a ladder -- improving the performance of X25519 and X448
• Faster ECC over \(\mathbb {F}_{2^{521}-1}\)
• High-performance implementation of elliptic curve cryptography using vector instructions
• Fast endomorphisms in integer sub-decomposition method on Secp192k1
• Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography
• Fast public-key silent OT and more from constrained Naor-Reingold
• Efficient and Provable White-Box Primitives
• Binary Kummer line
• The complete cost of cofactor \(h=1\)
• Speeding up regular elliptic curve scalar multiplication without precomputation
• Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
• Four\(\mathbb {Q}\) on FPGA: new hardware speed records for elliptic curve cryptography over large prime characteristic fields
• Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors
• 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

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