
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yong Ki Lee, Kazuo Sakiyama, Lejla Batina, Ingrid Verbauwhede, "EllipticCurveBased Security Processor for RFID," IEEE Transactions on Computers, vol. 57, no. 11, pp. 15141527, November, 2008.  
BibTex  x  
@article{ 10.1109/TC.2008.148, author = {Yong Ki Lee and Kazuo Sakiyama and Lejla Batina and Ingrid Verbauwhede}, title = {EllipticCurveBased Security Processor for RFID}, journal ={IEEE Transactions on Computers}, volume = {57}, number = {11}, issn = {00189340}, year = {2008}, pages = {15141527}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.148}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  EllipticCurveBased Security Processor for RFID IS  11 SN  00189340 SP1514 EP1527 EPD  15141527 A1  Yong Ki Lee, A1  Kazuo Sakiyama, A1  Lejla Batina, A1  Ingrid Verbauwhede, PY  2008 KW  Support for security KW  Microarchitecture implementation considerations KW  Processor Architectures KW  Compu KW  Specialpurpose KW  General KW  Lowpower design VL  57 JA  IEEE Transactions on Computers ER   
[1] M. Burmester, B. Medeiros, and R. Motta, “Robust Anonymous RFID Authentication with Constant Key Lookup,” Proc. ACM Symp. Information, Computer and Comm. Security (ASIACCS), 2008.
[2] A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press, 1997.
[3] P. Montgomery, “Speeding the Pollard and Elliptic Curve Methods of Factorization,” Math. Computation, vol. 48, pp.243264, 1987.
[4] C.P. Schnorr, “Efficient Identification and Signatures for Smart Cards,” Proc. Ninth Ann. Int'l Cryptology Conf. (CRYPTO '89), pp.239252, 1989.
[5] T. Okamoto, “Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes,” Proc. 12th Ann. Int'l Cryptology Conf. (CRYPTO '92), pp. 3153, 1992.
[6] I. Blake, G. Seroussi, and N.P. Smart, “Elliptic Curves in Cryptography,” London Math. Soc. Lecture Note Series. Cambridge Univ. Press, 1999.
[7] P. Montgomery, “Multiplication without Trial Division,” Math. Computation, vol. 44, pp. 519521, 1985.
[8] P.D. Barrett, “Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital SignalProcessor,” Proc. Advances in Cryptology (CRYPTO '86), pp. 311323, 1987.
[9] J. López and R. Dahab, “Fast Multiplication on Elliptic Curves over $GF(2^{m})$ without Precomputation,” Proc. First Int'l Workshop Cryptographic Hardware and Embedded Systems (CHES '99), pp.316327, 1999.
[10] N. Meloni, “Fast and Secure Elliptic Curve Scalar Multiplication over Prime Fields Using Special Addition Chains,” Cryptology ePrint Archive: Listing for 2006 (2006/216), 2006.
[11] C. Paar, LightWeight Cryptography for Ubiquitous Computing, Invited Talk at the Univ. of California, Los Angeles (UCLA), Inst. for Pure and Applied Math., Dec. 2006.
[12] K. Sakiyama, L. Batina, N. Mentens, B. Preneel, and I. Verbauwhede, “SmallFootprint ALU for PublicKey Processors for Pervasive Security,” Proc. Workshop RFID Security (RFIDSec '06), p. 12, 2006.
[13] L. Batina, N. Mentens, K. Sakiyama, B. Preneel, and I. Verbauwhede, “LowCost Elliptic Curve Cryptography for Wireless Sensor Networks,” Proc. Third European Workshop Security and Privacy in Ad Hoc and Sensor Networks (ESAS '06), pp. 617, 2006.
[14] Y.K. Lee and I. Verbauwhede, “A Compact Architecture for Montgomery Elliptic Curve Scalar Multiplication Processor,” Proc. Eighth Int'l Workshop Information Security Applications (WISA '07), pp. 115127, 2007.
[15] E. Öztürk, B. Sunar, and E. Savas, “LowPower Elliptic Curve Cryptography Using Scaled Modular Arithmetic,” Proc. Sixth Int'l Workshop Cryptographic Hardware and Embedded Systems (CHES'04), pp. 92106, 2004.
[16] A. Satoh and K. Takano, “A Scalable DualField Elliptic Curve Cryptographic Processor,” IEEE Trans. Computers, vol. 52, no. 4, pp. 449460, Apr. 2003.
[17] F. Zhou, C. Chen, D. Jin, C. Huang, and H. Ming, Evaluating and Optimizing Power Consumption of AntiCollision Protocols forApplication in RFID Systems, AUTOID Labs, http://www.autoidlabs.org/uploads/mediaAUTOIDLABSWPSWNET014_01.pdf , white paper, 2008.
[18] ISO/IEC 180003:2004, Information Technology—Radio Frequency Identification (RFID) for Item Management—Part 3: Parameters for Air Interface Communications at 13.56 MHz.
[19] J. Wolkerstorfer, “Is EllipticCurve Cryptography Suitable to Secure RFID Tags?” Proc. Workshop RFID and LightWeight Cryptography, Aug. 2005.
[20] G. Gaubatz, J.P. Kaps, E. Öztürk, and B. Sunar, “State of the Art in UltraLow Power Public Key Cryptography for Wireless Sensor Networks,” Proc. Second IEEE Int'l Workshop Pervasive Computing and Comm. Security (PerSec '05), pp. 146150, 2005.
[21] S. Kumar and C. Paar, “Are Standards Compliant Elliptic Curve Cryptosystems Feasible on RFID?” Workshop Record of the ECRYPT Workshop RFID Security, p. 19, 2006.
[22] F. Fürbass and J. Wolkerstorfer, “ECC Processor with Low Die Size for RFID Applications,” Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '07), pp. 18351838, 2007.