Robust Finite Field Arithmetic for Fault-Tolerant Tate Pairing

키워드

참고문헌 (24)

1. P. Barreto, "Efficient pairing computation on supersingular abelian varieties", Des. Codes Cryptogr., 42(3), pp.239~271 (2007), Springer-Verlag
2. P. Barreto, "Pairing-frendlly elliptic curves of prime order", Se-lected Areas in Cryptography-SAC 2005, 통권 : 3987, pp.319~331 (2005)
3. G. Bertoni, "Parallel hardware Ar-chitechures for the Cryptographic Tate Pairing", Preceedings of the Third Inter-national Conference on Information Technology: New Generations (ITNG'06), pp.186~191 (2006)
4. "G. M. Bertoni, L. Chen, P. Fragneto, K. A. Harrison, G. Pelosi, Computing tate pairing on smartcards, Abailable from:", ~
5. D. Boneh, "Identity-Based Encryption from the Weil Pairing", Pro-ceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, 통권 : 2139, pp.213~229 (2001), Springer-Verlag
6. D. Boneh, "Collusion resistant brodadcast encryption with short ciphertexts and private keys", in CRYPTO 2005, 통권 : 3621, pp.258~275 (2005)
7. D. Boneh, "Short signatures from the Weil pairing", J. of Cryptology, 17(4), pp.297~319 (2004)
8. J. C. Choon, "An identity-Based Signature from Gap Diffie-Hellman Groups", PKC 2003, 통권 : 2567, pp.18~30 (2002), Springer
9. A. J. Devegili, "Implementing Cryptographic Pairings over Barreto-Naehring Curves", 통권 : 4575, pp.1611~3349 (2007), Springer-Verlag
10. I. M. Duursma, "Tate pairing implementation for hyperelliptic curves y2 = xp - x + d", In Advances in Cryptology - Asiacrypt 2003, 통권 : 2260, pp.360~363 (2003), Springer Verlag
11. S. Galbraith, "Pairigns, Advances in Elliptic Curve Cryptography" (2005), Cambridge University Press
12. G. Gaubatz, "Robust finite field arithmetic for fault tolerant public-key cryptography", 2nd Workshop on Fault Tolerance and Diagonosis in Cryp- tography (FTDC), 통권 : 4236, pp.196~210 (2005), Springer-Verlag
13. "ID based Cryptography and Smartcards"[URL]
14. F. Hess, "Exponent group signature schemes and efficient identity based signa-ture schemes based on pairing", SAC 2002, 통권 : 2595, pp.310~324 (2002)
15. M. Karpovsky, "New class of nonlinear systematic error detecting codes", IEEE Trans. on Infor-mation Theroy, 50(8), pp.1818~1820 (2004)
16. S. Kwon, "Efficient Tate pairing computation for super-singular elliptic curves over binary fields", ACISP, 통권 : 3574, pp.134~145 (2005), Springer-Verlag
17. K. Kulikowski, "Robust codes and robust, fault-tolerant architectures of the Ad-vanced Encryption Standard", Journal of sys-tems Archi-tecture, 53, pp.139~149 (2007)
18. V. S. Miller, "The Weil pairing, and its efficient calculation", Journal of Cryptol-ogy, 17(4), pp.235~261 (2004)
19. A. Miyaji, "New explicit conditions of elliptic curves traces for FR-reduction. IEICE-Transactions on Fundamentals of Elec-tronics", communications and Computer Sciences, E84-A, pp.1234~1243 (2001)
20. R. Mollin, "Simple continued fraction solutions for Diophantine equations", Ex-positiones Mathematicae, 19, pp.55~73 (2001)
21. E. Ä OztÄurK, "Tate Pairing with Strong Fault Resiliency", Fault Diagnosis and Tolerance in Cryptography(FDTC'07), pp.103~111 (2007), IEEE Computer Scoiety, IEEE Press
22. D. Page, "A Fault Attack on Pairing Based Cryptography", IEEE Trans. on Computers, 55(9), pp.1075~1080 (2006)
23. R. Ronan, "An Embedded Processor for a Pairing-Based Cryptosystem", Proceedings of the Third International Conference on Information Technology: New Generations (ITNG'06), pp.192~197 (2006)
24. A. Shamir, "Identity-based cryptosystems and signature schemes", Proceedings of CRYPTO 84 on Advances in cryptology, 통권 : 196, pp.47~53 (1984), Springer-Verlag

관련 논문AI추천