Pages that link to "Item:Q3417024"
From MaRDI portal
The following pages link to Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity (Q3417024):
Displaying 25 items.
- First-order side channel attacks on Zhang's countermeasures (Q433061) (← links)
- Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis (Q497571) (← links)
- Efficient elliptic curve scalar multiplication algorithms resistant to power analysis (Q881859) (← links)
- Horizontal collision correlation attack on elliptic curves (Q892284) (← links)
- Constructive and destructive use of compilers in elliptic curve cryptography (Q1015356) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Double-base chains for scalar multiplications on elliptic curves (Q2055666) (← links)
- Full key recovery side-channel attack against ephemeral SIKE on the cortex-M4 (Q2145305) (← links)
- Speeding up regular elliptic curve scalar multiplication without precomputation (Q2210646) (← links)
- Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace (Q2790057) (← links)
- On the Use of RSA Public Exponent to Improve Implementation Efficiency and Side-Channel Resistance (Q2794567) (← links)
- Improving the Big Mac Attack on Elliptic Curve Cryptography (Q2803645) (← links)
- Safe-Errors on SPA Protected Implementations with the Atomicity Technique (Q2803660) (← links)
- A secure exponentiation algorithm resistant to a combined attack on RSA implementation (Q2804883) (← links)
- An Elliptic Curve Cryptographic Processor Using Edwards Curves and the Number Theoretic Transform (Q2947104) (← links)
- Square Always Exponentiation (Q3104721) (← links)
- Generic Cryptanalysis of Combined Countermeasures with Randomized BSD Representations (Q3452232) (← links)
- Fast Point Multiplication on Elliptic Curves without Precomputation (Q3519550) (← links)
- Securing RSA against Fault Analysis by Double Addition Chain Exponentiation (Q3623066) (← links)
- Random Order m-ary Exponentiation (Q3634511) (← links)
- Exponent Recoding and Regular Exponentiation Algorithms (Q3637149) (← links)
- Distinguishing Multiplications from Squaring Operations (Q3644212) (← links)
- Faster Addition and Doubling on Elliptic Curves (Q5387091) (← links)
- The double-base number system and its application to elliptic curve cryptography (Q5444319) (← links)
- A fast and SPA secure scalar multiplication for elliptic curve cryptography (Q6550487) (← links)
