Geodesic
On generic complexity of decidability problem for Diophantine systems in the Skolem's form
Prikladnaâ diskretnaâ matematika, no. 3 (2017), pp. 100-106.

Voir la notice de l'article provenant de la source Math-Net.Ru

Generic-case approach to algorithmic problems was suggested by Miasnikov, Kapovich, Schupp and Shpilrain in 2003. This approach studies behavior of an algorithm on typical (almost all) inputs and ignores the rest of inputs. This approach has applications in cryptography where it is required that algorithmic problems must be difficult for almost all inputs. Romankov in 2012 shows that the basic encryption functions of many public key cryptographic systems, among which the RSA system and systems, based on the intractability of the discrete logarithm problem, can be written in the language of Diophantine equations. The effective generic decidability of these equations leads to hacking of corresponding systems, therefore it is actual to study the generic complexity of the decidability problem for Diophantine equations in various formulations. For example, Rybalov in 2011 proved that the Hilbert's tenth problem remains undecidable on strongly generic subsets of inputs in the representation of Diophantine equations by so-called arithmetic schemes. In this paper, we study generic complexity of the Hilbert's tenth problem for systems of Diophantine equations in the Skolem's form. We construct generic polynomial algorithm for determination of solvability of such systems over natural numbers (without zero). We prove strongly generic undecidability of this problem for systems over integers and over natural numbers with zero.
Keywords: generic complexity
Mots-clés : diophantine equations. 
@article{PDM_2017_3_a7,
     author = {A. N. Rybalov},
     title = {On generic complexity of decidability problem for {Diophantine} systems in the {Skolem's} form},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {100--106},
     publisher = {mathdoc},
     number = {3},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2017_3_a7/}
}
TY  - JOUR
AU  - A. N. Rybalov
TI  - On generic complexity of decidability problem for Diophantine systems in the Skolem's form
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2017
SP  - 100
EP  - 106
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2017_3_a7/
LA  - ru
ID  - PDM_2017_3_a7
ER  - 
%0 Journal Article
%A A. N. Rybalov
%T On generic complexity of decidability problem for Diophantine systems in the Skolem's form
%J Prikladnaâ diskretnaâ matematika
%D 2017
%P 100-106
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2017_3_a7/
%G ru
%F PDM_2017_3_a7
A. N. Rybalov. On generic complexity of decidability problem for Diophantine systems in the Skolem's form. Prikladnaâ diskretnaâ matematika, no. 3 (2017), pp. 100-106. http://geodesic.mathdoc.fr/item/PDM_2017_3_a7/

[1] Matiyasevich Yu. V., “Diophantineity of enumerable sets”, Doklady Akademii Nauk USSR, 191:2 (1970), 279–282 (in Russian) | Zbl

[2] Matiyasevich Yu., Robinson J., “Reduction of an arbitrary Diophantine equation to one in 13 unknowns”, Acta Arithmetica, 27 (1975), 521–553 | DOI | MR | Zbl

[3] Jones J., “Undecidable Diophantine equations”, Bull. Amer. Math. Soc., 3:2 (1980), 859–862 | DOI | MR | Zbl

[4] Kapovich I., Miasnikov A., Schupp P., Shpilrain V., “Generic-case complexity, decision problems in group theory and random walks”, J. Algebra, 264:2 (2003), 665–694 | DOI | MR | Zbl

[5] Myasnikov A., Romankov V., “Diophantine cryptography in free metabelian groups: Theoretical base”, Groups, Complexity, Cryptology, 6:2 (2014), 103–120 | DOI | MR | Zbl

[6] Roman'kov V. A., “Diophantine cryptography over infinite groups”, Prikladnaya Diskretnaya Matematika, 2012, no. 2(16), 15–42 (in Russian)

[7] Roman'kov V. A., Algebraic Cryptography, OmSU Publ., Omsk, 2013 (in Russian)

[8] Rybalov A., “Generic complexity of the Diophantine problem”, Groups, Complexity, Cryptology, 5:1 (2013), 25–30 | DOI | MR | Zbl

[9] Rybalov A., “On generic undecidability of Hilbert Tenth problem”, Vestnik Omskogo Universiteta, 2011, no. 4, 19–22 (in Russian)

[10] Skolem T., Diophantische Gleichungen, Springer, Berlin, 1938 | Zbl