
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Camille Vuillaume, Katsuyuki Okeya, Tsuyoshi Takagi, "ShortMemory Scalar Multiplication for Koblitz Curves," IEEE Transactions on Computers, vol. 57, no. 4, pp. 481489, April, 2008.  
BibTex  x  
@article{ 10.1109/TC.2007.70824, author = {Camille Vuillaume and Katsuyuki Okeya and Tsuyoshi Takagi}, title = {ShortMemory Scalar Multiplication for Koblitz Curves}, journal ={IEEE Transactions on Computers}, volume = {57}, number = {4}, issn = {00189340}, year = {2008}, pages = {481489}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.70824}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  ShortMemory Scalar Multiplication for Koblitz Curves IS  4 SN  00189340 SP481 EP489 EPD  481489 A1  Camille Vuillaume, A1  Katsuyuki Okeya, A1  Tsuyoshi Takagi, PY  2008 KW  Public key cryptosystems KW  Smartcards KW  Efficiency KW  Koblitz Curves VL  57 JA  IEEE Transactions on Computers ER   
[1] N. Koblitz, “Elliptic Curve Cryptosystems,” Math. Computation, vol. 48, no. 177, pp. 203209, 1987.
[2] V.S. Miller, “Use of Elliptic Curves in Cryptography,” Advances in Cryptology—Proc. Fifth Ann. Int'l Cryptology Conf., pp. 417426, 1986.
[3] N. Koblitz, “CMCurves with Good Cryptographic Properties,” Advances in Cryptology—Proc. 11th Ann. Int'l Cryptology Conf., pp.279287, 1992.
[4] J. Solinas, “Efficient Arithmetic on Koblitz Curves,” Designs, Codes, and Cryptography, vol. 19, nos. 23, pp. 195249, 2000.
[5] R.M. Avanzi, M. Ciet, and F. Sica, “Faster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius Endomorphism,” Proc. Seventh Int'l Workshop Theory and Practice in Public Key Cryptography, pp. 2840, 2004.
[6] R.M. Avanzi, C. Heuberger, and H. Prodinger, “Minimality of the Hamming Weight of the $t\hbox{}{\rm NAF}$ for Koblitz Curves and Improved Combination with Point Halving,” Proc. 12th Ann. Workshop Selected Areas in Cryptography, pp. 332344, 2006.
[7] J.S. Coron, D. M'Raïhi, and C. Tymen, “Fast Generation of Pairs $(k, [k]P)$ for Koblitz Elliptic Curves,” Proc. Eighth Ann. Workshop Selected Areas in Cryptography, pp. 151164, 2001.
[8] D. Hankerson, J. López, and A. Menezes, “Software Implementation of Elliptic Curve Cryptography over Binary Fields,” Proc. Second Int'l Workshop Cryptographic Hardware and Embedded Systems, pp. 124, 2000.
[9] R. Dahab, D. Hankerson, F. Hu, M. Long, J. López, and A. Menezes, “Software Multiplication Using Gaussian Normal Bases,” IEEE Trans. Computers, vol. 55, no. 8, pp. 974984, Aug. 2006.
[10] “P1363: Standard Specifications for PublicKey Cryptography,” IEEE, 2000.
[11] J. López and R. Dahab, “Improved Algorithms for Elliptic Curve Arithmetic in ${\rm GF}(2^{n})$ ,” Proc. Second Ann. Workshop Selected Areas in Cryptography, pp. 201212, 1998.
[12] D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography. Springer, 2004.
[13] P. Kocher, J. Jaffe, and B. Jun, “Differential Power Analysis,” Advances in Cryptology—Proc. 19th Ann. Int'l Cryptology Conf., pp.388397, 1999.
[14] E. Biham and A. Shamir, “Differential Fault Analysis of Secret Key Cryptosystems,” Advances in Cryptology—Proc. 17th Ann. Int'l Cryptology Conf., pp. 513525, 1997.
[15] D.J. Park, S.G. Sim, and P.J. Lee, “Fast Scalar Multiplication Method Using ChangeofBasis Matrix to Prevent Power Analysis Attacks on Koblitz Curves,” Proc. Fourth Int'l Workshop Information Security Applications, pp. 474488, 2003.
[16] J. Massey and J.K. Omura, “Computational Method and Apparatus for FiniteField Arithmetic,” US patent 4587627, Washington, D.C., Patent and Trademark Office, 1986.
[17] B.S. Kaliski and Y.L. Yin, “StorageEfficient FiniteField Basis Conversion,” Proc. Second Ann. Workshop Selected Areas in Cryptography, pp. 8193, 1999.
[18] E.F. Brickell, D.M. Gordon, K.S. McCurley, and D.B. Wilson, “Fast Exponentiation with Precomputation: Algorithms and Lower Bounds,” Advances in Cryptology—Proc. European Workshop Theory and Application of Cryptographic Techniques, pp. 200209, 1993.
[19] B. Möller, “Improved Techniques for Fast Exponentiation,” Proc. Fifth Int'l Conf. Information Security and Cryptology, pp. 298312, 2003.
[20] K. Okeya, T. Takagi, and C. Vuillaume, “Short Memory Scalar Multiplication on Koblitz Curves,” Proc. Seventh Int'l Workshop Cryptographic Hardware and Embedded Systems, pp. 91105, 2005.
[21] R.M. Avanzi, V. Dimitrov, C. Doche, and F. Sica, “Extending Scalar Multiplication Using Double Bases,” Advances in Cryptology —Proc. 12th Asia Conf. Theory and Applications of Cryptology and Information Security, pp. 130144, 2006.