Fast Exponentiation Using Data Compression

DOI10.1137/S0097539792234974zbMATH Open0914.68061MaRDI QIDQ4210171FDOQ4210171

Yacov Yacobi

Publication date: 21 September 1998

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

Recommendations

• scientific article
• scientific article; zbMATH DE number 1057744
• scientific article
• scientific article; zbMATH DE number 2162686

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

• Compression of individual sequences via variable-rate coding
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Remarks on number theory III. On addition chains
• Title not available (Why is that?)
• Computing Sequences with Addition Chains
• Title not available (Why is that?)

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)