Software Implementation of Pairing-Based Cryptography on Sensor Networks Using the MSP430 Microcontroller
暂无分享,去创建一个
[1] P. L. Montgomery. Modular multiplication without trial division , 1985 .
[2] Hyang-Sook Lee,et al. Efficient and Generalized Pairing Computation on Abelian Varieties , 2009, IEEE Transactions on Information Theory.
[3] Michael Scott,et al. On the application of pairing based cryptography to wireless sensor networks , 2009, WiSec '09.
[4] Michael Scott,et al. On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves , 2009, Pairing.
[5] Qun Li,et al. Efficient Implementation of Public Key Cryptosystems on Mote Sensors (Short Paper) , 2006, ICICS.
[6] Ricardo Dahab,et al. NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks , 2008, EWSN.
[7] Andreas Enge,et al. Provably secure non-interactive key distribution based on pairings , 2006, Discret. Appl. Math..
[8] Ricardo Dahab,et al. TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks , 2008, 2008 5th International Conference on Networked Sensing Systems.
[9] Steven D. Galbraith,et al. Pairing-Based Cryptography - Pairing 2008, Second International Conference, Egham, UK, September 1-3, 2008. Proceedings , 2008, Pairing.
[10] Kenneth G. Paterson,et al. Pairings for Cryptographers , 2008, IACR Cryptol. ePrint Arch..
[11] Tsuyoshi Takagi,et al. Pairing-Based Cryptography - Pairing 2007, First International Conference, Tokyo, Japan, July 2-4, 2007, Proceedings , 2007, Pairing.
[12] Hossein Bidgoli. Handbook of Information Security , 2005 .
[13] Paul Barrett,et al. Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor , 1986, CRYPTO.
[14] Michael Scott,et al. Optimizing Multiprecision Multiplication for Public Key Cryptography , 2007, IACR Cryptol. ePrint Arch..
[15] Yasuyuki Nogami,et al. Integer Variable chi-Based Ate Pairing , 2008, Pairing.
[16] Ricardo Dahab,et al. Implementing Cryptographic Pairings over Barreto-Naehrig Curves , 2007, Pairing.
[17] Arjen K. Lenstra,et al. Selecting Cryptographic Key Sizes , 2000, Journal of Cryptology.
[18] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[19] Paulo S. L. M. Barreto,et al. Pairing-Friendly Elliptic Curves of Prime Order , 2005, Selected Areas in Cryptography.
[20] Ricardo Dahab,et al. TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).
[21] Alfred Menezes,et al. Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.
[22] Frederik Vercauteren,et al. Faster -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves , 2009, CHES.
[23] J. Grossschadl. Instruction set extension for long integer modulo arithmetic on RISC-based smart cards , 2002, 14th Symposium on Computer Architecture and High Performance Computing, 2002. Proceedings..
[24] Ian F. Akyildiz,et al. Wireless sensor networks , 2007 .
[25] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[26] P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization , 1987 .
[27] Aggelos Kiayias,et al. Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.
[28] Marc Joye,et al. Cryptographic Hardware and Embedded Systems - CHES 2004 , 2004, Lecture Notes in Computer Science.
[29] Luis Carlos Trevelin. 12th symposium on computer architecture and high performance computing , 2000 .
[30] Paul G. Comba,et al. Exponentiation Cryptosystems on the IBM PC , 1990, IBM Syst. J..
[31] Hans Eberle,et al. Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs , 2004, CHES.
[32] Frederik Vercauteren,et al. Optimal Pairings , 2010, IEEE Transactions on Information Theory.