Fast Exponentiation Using Data Compression

DOI10.1137/S0097539792234974zbMath0914.68061MaRDI QIDQ4210171

Yacov Yacobi

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

cryptographycompressionfast exponentiationdiscrete-log

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing Sequences with Addition Chains
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Remarks on number theory III. On addition chains

This page was built for publication: Fast Exponentiation Using Data Compression