Exponent Recoding and Regular Exponentiation Algorithms
From MaRDI portal
Publication:3637149
Recommendations
- scientific article; zbMATH DE number 2085203
- Algorithms for exponentiation in finite fields
- An Algorithm for Computing Optimal Exponent Pairs
- The complexity of computing exponents
- Efficient implementation of algorithms for approximate exponentiation
- Redundant integer representations and fast exponentiation
- Efficient algorithms for remainder computation and exponentiation of long numbers
- A Survey of Fast Exponentiation Methods
- Aspects of algebraic exponentiation
Cites work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 1941255 (Why is no real title available?)
- scientific article; zbMATH DE number 1962161 (Why is no real title available?)
- scientific article; zbMATH DE number 2044541 (Why is no real title available?)
- scientific article; zbMATH DE number 1504818 (Why is no real title available?)
- scientific article; zbMATH DE number 1759669 (Why is no real title available?)
- scientific article; zbMATH DE number 1857508 (Why is no real title available?)
- scientific article; zbMATH DE number 1882022 (Why is no real title available?)
- scientific article; zbMATH DE number 1878336 (Why is no real title available?)
- scientific article; zbMATH DE number 1418307 (Why is no real title available?)
- A Survey of Fast Exponentiation Methods
- A more flexible countermeasure against side channel attacks using window method.
- Applied Cryptography and Network Security
- Checking before output may not be enough against fault-based cryptanalysis
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Distinguishing Multiplications from Squaring Operations
- Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
- Information Security Practice and Experience
- Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
- Power Analysis Attacks
- Power analysis to ECC using differential power between multiplication and squaring
- Progress in Cryptology – Mycrypt 2005
- SPA Resistant Left-to-Right Integer Recodings
- The doubling attack -- why upwards is better than downwards.
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
Cited in
(15)- An Algorithm for Computing Optimal Exponent Pairs
- Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm
- Koblitz curves over quadratic fields
- scientific article; zbMATH DE number 1882023 (Why is no real title available?)
- Improvement on Ha-Moon Randomized Exponentiation Algorithm
- A fast parallel modular exponentiation algorithm
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
- 2DT-GLS: faster and exception-free scalar multiplication in the GLS254 binary curve
- Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography
- Small scalar multiplication on Weierstrass curves using division polynomials
- Speeding up regular elliptic curve scalar multiplication without precomputation
- A duality in space usage between left-to-right and right-to-left exponentiation
- Code Offset in the Exponent.
- Exploiting collisions in addition chain-based exponentiation algorithms using a single trace
This page was built for publication: Exponent Recoding and Regular Exponentiation Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637149)
