An analysis of exponentiation based on formal languages

DOI10.1007/3-540-48910-X_26MaRDI QIDQ4250774zbMATH OpenFDO

Authors Luke O'Connor

Publication date 17 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48910-X_26

zbMATH Keywords

optimal signed-digit exponentiation algorithmsrecoding rule for exponentiationregular languagessliding windowweight distributions

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Exponent Recoding and Regular Exponentiation Algorithms
• Analysis of sliding window techniques for exponentiation
• On string replacement exponentiation
• scientific article; zbMATH DE number 2162686

Cited in

(5)

• Signed bits and fast exponentiation
• Analysis of sliding window techniques for exponentiation
• On recoding in arithmetic algorithms
• scientific article; zbMATH DE number 2162686 (Why is no real title available?)
• Fundamentals of Computation Theory

This page was built for publication: An analysis of exponentiation based on formal languages

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