An algorithm for modular exponentiation.

DOI10.1016/S0020-0190(98)00044-1zbMATH Open1078.94510OpenAlexW2042037294MaRDI QIDQ2583553FDOQ2583553

Authors: Graham A. Jullien, W. C. Miller, Vassil S. Dimitrov 

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00044-1

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

zbMATH Keywords

CryptographyComputer arithmeticNumber theoryModular exponentiations

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Title not available (Why is that?)
• Efficient signature generation by smart cards
• Processor-efficient exponentiation in finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An interactive identification scheme based on discrete logarithms and factoring

Cited In (24)

• Should one always use repeated squaring for modular exponentiation?
• A Graph Theoretic Analysis of Double Base Number Systems
• On the minimal Hamming weight of a multi-base representation
• The double-base number system and its application to elliptic curve cryptography
• Algorithm design and theoretical analysis of a novel CMM modular exponentiation algorithm for large integers
• Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System
• High-radix and bit recoding techniques for modular exponentiation
• Improved batch exponentiation
• Delegating a product of group exponentiations with application to signature schemes
• Multibase scalar multiplications in cryptographic pairings
• On representations of positive integers
• Sublinear scalar multiplication on hyperelliptic Koblitz curves
• Lower bounds on the lengths of double-base representations
• How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
• Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
• Double-Base Number System for Multi-scalar Multiplications
• Bounds and trade-offs for double-base number systems
• Efficient scalar multiplication on Koblitz curves with pre-computation
• Representation of positive integers by summands of a certain form
• Hard problems in elliptic curve scalar multiplication
• Algebraic independence of certain almost polyadic series
• Representations of positive integers
• Representations of positive integers in DBNS
• A Tree-Based Approach for Computing Double-Base Chains

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)