An algorithm for modular exponentiation.
From MaRDI portal
Publication:2583553
Recommendations
- Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers
- scientific article; zbMATH DE number 1946644
- A high performance ROM-based structure for modular exponentiation
- Fast exponentiation by folding the signed-digit exponent in half
- Fast modular multi-exponentiation using modified complex arithmetic
Cites work
- scientific article; zbMATH DE number 44151 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 503339 (Why is no real title available?)
- scientific article; zbMATH DE number 3443726 (Why is no real title available?)
- scientific article; zbMATH DE number 780072 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3040053 (Why is no real title available?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An interactive identification scheme based on discrete logarithms and factoring
- Efficient signature generation by smart cards
- Processor-efficient exponentiation in finite fields
Cited in
(24)- Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
- Lower bounds on the lengths of double-base representations
- On the minimal Hamming weight of a multi-base representation
- Double-Base Number System for Multi-scalar Multiplications
- Sublinear scalar multiplication on hyperelliptic Koblitz curves
- Bounds and trade-offs for double-base number systems
- Delegating a product of group exponentiations with application to signature schemes
- Representation of positive integers by summands of a certain form
- The double-base number system and its application to elliptic curve cryptography
- Representations of positive integers in DBNS
- Multibase scalar multiplications in cryptographic pairings
- Efficient scalar multiplication on Koblitz curves with pre-computation
- Hard problems in elliptic curve scalar multiplication
- How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
- High-radix and bit recoding techniques for modular exponentiation
- Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System
- On representations of positive integers
- A Tree-Based Approach for Computing Double-Base Chains
- Representations of positive integers
- Should one always use repeated squaring for modular exponentiation?
- Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers
- A Graph Theoretic Analysis of Double Base Number Systems
- Improved batch exponentiation
- Algebraic independence of certain almost polyadic series
This page was built for publication: An algorithm for modular exponentiation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583553)