Compiler assisted elliptic curve cryptography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4804 LNCS, Issue PART 2, 2007, Pages 1785-1802

  Barbosa, M ^a   Moss, A ^b   Page, D ^b  

^a UNIVERSITY OF MINHO   (Portugal)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Compilers; Elliptic Curve Cryptography (ECC); Implementation; Optimisation; Specialisation

Indexed keywords

COMPUTER SOFTWARE; OPTIMIZATION; PROGRAM COMPILERS;

DOMAIN SPECIFIC LANGUAGE; ELLIPTIC CURVE CRYPTOGRAPHY (ECC);

CRYPTOGRAPHY;

EID: 38349004533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76843-2_46     Document Type: Conference Paper

References (35)

1. Agrawal, D., Archambeault, B., Rao, J.R., Rohatgi, P.: The EM Side-Channel(s). In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 29-45. Springer, Heidelberg (2003)
2. ARM Limited. ARM946E-S Technical Reference Manual. Available from: http://www.arm.com/documentation/
3. Avanzi, R.M.: Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations. In: Joye, M., Quisquater, J.J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 148-162. Springer, Heidelberg (2004)
4. Barrett, P.D.: Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311-323. Springer, Heidelberg (1987)
5. Barbosa, M., Page, D.: On the Automatic Construction of Indistinguishable Operations. Cryptology ePrint Archive Report 2005/174 (2005)
6. Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. Cambridge University Press, Cambridge (1999)
7. Blake, I.F., Seroussi, G., Smart, N.P.: Advances in Elliptic Curve Cryptography. Cambridge University Press, Cambridge (2004)
8. Camenisch, J., Rohe, M., Sadeghi, A-R.: Sokrates - A Compiler Framework for Zero-Knowledge Protocols. In: WEWoRC. Western European Workshop on Research in Cryptology (2005)
9. Computational Algebra Group, University of Sydney. Magma Computational Algebra System. Available from: http://magma.maths.usyd.edu.au/magma/
10. Consel, C., Hornof, L., Marlet, R., Muller, G., Thibault, S., Volanschi, E-N., Lawall, J., Noyá, J.: Tempo: Specializing Systems Applications and Beyond. ACM Computing Surveys 30(3) (1998)
11. Crescenzi, P., Kann, V.: A Compendium of NP Optimization Problems. Available from: http://www.nada.kth.se/~viggo/problemlist/
12. Dueck, G., Scheuer, T.: Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing. Journal of Computational Physics 90(1), 161-175 (1990)
13. q, Library and Implementing Curve-based Key Exchanges. In: SPEED. Software Performance Enhancement for Encryption and Decryption, pp. 49-64 (2007)
14. Gupta, D., Malloy, B., McRae, A.: The Complexity of Scheduling for Data Cache Optimization. Information Sciences 100(1-4) (1997)
15. Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)
16. Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Francisco (2006)
17. Knuth, D.: The Art of Computer Programming, Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1999)
18. Koblitz, N.: Elliptic Curve Cryptosystems. Mathematics of Computation 48, 203-209 (1987)
19. Koblitz, N.: Hyperelliptic Cryptosystems. Journal of Cryptology 3, 139-150 (1989)
20. Kocher, P.C.: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104-113. Springer, Heidelberg (1996)
21. Kocher, P.C., Jaffe, J., Jun, B.: Differential Power Analysis. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388-397. Springer, Heidelberg (1999)
22. Kowarschik, M., Wei, C.: An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms. In: Meyer, U., Sanders, P., Sibeyn, J.F. (eds.) Algorithms for Memory Hierarchies. LNCS, vol. 2625, pp. 213-232. Springer, Heidelberg (2003)
23. Lewis, J.R., Martin, B.: Cryptol: High Assurance, Retargetable Crypto Development and Validation. Military Communications Conference 2, 820-825 (2003)
24. Lucks, S., Schmoigl, N., Tatli, E.I.: The Idea and the Architecture of a Cryptographic Compiler. In: WEWoRC Western European Workshop on Research in Cryptology (2005)
25. Micali, S., Reyzin, L.: Physically Observable Cryptography (Extended Abstract). In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 278-296. Springer, Heidelberg (2004)
26. Miller, V.: Uses of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417-426. Springer, Heidelberg (1986)
27. Montgomery, P.L.: Modular Multiplication Without Trial Division. Mathematics of Computation 44, 519-521 (1985)
28. Muchnick, S.S.: Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco (1997)
29. Nielsen, .I.D., Schwartzbach, M.I.: A Domain-Specific Programming Language for Secure Multiparty Computation. In: PLAS. Programming Languages and Analysis for Security (2007)
30. Page, D.: CAO: A Cryptography Aware Language and Compiler, http://www.cs.bris.ac.uk/home/page/research/cao.html
31. Sermulins, J., Thies, W., Rabbah, R., Amarasinghe, S.: Cache Aware Optimization of Stream Programs. In: ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (2005)
32. Standards for Efficient Cryptography Group (SECG). SEC 2: Recommended Elliptic Curve Domain Parameters, (2000) Available from http://www.secg.org
33. Shoup, V.: NTL: A Library for doing Number Theory. Available from: http://www.shoup.net/ntl/
34. Solinas, J.A.: Generalized Mersenne Numbers. Technical Report CORR 99-39, University of Waterloo (1999)
35. Walter, C.D.: Montgomery Exponentiation Needs No Final Subtractions. Electronics Letters 35, 1831-1832 (1999)