Fast Exponentiation Using Data Compression

DOI10.1137/S0097539792234974MaRDI QIDQ4210171zbMATH OpenFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 503339 (Why is no real title available?)
• scientific article; zbMATH DE number 503358 (Why is no real title available?)
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Computing Sequences with Addition Chains
• On the Complexity of Finite Sequences
• Remarks on number theory III. On addition chains

Cited in

(1)

• Fast exponentials

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210171)