Searching for differential addition chains

DOI10.1007/S40993-024-00604-8MaRDI QIDQ7000271zbMATH OpenFDO

Authors Daniel J. Bernstein, Jolijn Cottaar, Tanja Lange

Publication date 8 April 2025

Published in Research in Number Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S40993-024-00604-8

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cites work

• Addition chains, vector chains, and efficient computation
• Analysis of the subtractive algorithm for greatest common divisors
• Calculating optimal addition chains
• Efficient Generation of Minimal Length Addition Chains
• Fast computation of continued fraction expansions.
• Faster Addition and Doubling on Elliptic Curves
• scientific article; zbMATH DE number 1842492 (Why is no real title available?)
• Integer multiplication in time \(O(n\log n)\)
• Parallel collision search with cryptanalytic applications
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• SQISign: compact post-quantum signatures from quaternions and isogenies
• SQIsignHD: new dimensions in cryptography
• Stronger and faster side-channel protections for CSIDH
• Twisted Edwards Curves Revisited

Cited in

(1)

• Hardened CTIDH: dummy-free and deterministic CTIDH

This page was built for publication: Searching for differential addition chains

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