scientific article; zbMATH DE number 1979291
From MaRDI portal
zbMath1020.11500MaRDI QIDQ4425714
Publication date: 11 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2523/25230291.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
fault attacksside-channel attacksexponentiation algorithmsMontgomery powering ladderconstrained environmentscryptographic implementations
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items
Memory-saving computation of the pairing final exponentiation on BN curves, Curve448 on 32-bit ARM Cortex-M4, Key Bit-Dependent Attack on Protected PKC Using a Single Trace, On the worst-case side-channel security of ECC point randomization in embedded devices, Safe-error attacks on SIKE and CSIDH, Trade-Off Approaches for Leak Resistant Modular Arithmetic in RNS, Efficient elliptic curve scalar multiplication algorithms resistant to power analysis, The distributions of individual bits in the output of multiplicative operations, New fault attacks using Jacobi symbol and application to regular right-to-left algorithms, T_SM: Elliptic Curve Scalar Multiplication Algorithm Secure Against Single-Trace Attacks, A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding, Lattice attacks against elliptic-curve signatures with blinded scalar multiplication, Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography, Speeding up regular elliptic curve scalar multiplication without precomputation, Fault-based attack on Montgomery's ladder algorithm, Faster Addition and Doubling on Elliptic Curves, Arithmetic of Split Kummer Surfaces: Montgomery Endomorphism of Edwards Products, Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation, Combined Attack on CRT-RSA, Twisted Edwards Curves Revisited, Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace, On the Use of RSA Public Exponent to Improve Implementation Efficiency and Side-Channel Resistance, Square Always Exponentiation, Thwarting side-channel analysis against RSA cryptosystems with additive blinding
