Cryptography and Coding

DOI10.1007/11586821MaRDI QIDQ5897525zbMATH OpenOpenAlexFDO

Authors Mustapha Hedabou

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11586821

zbMATH Keywords

\(\tau\)-adic methodElliptic curveFrobenius mapprecomputed tablescalar multiplicationSide Channel Attacks

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Speed-up of SCA attacks on 32-bit multiplications
• Information Security Practice and Experience
• Information Security and Privacy
• Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
• Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
• Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks
• Two Algebraic Attacks Against the F-FCSRs Using the IV Mode

Cited in

(1)

• Information Security Practice and Experience

This page was built for publication: Cryptography and Coding

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