Efficient Implementation of Public Key Cryptosystems on Mote Sensors (Short Paper)
暂无分享,去创建一个
[1] P. L. Montgomery. Modular multiplication without trial division , 1985 .
[2] J. Olivos,et al. Speeding up the computations on an elliptic curve using addition-subtraction chains , 1990, RAIRO Theor. Informatics Appl..
[3] Atsuko Miyaji,et al. Efficient elliptic curve exponentiation , 1997, ICICS.
[4] Atsuko Miyaji,et al. Efficient Elliptic Curve Exponentiation Using Mixed Coordinates , 1998, ASIACRYPT.
[5] S. C. Shantz. From Euclid's GCD to Montgomery Multiplication to the Great Divide , 2001 .
[6] Hans Eberle,et al. Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs , 2004, CHES.
[7] Michael D. Smith,et al. A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..
[8] Vipul Gupta,et al. Sizzle: a standards-based end-to-end security architecture for the embedded Internet , 2005, Third IEEE International Conference on Pervasive Computing and Communications.
[9] Qun Li,et al. Distributed User Access Control in Sensor Networks , 2006, DCOSS.
[10] Haodong Wang,et al. Efficient Implementation of Public Key Cryptosystems on MIC Az and TelosB Motes , 2006 .
[11] Bo Sheng,et al. Elliptic curve cryptography-based access control in sensor networks , 2006, Int. J. Secur. Networks.
[12] Peng Ning,et al. 2008 International Conference on Information Processing in Sensor Networks TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks ∗ , 2022 .