Implementing minimized multivariate PKC on low-resource embedded systems

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

Volumn 3934 LNCS, Issue , 2006, Pages 73-88

  Yang, Bo Yin ^a   Cheng, Chen Mou ^b   Chen, Bor Rong ^b   Chen, Jiun Ming ^c  

^a TAMKANG UNIVERSITY   (Taiwan)

^b HARVARD UNIVERSITY   (United States)

^c NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Digital signature schemes; Efficient implementation; Embedded system; Motes; Multivariate public key cryptosystem; Sensor networks

Indexed keywords

ALGEBRA; COMPUTER HARDWARE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MULTIVARIABLE SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; SMART CARDS;

DIGITAL SIGNATURE SCHEMES; EFFICIENT IMPLEMENTATION; MOTES; MULTIVARIATE PUBLIC-KEY CRYPTOSYSTEM; SENSOR NETWORKS;

EMBEDDED SYSTEMS;

EID: 33745816647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11734666_7     Document Type: Conference Paper

References (45)

1. M. Akkar, N. Courtois, R. Duteuil, and L. Goubin, A Fast and Secure Implementation of SPLASH, PKC'03, LNCS 2567, pp. 267-278.
2. C.-Y. Chou, Y.-H. Hu, F.-P. Lai, L.-C. Wang, and B.-Y. Yang, Tractable Rational Map Signature, PKC'05, LNCS 3386, pp. 244-257.
3. N. Courtois, Generic Attacks and the Security of Quartz, PKC'03, LNCS 2567, pp. 351-364.
4. N. Courtois, L. Goubin, W. Meier, and J. Tacier, Solving Underdefined Systems of Multivariate Quadratic Equations, PKC'02, LNCS 2274, pp. 211-227.
5. N. Courtois, A. Klimov, J. Patarin, and A. Shamir, Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, EUROCRYPT 2000, LNCS 1807, pp. 392-407.
6. J. Daemen and V. Rijmen, The Design of Rijndael, AES - the Advanced Encryption Standard. Springer 2002.
7. P. Davis, Circulant matrices, John Wiley & Sons, New York-Chichester-Brisbane, 1979.
8. C. Diem, The XL-algorithm and a conjecture from commutative algebra, ASIACRYPT'04, LNCS 3329, pp. 338-353.
9. J. Ding, A New Variant of the Matsumoto-Imai Cryptosystem through Perturbation, PKC'04, LNCS 2947, pp. 305-318.
10. J. Ding, J. Gower et al, Innoculating Multivariate Schemes against Differential Attacks, http://eprint.iacr.org/2005/255/.
11. J. Ding and D. Schmidt, Rainbow, a new Digitial Multivariate Signature Scheme, ACNS'05, LNCS 3531, pp. 164-177.
12. J. Ding and Z. Yin, Cryptanalysis of TTS and tame-like multivariable signature schemes, presentation, IWAP'04.
13. J.-C. Faugère, A New Efficient Algorithm for Computing Gröbner Bases without Reduction to Zero (F5), Proceedings of ISSAC'02, pp. 75-83, ACM Press 2002.
14. J.-C. Faugère, invited talk at AES4 conference, and private communication.
15. M. Feldhofer, S. Dominikus, and J. Wolkerstorfer, Strong Authentication for RFID Systems Using the AES Algorithm, CHES 2004, LNCS 3156, pp. 357-370.
16. M. Garey and D. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness, Freeman and Co., 1979, p. 251.
17. G. Gaubatz, J.-P. Kaps, and B. Sunar, Public Key Cryptography in Sensor Networks - Revisited, 1st European Workshop on Security in Ad-Hoc and Sensor Networks (ESAS 2004), LNCS 3313, Heidelberg, Germany, August, 2004.
18. D. Gay, P. Levis, R. von Behren, M. Welsh, E. Brewer, and D. Culler, The nesC Language: A Holistic Approach to Networked Embedded Systems, ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation (PLDI), San Diego, CA, USA, June, 2003.
19. H. Gilbert and M. Minier, Cryptanalysis of SFLASH, EUROCRYPT 2002, LNCS 2332, pp. 288-298.
20. W. Geiselmann, R. Steinwandt, and T. Beth, Attacking the Affine Parts of SFLASH, 8th International IMA Conference on Cryptography and Coding, LNCS 2260, pp. 355-359.
21. L. Goubin and N. Courtois, Cryptanalysis of the TTM Cryptosystem, ASIACRYPT 2000, LNCS 1976, pp. 44-57.
22. L. K. Grover, A fast quantum mechanical algorithm for database search, Proc. 28th Annual ACM Symposium on the Theory of Computing, (May '96) pp. 212-220.
23. J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. E. Culler, and K. S. J. Pister, System Architecture Directions for Networked Sensors, Proc. 9th International Conference on Architectural Support for Programming Languages and Operating Systems (November 2000), pp. 93-104.
24. Y. Hu, L. Wang, J. Chen, F. Lai, and C. Chou, A Performance Report and Security Analysis of a fast TTM implementation, 2003 IEEE Int'l Symp. on Information Theory, Yokohama, Japan, June 2003.
25. Y Hu, L. Wang, F. Lai, and C. Chou, Similar Keys of Multivariate Quadratic Public Key Cryptosystems, CANS'05, LNCS 3810, pp. 211-222.
26. A. Joux, S. Kunz-Jacques, F. Muller, P.-M. Ricordel, Cryptanalysis of the Tractable Rational Map Cryptosystem, PKC'05, LNCS 3386, pp. 258-274.
27. A. Kipnis, J. Patarin, and L. Goubin, Unbalanced Oil and Vinegar Signature Schemes, CRYPTO'99, LNCS 1592, pp. 206-222.
28. R. Lidl and H. Niederreiter, Finite Fields. Addison-Wesley, 1984.
29. S. Ljungkvist, in the 8051 code library http://www.8052.com/codelib.phtm
30. D. Malan, M. Welsh, and M. Smith, A Public-Key Infrastructure for Key Distribution in TinyOS Based on Elliptic Curve Cryptography, First IEEE International Conference on Sensor and Ad hoc Communications and Networks (SECON), Santa Clara, CA, USA, October, 2004.
31. T. Matsumoto and H. Imai, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, EUROCRYPT'88, LNCS 330, pp. 419-453.
32. M. Matsumoto and T. Nishimura, Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator, ACM Trans. on Modeling and Computer Sim., 8 (1998), pp. 3-30.
33. The NESSIE project homepage: http://www.cryptonessie.org.
34. C. Paar, Some Remarks on Efficient Inversion in Finite Fields, 1995 IEEE International Symposium on Information Theory, Whistler, B.C. Canada, September 1995, available from the author's website.
35. C. Paar, A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composition Fields, Brief Contributions section of IEEE Transactions on Computers, vol. 45(1996), No. 7, pp. 856-861.
36. J. Patarin, Cryptanalysis of the Matsurnoto and Imai Public Key Scheme of Eurocrypt '88, CRYPTO'95, LNCS 963, pp. 248-261.
37. J. Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, EUROCRYPT'96, LNCS 1070, pp. 33-48.
38. -+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai, ASIACRYPT'98, LNCS 1514, pp. 35-49.
39. J. Patarin, N. Courtois, and L. Goubin, FLASH, a Fast Multivariate Signature Algorithm, CT-RSA'01, LNCS 2020, pp. 298-307. Updated version available at http://www.cryptonessie.org
40. P. W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, Proc. 35nd Annual Symposium on Foundations of Computer Science (S. Goldwasser, ed.), IEEE Computer Society Press (1994), 124-134.
41. C. Wolf and B. Preneel, Taxonomy of Public-Key Schemes based on the Problem of Multivariate Quadratic Equations, http://eprint.iacr.org/2005/077.
42. C. Wolf and B. Preneel, Equivalent Keys in HFE, C*, and variations, In Mycrypt'05, LNCS 3715, pp. 33-49, 2005.
43. B.-Y. Yang and J.-M. Chen, Rank Attacks and Defence in Tame-Like Multivariate PKC's, ACISP 2005, LNCS 3574, p. 518-531. Older version at E-Print Archive 2004/061.
44. B.-Y. Yang, Y.-H. Chen, and J.-M. Chen, TTS: High-Speed Signatures on a Low-Cost Smart Card, CHES'04, LNCS 3156, pp. 371-385.
45. B.-Y. Yang, C.-M. Cheng, B.-R. Chen, and J.-M. Chen, Technical Research Report Number 11, 2005, Taiwan Information Security Center (TWISC).