Inverting bijective polynomial maps over finite fields

2006 IEEE Information Theory Workshop, ITW 2006

Volumn , Issue , 2006, Pages 27-31

  Cafure, Antonio ^a,b   Matera, Guillermo ^b,c   Waissbein, Ariel ^d  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b INSTITUTO DE CIENCIAS   (Argentina)

^c Facultad de Ciencias Naturales e Instituto M Lillo   (Argentina)

^d CORE ST ^*  (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; CONFORMAL MAPPING; CRYPTOGRAPHY; FINITE ELEMENT METHOD; GRAPH THEORY;

FINITE FIELDS; PERMUTATION; POLYNOMIAL MAPS;

POLYNOMIALS;

EID: 33751041255     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. I. Shparlinski, Computational and algorithmic problems in finite fields, Dordrecht Boston London: Kluwcr Academic Publishers, 1992.
2. M.-D. Huang and Y.-C. Wong, "Solvability of systems of polynomial congruences modulo a large prime," Comput. Complexity, vol. 8, no. 3, pp. 227-257, 1999.
3. 2," Rapport de Recherche INRIA RR-5049, 2003, http://www.inria.fr/rrrt/rr-5049.html.
4. A. Cafure and G. Matera, "Fast computation of a rational point of a variety over a finite field," To appear in Math. Comput., available at www.arxiv.org/pdf/math.AG/0406085, 2005.
5. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979.
6. J. von zur Gathen, M. Karpinski, and I. Shparlinski, "Counting curves and their projections," Comput. Complexity, vol. 6, pp. 64-99, 1997.
7. A. Cafure and G. Matera, "Improved explicit estimates on the number of solutions of equations over a finite field," To appear in Finite Fields Appl., available at www.arxiv.org/pdf/math.NT/0405302, 2005.
8. C. Sturtivant and Z.-L. Zhang, "Efficiently inverting bijections given by straight line programs," in Proc. FOCS'90. IEEE, 1990, pp. 327-334.
9. A. Kipnis and A. Shamir, "Cryptanalysis of the HFE Public Key Cryptosystem by relinearization," in Proceedings CRYPTO'99, ser. Lecture Notes in Comput. Sci., vol. 1666. Berlin: Springer, 1999, pp. 19-30.
10. N. Courtois, A. Klimov, J. Patarin, and A. Shamir, "Efficient algorithms for solving overdefined systems of multivariate polynomial equations," in EUROCRYPT 2000, ser. Lecture Notes in Comput. Sci., B. Preneel, Ed., vol. 1807. Berlin: Springer, 2000, pp. 71-79.
11. T. Matsumoto and H. Imai, "A class of asymmetric crypto-systems based on polynomials over finite rings," in IEEE Intern. Symp. Inform. Theory, Abstracts of Papers, 1983, pp. 131-132.
12. C, Wolf and B. Preneel, "Taxonomy of public key schemes based on the problem of multivariate quadratic equations," Cryptology ePrint Archive, Report 2005/077, 2005, http://eprint.iacr.org/.
13. J. Heintz, "Definability and fast quantifier elimination in algebraically closed fields," Theoret. Comput. Sci., vol. 24, no. 3, pp. 239-277, 1983.
14. D. Castro, M. Giusti, J. Heintz, G. Matera, and L. Pardo, "The hardness of polynomial equation solving," Found, Comput, Math., vol. 3, no. 4, pp. 347-420, 2003.
15. M. Giusti, K. Hägele, J. Heintz, J. Morais, J. Montaña, and L. Pardo, "Lower bounds for Diophantine approximation," J. Pure Appl. Algebra, vol. 117,118, pp. 277-317, 1997.
16. L. Pardo and J. San Martín, "Deformation techniques to solve generalized Pham systems," Theoret, Comput, Sci., vol. 315, 593-625, 2004.
17. E. Kaltofen, "Effective Noether irreducibility forms and applications," J. Comput. System Sci., vol. 50, no. 2, pp. 274-295, 1995.
18. R, Lidl and H, Niederreiter, Finite fields. Addison-Wesley, 1983.
19. J. von zur Gathen and J. Gerhard, Modern computer algebra. Cambridge: Cambridge Univ. Press, 1999.
20. D. Bini and V. Pan, Polynomial and matrix computations, ser. Progress in Theoretical Computer Science. Boston: Birkhäuser, 1994.
21. W. Baur and V. Strassen, "The complexity of partial derivatives," Theoret. Comput. Sci., vol. 22, pp, 317-330, 1983.
22. V. Pan, Structured matrices and polynomials. Unified superfast algorithms. Boston: Birkhäuser, 2001.
23. M. Giusti, G. Lecerf, and B, Salvy, "A Gröbner free alternative for polynomial system solving," J. Complexity, vol. 17, pp. 154-211, 2001.