메뉴 건너뛰기




Volumn 1, Issue , 2011, Pages 459-466

Efficient prime-field arithmetic for elliptic curve cryptography on wireless sensor nodes

Author keywords

[No Author keywords available]

Indexed keywords

8-BIT PROCESSORS; ARITHMETIC OPERATIONS; CLOCK CYCLES; DE FACTO STANDARD; ELLIPTIC CURVE CRYPTOGRAPHY; ELLIPTIC CURVE CRYPTOSYSTEMS; EXECUTION TIME; FINITE FIELDS; HIGH-SPEED; HYBRID TECHNIQUES; INTERNET OF THINGS (IOT); LOW HAMMING WEIGHTS; LOW WEIGHT; MICAZ MOTES; MODULAR MULTIPLICATION; MONTGOMERY MULTIPLICATION; PRIME FIELD; PUBLIC KEY CRYPTOSYSTEMS; RESOURCE-RESTRICTED DEVICES; RF-ID TAGS; SPECIAL PROPERTIES; WIRELESS SENSOR NODE;

EID: 84860436929     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCSNT.2011.6181997     Document Type: Conference Paper
Times cited : (24)

References (17)
  • 1
    • 21144441469 scopus 로고    scopus 로고
    • Generic efficient arithmetic algorithms for PAFFs (processor adequate finite fields) and related algebraic structures
    • M. Matsui and R. Zuccherato, editors, Selected Areas in Cryptography - SAC 2003, Springer Verlag
    • R. M. Avanzi and P. Mihǎ;ilescu. Generic efficient arithmetic algorithms for PAFFs (processor adequate finite fields) and related algebraic structures. In M. Matsui and R. Zuccherato, editors, Selected Areas in Cryptography - SAC 2003, volume 3006 of Lecture Notes in Computer Science, pages 320-334. Springer Verlag, 2003.
    • (2003) Lecture Notes in Computer Science , vol.3006 , pp. 320-334
    • Avanzi, R.M.1    Mihǎ2    ilescu, P.3
  • 2
    • 84957677506 scopus 로고    scopus 로고
    • Optimal extension fields for fast arithmetic in public-key algorithms
    • H. Krawczyk, editor, Advances in Cryptology - CRYPTO '98, Springer Verlag
    • D. V. Bailey and C. Paar. Optimal extension fields for fast arithmetic in public-key algorithms. In H. Krawczyk, editor, Advances in Cryptology - CRYPTO '98, volume 1462 of Lecture Notes in Computer Science, pages 472-485. Springer Verlag, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1462 , pp. 472-485
    • Bailey, D.V.1    Paar, C.2
  • 3
    • 10444273896 scopus 로고
    • Exponentiation cryptosystems on the IBM PC
    • Dec.
    • P. G. Comba. Exponentiation cryptosystems on the IBM PC. IBM Systems Journal, 29(4):526{538, Dec. 1990.
    • (1990) IBM Systems Journal , vol.29 , Issue.4 , pp. 526538
    • Comba, P.G.1
  • 4
    • 85034490362 scopus 로고
    • A cryptographic library for the Motorola DSP56000
    • I. B. Damgård, editor, Advances in Cryptology - EUROCRYPT '90, Springer Verlag
    • S. R. Dussé and B. S. Kaliski. A cryptographic library for the Motorola DSP56000. In I. B. Damgård, editor, Advances in Cryptology - EUROCRYPT '90, volume 473 of Lecture Notes in Computer Science, pages 230-244. Springer Verlag, 1991.
    • (1991) Lecture Notes in Computer Science , vol.473 , pp. 230-244
    • Dussé, S.R.1    Kaliski, B.S.2
  • 7
    • 35048818581 scopus 로고    scopus 로고
    • Comparing elliptic curve cryptography and RSA on 8-bit CPUs
    • M. Joye and J.-J. Quisquater, editors, Cryptographic Hardware and Embedded Systems - CHES 2004, Springer Verlag
    • N. Gura, A. Patel, A. S. Wander, H. Eberle, and S. Chang Shantz. Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In M. Joye and J.-J. Quisquater, editors, Cryptographic Hardware and Embedded Systems - CHES 2004, volume 3156 of Lecture Notes in Computer Science, pages 119-132. Springer Verlag, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3156 , pp. 119-132
    • Gura, N.1    Patel, A.2    Wander, A.S.3    Eberle, H.4    Chang Shantz, S.5
  • 9
    • 0030172012 scopus 로고    scopus 로고
    • Analyzing and comparing montgomery multiplication algorithms
    • Ç. K. Koç, T. Acar, and B. S. Kaliski. Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro, 16(3):26-33, June 1996. (Pubitemid 126530214)
    • (1996) IEEE Micro , vol.16 , Issue.3 , pp. 26-33
    • Koc, C.K.1    Acar, T.2    Kaliski Jr., B.S.3
  • 11
    • 58649109885 scopus 로고    scopus 로고
    • Security for Wireless Sensor Networks
    • Springer Verlag
    • D. Liu and P. Ning. Security for Wireless Sensor Networks, volume 28 of Advances in Information Security. Springer Verlag, 2006.
    • (2006) Advances in Information Security , vol.28
    • Liu, D.1    Ning, P.2
  • 13
    • 84966243285 scopus 로고
    • Modular multiplication without trial division
    • Apr.
    • P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, Apr. 1985.
    • (1985) Mathematics of Computation , vol.44 , Issue.170 , pp. 519-521
    • Montgomery, P.L.1
  • 14
    • 0003508562 scopus 로고    scopus 로고
    • Digital Signature Standard (DSS)
    • available for download at Feb.
    • National Institute of Standards and Technology (NIST). Digital Signature Standard (DSS). FIPS Publication 186-2, available for download at http://www.itl.nist.gov/fipspubs/, Feb. 2000.
    • (2000) FIPS Publication 186-2
  • 16
    • 0012584245 scopus 로고    scopus 로고
    • Technical Report CORR-99-39, Centre for Applied Cryptographic Research (CACR), University of Waterloo, Waterloo, Canada
    • J. A. Solinas. Generalized Mersenne numbers. Technical Report CORR-99-39, Centre for Applied Cryptographic Research (CACR), University of Waterloo, Waterloo, Canada, 1999.
    • (1999) Generalized Mersenne Numbers
    • Solinas, J.A.1
  • 17
    • 85008955601 scopus 로고    scopus 로고
    • Efficient implementation of public key cryptosystems on mote sensors
    • P. Ning, S. Qing, and N. Li, editors, Information and Communications Security - ICICS 2006, Springer Verlag
    • H. Wang and Q. Li. Efficient implementation of public key cryptosystems on mote sensors. In P. Ning, S. Qing, and N. Li, editors, Information and Communications Security - ICICS 2006, volume 4307 of Lecture Notes in Computer Science, pages 519-528. Springer Verlag, 2006.
    • (2006) Lecture Notes in Computer Science , vol.4307 , pp. 519-528
    • Wang, H.1    Li, Q.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.