
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jithra Adikari, Vassil S. Dimitrov, Laurent Imbert, "Hybrid BinaryTernary Number System for Elliptic Curve Cryptosystems," IEEE Transactions on Computers, vol. 60, no. 2, pp. 254265, February, 2011.  
BibTex  x  
@article{ 10.1109/TC.2010.138, author = {Jithra Adikari and Vassil S. Dimitrov and Laurent Imbert}, title = {Hybrid BinaryTernary Number System for Elliptic Curve Cryptosystems}, journal ={IEEE Transactions on Computers}, volume = {60}, number = {2}, issn = {00189340}, year = {2011}, pages = {254265}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.138}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Hybrid BinaryTernary Number System for Elliptic Curve Cryptosystems IS  2 SN  00189340 SP254 EP265 EPD  254265 A1  Jithra Adikari, A1  Vassil S. Dimitrov, A1  Laurent Imbert, PY  2011 KW  Elliptic curve cryptography KW  single/double scalar multiplication KW  hybrid binaryternary number system KW  DIK3 curves. VL  60 JA  IEEE Transactions on Computers ER   
[1] N. Koblitz, "Elliptic Curve Cryptosystems," Math. of Computation, vol. 48, pp. 203209, 1987.
[2] V.S. Miller, "Use of Elliptic Curves in Cryptography," Proc. Conf. Advances in Cryptology (CRYPTO' 85), pp. 417426, 1986.
[3] I.F. Blake, G. Seroussi, and N.P. Smart, Elliptic Curves in Cryptography, first ed. Cambridge Univ. Press, 2000.
[4] L.C. Washington, Elliptic Curves: Number Theory and Cryptography, first ed. Chapman & Hall/CRC, May 2003.
[5] H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, and F. Vercauteren, Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman & Hall/CRC, July 2005.
[6] W. Diffie and M. Hellman, "New Directions in Cryptography," IEEE Trans. Information Theory, vol. IT22, no. 6, pp. 644654, Nov. 1976.
[7] R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and PublicKey Cryptosystems," Comm. ACM, vol. 21, pp. 120126, 1978.
[8] A.D. Booth, "A Signed Binary Multiplication Technique," Quarterly J. Mechanics and Applied Math., vol. 4, no. 2, pp. 236240, 1951.
[9] G.W. Reitwiesner, "Binary Arithmetic," Advances in Computers, vol. 1, pp. 231308, Academic Press, 1960.
[10] D.E. Knuth, The Art of Computer Programming Vol. 2: Seminumerical Algorithms, Addsion Weslsey Longman Publishing Group, May 1969.
[11] M. Joye and S.M. Yen, "Optimal LefttoRight Binary SignedDigit Exponent Recoding," IEEE Trans. Computers, vol. 49, no. 7, pp. 740748, July 2000.
[12] D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography. Springer, 2004.
[13] V.S. Dimitrov, L. Imbert, and P.K. Mishra, "Efficient and Secure Elliptic Curve Point Multiplication Using DoubleBase Chains," Proc. Int'l Conf. Theory and Applications of Cryptology and Information Security (ASIACRYPT '05), pp. 5978, 2005.
[14] V.S. Dimitrov, L. Imbert, and P.K. Mishra, "The DoubleBase Number System and Its Application to Elliptic Curve Cryptography," Math. of Computation, vol. 77, no. 262, pp. 10751104, 2008.
[15] C. Doche and L. Imbert, "Extended DoubleBase Number System with Applications to Elliptic Curve Cryptography," Proc. Conf. Progress in Cryptology (INDOCRYPT '06), pp. 335348, Dec. 2006.
[16] F. Morain and J. Olivos, "Speeding Up the Computations on an Elliptic Curve Using AdditionSubtraction Chains," Theoretical Informatics and Applications, vol. 24, pp. 531543, 1990.
[17] H. Cohen, A. Miyaji, and T. Ono, "Efficient Elliptic Curve Exponentiation Using Mixed Coordinates," Proc. Int'l Conf. Theory and Applications of Cryptology and Information Security (ASIACRYPT '98), pp. 5165, 1998.
[18] M. Ciet and F. Sica, "An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm," Proc. Conf. Progress in Cryptology (MYCRYPT '05), pp. 171182, 2005.
[19] R. Avanzi, V.S. Dimitrov, C. Doche, and F. Sica, "Extending Scalar Multiplication Using Double Bases," Proc. Int'l Conf. Theory and Applications of Cryptology and Information Security (ASIACRYPT '06), p. 130, 2006.
[20] N. Méloni and M.A. Hasan, "Elliptic Curve Point Scalar Multiplication Combining Yao's Algorithm and Double Bases," Proc. Workshop Cryptographic Hardware and Embedded Systems, Sept. 2009.
[21] P. Longa, "Accelerating the Scalar Multiplication on Elliptic Curve Cryptosystems over Prime Fields," Master's thesis, Univ. of Ottawa, 2007.
[22] P. Longa and C. Gebotys, "Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication," Proc. Conf. Public Key Cryptography (PKC '09) pp. 443462, 2009.
[23] J.A. Solinas, "LowWeight Binary Representations for Pairs of Integers," Research Report CORR 200141, Center for Applied Cryptographic Research, Univ. of Waterloo, 2001.
[24] C. Doche, D.R. Kohel, and F. Sica, "DoubleBase Number System for MultiScalar Multiplications," Proc. 28th Ann. Int'l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT '09), Apr. 2009.
[25] E.G. Straus, "Addition Chains of Vectors (Problem 5125)," Am. Math. Monthly, vol. 70, pp. 806808, 1964.
[26] V.S. Dimitrov and T.V. Cooklev, "Two Algorithms for Modular Exponentiation Based on Nonstandard Arithmetics," IEICE Trans. Fundamentals of Electronics, Comm. and Computer Science, vol. E78A, no. 1,special issue on cryptography and information security, pp. 8287, Jan. 1995.
[27] J. Adikari, V.S. Dimitrov, and L. Imbert, "Hybrid BinaryTernary Joint form and Its Application in Elliptic Curve Cryptography" Proc. 19th IEEE Symp. Computer Arithmetic (ARITH), pp. 7683, June 2009.
[28] A.H. Koblitz, N. Koblitz, and A. Menezes, "Elliptic Curve Cryptography: The Serpentine Course of a Paradigm Shift," to be published in J. Number Theory.
[29] C. Doche, T. Icart, and D.R. Kohel, "Efficient Scalar Multiplication by Isogeny Decompositions," Proc. Conf. Public Key Cryptography (PKC '06), pp. 191206, 2006.
[30] D.J. Bernstein and T. Lange, "Analysis and Optimization of EllipticCurve SingleScalar Multiplication," Finite Fields and Applications, Contemporary Mathematics, vol. 461, pp. 119, Am. Math. Soc., 2008.
[31] D.J. Bernstein and T. Lange, "ExplicitFormulas Database," Joint Work by D.J. Bernstein and T. Lange, Building on Work by Many Authors. http://www.hyperelliptic.orgEFD/, 2010.
[32] M. Ciet, M. Joye, K. Lauter, and P.L. Montgomery, "Trading Inversions for Multiplications in Elliptic Curve Cryptography," Designs, Codes and Cryptography, vol. 39, no. 2, pp. 189206, May 2006.
[33] V.S. Dimitrov, G.A. Jullien, and W.C. Miller, "Theory and Applications of the DoubleBase Number System," IEEE Trans. Computers, vol. 48, no. 10, pp. 10981106, Oct. 1999.
[34] V.S. Dimitrov and G.A. Jullien, "Loading the Bases: A New Number Representation with Applications," IEEE Circuits and Systems Magazine, vol. 3, no. 2, pp. 623, Nov. 2003.
[35] V.S. Dimitrov, G.A. Jullien, and W.C. Miller, "An Algorithm for Modular Exponentiation," Information Processing Letters, vol. 66, no. 3, pp. 155159, 1998.
[36] V.S. Dimitrov, G.A. Jullien, and W.C. Miller, "Theory and Applications for a DoubleBase Number System," Proc. 13th Symp. Computer Arithmetic (ARITH), p. 44, July 1997.
[37] C. Doche and L. Habsieger, "A TreeBased Approach for Computing DoubleBase Chains," Proc. 13th Australasian Conf. Information Security and Privacy (ACISP '08), pp. 433446, 2008.
[38] D.J. Bernstein, P. Birkner, T. Lange, and C. Peters, "Optimizing DoubleBase EllipticCurve SingleScalar Multiplication," Proc. Conf. Progress in Cryptology (INDOCRYPT '07), pp. 167182, 2007.
[39] Nat'l Inst. of Standards and Tech nology, FIPS 1862, Digital Signature Standard, Fed. Information Processing Standards Publication, http://csrc.nist.gov/publications/fips/fips1862 fips1862change1.pdf, 2000.
[40] C. Doche, "Tripling Oriented DIK Curve Software Implementations," Personal Communication, Sept. 2008.
[41] K. Okeya and K. Sakurai, "Use of Montgomery Trick in Precomputation of MultiScalar Multiplication in Elliptic Curve Cryptosystems," Trans. Fundamentals of Electronics, Comm. and Computer Science, vol. E86A, no. 1, pp. 98112, 2003.
[42] H. Cohen, A Course in Computational Algebraic Number Theory, third ed. Springer, Sept. 1993.
[43] Free Software Foundation, "GMP, Arithmetic without Limitations," http:/www.gmplib.org/, Apr. 2009.