Skip to main content
Have a personal or library account? Click to login
Methods to solve algebraic equations in cryptanalysis Cover

Methods to solve algebraic equations in cryptanalysis

Tatra Mountains Mathematical Publications
Volume 45 (2010): Issue 1 (April 2010)
By:  and    
Open Access
|Nov 2012
References

References

  1. [1] ARS, G.-FAUGÈRE, J. C.-IMAI, H.-KAWAZOE, M.-SUGITA, M.:, in: Advances in Cryptology-ASIACRYPT ’04 (P. J. Lee, ed.), Lecture Notes in Comput. Sci., Vol. 3329, Springer-Verlag, Berlin, 2004, pp. 338-353.
    Search in Google Scholar
  2. [2] BARDET, M.-FAUGÉRE, J.-C.-SALVY, B.:22, Research report 5049, INRIA, 2003.
    Search in Google Scholar
  3. [3] BARDET, M.-FAUGÈRE, J. C.-SALVY, B.-YANG, B. Y.:, in: Proc. of MEGA ’05, 8th International Symposium on Effective Methods in Algebraic Geometry Porto Conte, Alghero, Sardinia, Italy, May 27-June 1, 2005.
    Search in Google Scholar
  4. [4] BUCHBERGER, B.:. PhD. Thesis, Univ. of Innsbruck, Math. Inst., Innsbruck, 1965.
    Search in Google Scholar
  5. [5] BUCHBERGER, B.:, ACM SIGSAM Bull.(1976), no. 3, 19-29.
    Search in Google Scholar
  6. [6] BUCHBERGER, B.:, in: ACM SIGSAM Bull.(1976), no. 4, 19-24.
    Search in Google Scholar
  7. [7] BUCHBERGER, B.:, in: Proc. of EUROSAM ’79, An International Symposiumon Symbolic and Algebraic Computation (W. Ng. Edward, ed.), Lecture Notes in Comput. Sci., Vol. 72, Springer-Verlag, Berlin, 1979, pp. 3-21.
    Open DOISearch in Google Scholar
  8. [8] DE CANNIERE, C.-PRENEEL, B.:http://www.ecrypt.eu.org/stream/.
    Search in Google Scholar
  9. [9] CHEON, J. H.-LEE, D. H.:, in: Fast Software Encryption-FSE ’04, 11th Internat. Workshop (B. Roy et al., eds.), Lecture Notes in Comput. Sci., Vol. 3017, Springer-Verlag, Berlin, 2004, pp. 83-94.
    Search in Google Scholar
  10. [10] CID, C.-MURPHY, S.-ROBSHAW, M.:, in: Fast Software Encryption-FSE ’05, 12th Internat. Workshop (H. Glibert et al., eds.), Lecture Notes in Comput. Sci., Vol. 3557, Springer-Verlag, Berlin, 2005, pp. 145-162.
    Search in Google Scholar
  11. [11] COURTOIS, N.-PIEPRZYK, J. :, in: Advances in Cryptology-ASIACRYPT ’02, 8th Internat. Conference on the Theory and Application of Cryptology and Information Security (Y. Zheng, ed.), Lecture Notes in Comput. Sci., Vol. 2501, Springer-Verlag, Berlin, 2002, pp. 267-287.
    Search in Google Scholar
  12. [12] COURTOIS, N.-KLIMOV, A.-PATARIN, J.-SHAMIR, A.:, in: Advances in Cryptology- -EUROCRYPT ’00, Internat. Conference on the Theory and Application of Cryptographic Techniques (B. Preneel, ed.), Lecture Notes in Comput. Sci., Vol. 1807, Springer-Verlag, Berlin, 2000, pp. 392-407.
    Search in Google Scholar
  13. [13] BARD, G. V.-COURTOIS, N. T.-JEFFERSON, C.:(2), http://eprint.iacr.org/2007/024.
    Search in Google Scholar
  14. [14] BARD, G. V.-COURTOIS, N. T.:, in: Cryptography and Coding, 11th IMA Internat. Conference (S. Galbraith, (ed.), Lecture Notes in Comput. Sci., Vol. 4887, Springer-Verlag, Berlin, 2007, pp. 152-169, http://eprint.iacr.org/2006/402.
    Search in Google Scholar
  15. [15] DANTSIN, E.-GOERDT, A.-HIRSCH, E. A.-KANNAN, R.- KLEINBERG, J.- -PAPADIMITRIOU, C. H.-RAGHAVAN, P.-SCH¨ONING, U.:(22+1)Theoret. Comput. Sci.(2002), 69-83.
    Open DOISearch in Google Scholar
  16. [16] DAVIS, M.-PUTNAM, H.:, J. Assoc. Comput. Mach.(1960), 201-215.
    Open DOISearch in Google Scholar
  17. [17] DAVIS, M.-LOGEMANN, G.-LOVELAND, D.:Commun. ACM(1962), 394-397.
    Open DOISearch in Google Scholar
  18. [18] FAUGÈRE, J. C.:4, J. Pure Appl. Algebra(1999), 61-88.
    Open DOISearch in Google Scholar
  19. [19] FAUGÈRE, J. C.:5, in: Symbolic and Algebraic Computation-ISSAC ’02, Internat. Symposium (T. Mora, ed.), ACM Press, New York, NY, 2002, pp. 75-83.
    Open DOISearch in Google Scholar
  20. [20] FAUGÈRE, J. C.-JOUX, A.:, in: Advances in Cryptology-CRYPTO ’03, 23rd Annual Internat. Cryptology Conference (D. Boneh, ed.), Lecture Notes in Comput. Sci., Vol. 2729, Springer-Verlag, Berlin, 2003, pp. 44-60.
    Search in Google Scholar
  21. [21] GEBAUER, R.-MÖLLER, H. M.:, J. Symbolic Comput.(1988), 275-286.
    Open DOISearch in Google Scholar
  22. [22] GEISELMANN, W.-MATHEIS, K.-STEINWANDT, R.:http://eprint.iacr.org/2009/222.
    Open DOISearch in Google Scholar
  23. [23] IWAMA, K.:Bull. EATCS(2004), 61-71.
    Search in Google Scholar
  24. [24] JOUX, A.-VITSE, V.:, http://eprint.iacr.org/2010/158.
    Open DOISearch in Google Scholar
  25. [25] KUMAR, S.-PAAR, C.-PELZL, J.-PFEIER, G.-SCHIMMLER, M.:Lecture Notes in Comput. Sci., Vol. 4249, Springer-Verlag, Berlin, 2006, pp. 101-118.
    Search in Google Scholar
  26. [26] KWAN, M.:http://eprint.iacr.org/2000/051.
    Search in Google Scholar
  27. [27] LAZARD, D.:, in: Computer Algebra-EUROCAL ’83, Proc. Conf., London 1983, Lect. Notes Comput. Sci., Vol. 162, Springer-Verlag, Berlin, 1983, pp. 146-156.
    Open DOISearch in Google Scholar
  28. [28] MARQUES-SILVA, J. P.-SAKALLAH, K. A.:IEEE Trans. Comput.(1999), 506-521.
    Open DOISearch in Google Scholar
  29. [29] PAPADIMITRIOU, C. H.:in: Proc. of FOCS ’91, 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc., Washington, DC, USA, 1991, pp. 163-169.
    Search in Google Scholar
  30. [30] PATURI, R.-PUDLÁK, P.-SAKS, M. E.-ZANE, F.:J. ACM(2005), 337-364.
    Open DOISearch in Google Scholar
  31. [31] RADDUM, H.:(2)University of Bergen, 2004 (preprint).
    Search in Google Scholar
  32. [32] RADDUM, H.-SEMAEV, I.:, http://eprint.iacr.org/2006/475.
    Search in Google Scholar
  33. [33] RADDUM, H.-SEMAEV, I.:, Des. Codes Cryptogr.(2008), 147-160, extended abstract in: Proc. of WCC ’07, Versailles, France, INRIA, 2007.
    Search in Google Scholar
  34. [34] RADDUM, H.:, in: Selected Areas in Cryptography-SAC ’07, 14th Internat. Workshop (C. Adams et al., eds.), Lecture Notes in Comput. Sci., Vol. 4876, Springer-Verlag, Berlin, 2007, pp. 232-245.
    Search in Google Scholar
  35. [35] SCHILLING, T. E.-RADDUM, H.:, in: WAIFI ’10, 2010 (to appear).
    Open DOISearch in Google Scholar
  36. [36] SCHOONEN, A. C. C.:. Master’s Thesis, Eindhoven Univ. of Technology, Eindhoven, 2008.
    Search in Google Scholar
  37. [37] SCHÖNING, U.:, Algorithmica(2002), 615-623.
    Open DOISearch in Google Scholar
  38. [38] SEMAEV, I.:, Des. Codes Cryptogr.(2008), pp. 47-60.
    Search in Google Scholar
  39. [39] SEMAEV, I.:, SIAM J. Comput.(2009), 388-409.
    Open DOISearch in Google Scholar
  40. [40] SEMAEV, I.:, http://conf.fme.vutbr.cz/cecc09/lectures/semaev.pdf.
    Search in Google Scholar
  41. [41] SEMAEV, I.:, Des. Codes Cryptogr., 2010 (to appear).
    Open DOISearch in Google Scholar
  42. [42] SEMAEV, I.:, http://eprint.iacr.org/2010/140.
    Search in Google Scholar
  43. [43] YANG, B.-Y.-CHEN, J-M.-COURTOIS, N.:, in: Information and Communications Security-ICICS ’04, 6th Internat. Conference (J. Lopez et al., eds.), Lecture Notes in Comput. Sci., Vol. 3269, Springer-Verlag, Berlin, 2004, pp. 401-413.
    Search in Google Scholar
  44. [44] WANGDUE, R.:, Master Thesis, University of Bergen, Bergen, 2010.
    Search in Google Scholar
  45. [45] WIEDEMANN, D. H.:IEEE Trans. Inform. Theory(1986), 54-62.
    Open DOISearch in Google Scholar
  46. [46] ZAKREVSKIJ, A.-VASILKOVA, I.:, in: 4th Internat. Workshop on Boolean Problems, Freiberg University of Mining and Technology, Freiberg, 2000, pp. 21-28.
    Search in Google Scholar
  47. [47] ZHANG, L.-MALIK, S.:, Lecture Notes in Comput. Sci., Vol. 2404, Springer-Verlag, Berlin, 2002, pp. 17-36.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10127-010-0009-6 | Journal eISSN: 1338-9750 (formerly 1210-3195) | Journal ISSN: 1210-3195
Journal RSS Feed
Language: English
Page range: 107 - 136
Published on: Nov 12, 2012
Published by: Slovak Academy of Sciences, Mathematical Institute
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Keywords:
equation systems,
finite fields,
Gröbner basis,
k-SAT,
agreeing,
gluing,
MRHS,
cryptanalysis.
Related subjects:
Mathematics,
General mathematics

© 2012 Igor Semaev, Michal Mikuš, published by Slovak Academy of Sciences, Mathematical Institute
This work is licensed under the Creative Commons License.

Volume 45 (2010): Issue 1 (April 2010)
Previous article
Next article