Optimal Recoding of
Binary Numbers for Cryptographic and Arithmetic Operations
Please note: All items are copyrighted either
by the author or the publisher.
- "The Alternating Greedy Expansion
and Applications to Computing Digit Expansions from Left-to-Right
in Cryptography", to appear in Theoretical Computer Science.
- "Left-to-Right Optimal Signed-Binary
Representation of a Pair of integers," IEEE Transactions
on Computers, Vol. 54, No. 2, pp. 132-140, February. 2005.
- "On the Signed-Binary Window Method",
accepted by 2005 IEEE International Symposium on Circuits and
Systems, May 23-26, 2005, Kobe, Japan.
- "Signed Binary Addition Circuitry Based on Two-Bit Encoding
Schemes", in proceedings of 2004 International Symposium
on Integrated Circuits, Devices and Systems, pp. 21 - 24, September
8-10, 2004, Singapore.
- "Low-Weight Left-to-Right Binary
Signed Digit Representation of $N$ Integers", in proceedings
of 2004 IEEE International Symposium on Information Theory, pp.
548, June 27-July 2, 2004, Chicago, IL.
- "Left-to-Right Binary Signed-Digit
Recoding for Elliptic Curve Cryptography", in proceedings
of 2004 IEEE International Symposium on Circuits and Systems,
Volume: 2, pp. 365-368, May 23-26, Vancouver, Canada.