Exponentiation using canonical recoding
- 4 July 1994
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 129 (2) , 407-417
- https://doi.org/10.1016/0304-3975(94)90037-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Computer Arithmetic AlgorithmsPublished by Taylor & Francis ,2018
- A high-radix hardware algorithm for calculating the exponential M/sup E/ modulo NPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- CM-Curves with Good Cryptographic PropertiesPublished by Springer Nature ,2001
- High-radix and bit recoding techniques for modular exponentiationInternational Journal of Computer Mathematics, 1991
- Speeding up the computations on an elliptic curve using addition-subtraction chainsRAIRO - Theoretical Informatics and Applications, 1990
- Minimum weight modified signed-digit representations and fast exponentiationElectronics Letters, 1989
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- High-Speed Arithmetic in Binary ComputersProceedings of the IRE, 1961
- Binary ArithmeticPublished by Elsevier ,1960
- A SIGNED BINARY MULTIPLICATION TECHNIQUEThe Quarterly Journal of Mechanics and Applied Mathematics, 1951