
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Braden Phillips, Neil Burgess, "Minimal Weight Digit Set Conversions," IEEE Transactions on Computers, vol. 53, no. 6, pp. 666677, June, 2004.  
BibTex  x  
@article{ 10.1109/TC.2004.14, author = {Braden Phillips and Neil Burgess}, title = {Minimal Weight Digit Set Conversions}, journal ={IEEE Transactions on Computers}, volume = {53}, number = {6}, issn = {00189340}, year = {2004}, pages = {666677}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.14}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Minimal Weight Digit Set Conversions IS  6 SN  00189340 SP666 EP677 EPD  666677 A1  Braden Phillips, A1  Neil Burgess, PY  2004 KW  Digital arithmetic KW  redundant number systems KW  digit set conversion. VL  53 JA  IEEE Transactions on Computers ER   
Abstract—This paper considers the problem of recoding a number to minimize the number of nonzero digits in its representation, that is, to minimize the weight of the representation. A general sliding window scheme is described that extends minimal binary sliding window conversion to arbitrary radix and to encompass signed digit sets. This new conversion expresses a number of known recoding techniques as special cases. Proof that this scheme achieves minimal weight for a given digit set is provided and results concerning the theoretical average and worstcase weight are derived.
[1] B.J. Phillips and N. Burgess, Implementing 1,024bit RSA Exponentiation on a 32Bit Processor Core Proc. 2000 Int'l Conf. Application Specific Systems, Architectures, and Processors, pp. 127137, 2000.
[2] R. Bernstein, Multiplication by Integer Constants Software Practice and Experience, vol. 16, no. 7, pp. 641652, 1986.
[3] J. Jedwab and C.J. Mitchell, Minimum Weight Modified SignedDigit Representations and Fast Exponentiation Electronics Letters, vol. 25, no. 17, pp. 11711172, 1989.
[4] Y. Yacobi, Exponentiating Faster with Addition Chains Proc. Advances in Cryptology (EUROCRYPT '90), pp. 222229, 1991.
[5] C.K. Koc, HighRadix and Bbit Recoding Techniques for Modular Exponentiation Int'l J. Computer Math., vol. 40, nos. 34, pp. 139156, 1991.
[6] C.N. Zhang, An Improved Binary Algorithm for RSA Computers and Math. with Applications, vol. 25, no. 6, pp. 1524, 1993.
[7] L.C.K. Hui and K.Y. Lam, Fast SquareandMultiply Exponentiation for RSA Electronics Letters, vol. 30, no. 17, pp. 13961397, 1994.
[8] V. Dimitrov and T. Cooklev, Two Algorithms for Modular Exponentiation Using Nonstandard Arithmetics IEICE Trans. Fundamentals of Electronics, Comm., and Computer Sciences, vol. E78A, no. 1, pp. 8287, 1995.
[9] C.Y. Chen, C.C. Chang, and W.P. Yang, “Hybrid Method for Modular Exponentiation with Precomputations,” IEE Electronics Letters, vol. 32, no. 6, pp. 540541, 1996.
[10] B.J. Phillips and N. Burgess, Signed Sliding Window Algorithms for Modulo Multiplication Electronics Letters, vol. 36, no. 23, pp. 19251927, 2000.
[11] B. Phillips, Optimised Squaring of Long Integers Using Precomputed Partial Products Proc. 15th IEEE Symp. Computer Arithmetic (ARITH15), pp. 7379, 2001.
[12] A.D. Booth, A Signed Binary Multiplication Technique Quarterly J. Mechanics and Applied Math., vol. 4, pp. 236240, 1951.
[13] C. Ghest, Multiplication Made Easy for Digital Assemblies Electronics Letters, vol. 44, pp. 5661, 1971.
[14] O.L. MacSorley, HighSpeed Arithmetic in Binary Computers Proc. IRE, vol. 49, pp. 91103, 1961.
[15] K. Hwang, Computer Arithmetic Principles. Wiley, 1979.
[16] J.A. Starzyk and V.S.R. Dandu, Overlapped MultiBit Scanning Multiplier Proc. IEEE Int'l Conf. ComputerDesign (ICCD '85), 1985.
[17] S. Vassiliadis, E.M. Schwarz, and D.J. Hanrahan, "A General Proof for Overlapped MultipleBit Scanning Multiplications," IEEE Trans. Computers, vol. 38, no. 2, pp. 172183, Feb. 1989.
[18] H. Sam and A. Gupta, “A Generalized Multibit Recoding of Two's Complement Binary Numbers and Its Proof with Application in Multiplier Implementations,” IEEE Trans. Computers, vol. 39, no. 8, pp. 1,0061,015, Aug. 1990.
[19] B.J. Phillips, An Optimised Implementation of PublicKey Cryptography for a SmartCard Processor PhD thesis, Univ. of Adelaide, 2000.
[20] C.K. Koc and C. Hung, Adaptive mAry Segmentation and Canonical Recoding Algorithms for Multiplication of Large Binary Integers Computers and Math. with Applications, vol. 24, no. 3, pp. 312, 1992.
[21] J.A. Solinas, An Improved Algorithm for Arithmetic on a Family of Elliptic Curves Proc. Advances in Cryptology (CRYPTO '97), pp. 35673571, 1997.
[22] G.W. Reitwiener, Binary Arithmetic Advances in Computers, vol. 1, pp. 261265, 1960.
[23] S. Arno and F.S. Wheeler, Signed Digit Representations of Minimal Hamming Weight IEEE Trans. Computers, vol. 42, no. 8, pp. 10071010, Aug. 1993.
[24] L. O'Connor, An Analysis of Exponentiation Basedon Formal Languages Proc. Advances in Cryptology (EUROCRYPT '99), pp. 375388, 1999.
[25] W.E. Clark and J.J. Liang, On Arithmetic Weight for a General Radix Representation of Integers IEEE Trans. Information Theory, vol. 19, no. 6, pp. 823826, 1973.
[26] H. Cohen and A.K. Lenstra, Implementation of a New Primality Test Math. Computation, vol. 48, no. 177, pp. 103121, 1987.
[27] J. Bos and M. Coster, Addition Chain Heuristics Proc. Advances in Cryptology (CRYPTO '89), pp. 400407, 1990.
[28] D. Gollmann, H. Yongfei, and C.J. Mitchell, Redundant Integer Representations and Fast Exponentiation Designs, Codes, and Cryptography, vol. 7, nos. 12, pp. 135151, 1996.
[29] K.Y. Lam and L.C.K. Hui, Efficiency of${SS}(l)$SquareandMultiply Exponentiation Algorithms Electronics Letters, vol. 30, no. 25, pp. 21152116, 1994.
[30] L.J. O'Connor, On String Replacement Exponentiation Designs, Codes, and Cryptography, vol. 23, no. 2, pp. 173183, 2001.
[31] D.E. Knuth, The Art of Computer Programming, Volume 2, Seminumerical Algorithms. AddisonWesley, 1997.
[32] P. Kornerup, “DigitSet Conversions: Generalizations and Applications,” IEEE Trans. Computers, vol. 43, pp. 622629, 1994.
[33] H. Freeman, Calculation of Mean Shift for a Binary Multiplier Using 2, 3, or 4 Bits at a Time IEEE Trans. Electronic Computers, vol. 16, no. 6, pp. 864866, 1967.