An algorithm for modular exponentiation.

From MaRDI portal
Publication:2583553

DOI10.1016/S0020-0190(98)00044-1zbMath1078.94510OpenAlexW2042037294MaRDI QIDQ2583553

W. C. Miller, G. A. Jullien, 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




Related Items (19)

Sublinear Scalar Multiplication on Hyperelliptic Koblitz CurvesMultibase scalar multiplications in cryptographic pairingsUnnamed ItemEfficient scalar multiplication on Koblitz curves with pre-computationA Tree-Based Approach for Computing Double-Base ChainsBounds and trade-offs for double-base number systemsRepresentation of positive integers by summands of a certain formHard problems in elliptic curve scalar multiplicationOn the minimal Hamming weight of a multi-base representationRepresentations of positive integersDelegating a product of group exponentiations with application to signature schemesThe double-base number system and its application to elliptic curve cryptographyО вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координатA Graph Theoretic Analysis of Double Base Number SystemsEfficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number SystemDouble-Base Number System for Multi-scalar MultiplicationsLower bounds on the lengths of double-base representationsПЕРИОДИЧЕСКИЕ И НЕПЕРИОДИЧЕСКИЕ КОНЕЧНЫЕ ПОСЛЕДОВАТЕЛЬНОСТИАрифметические свойства полиадических рядов с периодическими коэффициентами




Cites Work




This page was built for publication: An algorithm for modular exponentiation.