Square always exponentiation

DOI10.1007/978-3-642-25578-6_5MaRDI QIDQ3104721zbMATH OpenOpenAlexFDO

Authors Christophe Clavier, Benoit Feix, Georges Gagnerot, Mylène Roussellet, Vincent Verneuil

Publication date 16 December 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-25578-6_5

zbMATH Keywords

atomicityexponentiationlong integer arithmeticPublic key cryptographyside-channel analysis

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Cryptography (94A60)

Recommendations

• Linear systolic multiplier/squarer for fast exponentiation
• On Repeated Squarings in Binary Fields
• A low-complexity LUT-based squaring algorithm
• scientific article; zbMATH DE number 1617927
• Distinguishing Multiplications from Squaring Operations

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• Checking before output may not be enough against fault-based cryptanalysis
• Combined implementation attack resistant exponentiation
• Distinguishing Multiplications from Squaring Operations
• scientific article; zbMATH DE number 1979291 (Why is no real title available?)
• scientific article; zbMATH DE number 1504818 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• scientific article; zbMATH DE number 1418307 (Why is no real title available?)
• Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
• New directions in cryptography
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The doubling attack -- why upwards is better than downwards.
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems

Cited in

(7)

• Recovering secrets from prefix-dependent leakage
• Multi-precision squaring for public-key cryptography on embedded microprocessors
• Combined attack on CRT-RSA. Why public verification must not be public?
• Simple power analysis attack on SQIsign
• The distributions of individual bits in the output of multiplicative operations
• Integer squarers with overflow detection
• A low-complexity LUT-based squaring algorithm

This page was built for publication: Square always exponentiation

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