Phase transition of multivariate polynomial systems

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

Volumn 4484 LNCS, Issue , 2007, Pages 632-645

  Fusco, Giordano ^a   Bach, Eric ^a  

^a University of Wisconsin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; MAXIMUM LIKELIHOOD; MULTIVARIABLE SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

CRYPTOGRAPHIC SYSTEMS; MULTIVARIATE POLYNOMIAL SYSTEMS; RANDOM SYSTEMS;

POLYNOMIALS;

EID: 35448931907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72504-6_58     Document Type: Conference Paper

References (16)

1. A. BIRYUKOV, C. DE CANNIÈRE, Block ciphers and systems of quadratic equations, Proc. FSE 2003, LNCS 2887, pp. 274-289, 2003.
2. P. BEAME, R. IMPAGLIAZZO, J. KRAJÍČ EK, T. PITASSI, P. PUDLÁK, Lower bounds on Hubert's Nullstellensatz and propositional proofs, Proc. London Math. Soc., n. 73, pp. 1-26, 1996.
3. S. BUSS, R. IMPAGLIAZZO, J. KRAJÍČ EK, A.A. RAZBOROV, J. SGALL, Proof complexity in algebraic systems and bounded depth Frege systems with modular counting, Comput. Complex., n. 6, pp. 256-298, 1997.
4. M. CLEGG, J. EDMONDS, R. IMPAGLIAZZO, Using the Groebner basis algorithm to find proofs of unsatisfiability, Proc. 28th Ann. ACM Symp. Theory Comput., pp. 174-183, 1996
5. N. COURTOIS, A. KLIMOV, J. PATARIN, A. SHAMIR, Efficient algorithms for solving overdefined systems of multivariate polynomial equations, Proc. Eurocrypt 2000, LNCS 1807, pp. 392-407, 2000.
6. N. COURTOIS, J. PIERPZYK, Cryptanalysis of block ciphers with overdefined systems of equations, Proc. Asiacrypt 2002, LNCS 2501, pp. 267-287, 2002.
7. L. E. DICKSON, Determination of the structure of all linear homogeneous groups in a Galois field which are defined by a quadratic invariant, Amer. J. Math., v. 21, pp. 193-256, 1899.
8. E. FRIEGUT, Necessary and sufficient conditions for sharp thresholds of graph properties and the k-SAT problem, Amer. J. Math., v. 12, pp. 1017-1054, 1999.
9. J. FRANCO, Results related to threshold phenomena research in satisfiability: lower bounds, Theoret. Comput. Sci., v. 265, n. 1-2, pp. 147-157, 2001.
10. J. FRANCO, Typical case complexity of satisfiability algorithms and the threshold phenomenon Disc. Appl. Math., v. 153, n. 1-3: pp. 89-123, 2005.
11. F. GERTH III, Limit probabilities for coranks of matrices over GF(q), Lin. Multilin. Alg., v. 19, pp. 79-93, 1986.
12. J. HÅSTAD, S. PHILLIPS, S. SAFRA, A well-characterized approximation problem, Inf. Proc. Lett., v. 47, n. 6, pp. 301-305, 1993.
13. C. JORDAN, Sur la forme canonique des congruences du second degré et le nombre de leurs solutions, J. Math. Pures. Appls. (2), v. 17, pp. 368-402, 1872. [Abstract of results in C. R. Acad. Sci. Paris, v. 74, pp. 1093-1095, 1872.]
14. T. PITASSI, Algebraic propositional proof systems, Descriptive Complexity and Finite Models, v. 31 of DIMACS Ser. Discrete Math. Thoret. Comput. Sci. pp. 215-244, 1997.
15. L.G. VALIANT, The complexity of enumeration and reliability problems, SIAM J. Comput. v. 8, pp. 4120-421, 1979.
16. A. R. WOODS, Unsatisfiable systems of equations, over a finite field, Proc. 39th Ann. Symp. Found. Comput. Sci., pp. 202-211, 1998.