J. Ax, The elementary theory of nite elds, Annals of Mathematics, vol.88, issue.2, pp.239-271, 1968.

G. Barthe, R. Chadha, A. P. Jagannath, M. Sistla, and . Viswanathan, Automated methods for checking di erential privacy, 2019.

G. Barthe, M. Daubignard, B. Kapron, Y. Lakhnech, and V. Laporte, On the equality of probabilistic terms, 16th International Conference on Logic for Programming Arti cial Intelligence and Reasoning (LPAR'10), vol.6355, pp.46-63, 2010.

G. Barthe, B. Gregoire, C. Jacomme, S. Kremer, and P. Strub, Symbolic Methods in Computational Cryptography Proofs, 2019 IEEE 32nd Computer Security Foundations Symposium (CSF), pp.136-151, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02404701

G. Barthe, B. Grégoire, and S. Zanella-béguelin, Formal certification of code-based cryptographic proofs, ACM SIGPLAN Notices, vol.44, issue.1, pp.90-101, 2009.

B. Bichsel, T. Gehr, and M. Vechev, Fine-Grained Semantics for Probabilistic Programs, Programming Languages and Systems, vol.10801, pp.145-185, 2018.

E. Bombieri, On exponential sums in nite elds, American Journal of Mathematics, vol.88, issue.1, pp.71-105, 1966.

B. Carmer and M. Rosulek, Linicrypt: A Model for Practical Cryptography, Advances in Cryptology ? CRYPTO 2016, vol.9816, pp.416-445, 2016.

D. Chistikov, A. S. Murawski, and D. Purser, Asymmetric distances for approximate di erential privacy, 30th International Conference on Concurrency Theory (CONCUR 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019.

B. Chor, O. Goldreich, J. Håstad, J. Friedman, S. Rudich et al., The bit extraction problem of t-resilient functions (preliminary version), 26th Annual Symposium on Foundations of Computer Science (FOCS'85), pp.396-407, 1985.

B. Dwork, On the rationality of the zeta function of an algebraic variety, American Journal of Mathematics, vol.82, issue.3, pp.631-648, 1960.

G. Everest, A. Van-der-poorten, I. Shparlinski, and T. Ward, Exponential functions, linear recurrence sequences, and their applications, 2002.

M. Fredrikson and S. Jha, Satisfiability modulo counting, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14, pp.1-10, 2014.

M. Gaboardi, K. Nissim, and D. Purser, The complexity of verifying circuits as di erentially private, 2019.

W. Andrew and J. , Fun with elds, 2016.

S. Charanjit, A. Jutla, and . Roy, Decision procedures for simulatability, 17th European Symposium on Research in Computer Security (ESORICS'12), vol.7459, pp.573-590, 2012.

C. Kiefe, Sets de nable over nite elds: their zeta-functions, Transactions of the American Mathematical Society, vol.223, pp.45-59, 1976.

G. B. Alan, D. Lauder, and . Wan, Counting points on varieties over nite elds of small characteristic, 2006.

A. Legay, A. S. Murawski, J. Ouaknine, and J. Worrell, On automated veri cation of probabilistic programs, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08), vol.4963, pp.173-187, 2008.

R. Lidl and H. Niederreiter, Finite elds, 1983.

Y. Lindell, How to simulate it -A tutorial on the simulation proof technique, Tutorials on the Foundations of Cryptography, pp.277-346, 2017.

J. Michael-l-littman, M. Goldsmith, and . Mundhenk, The computational complexity of probabilistic planning, Journal of Arti cial Intelligence Research, vol.9, pp.1-36, 1998.

S. Maubach, The automorphism group over nite elds, 2001.

S. Mccallum and V. Weispfenning, Deciding polynomial-transcendental problems, Journal of Symbolic Computation, vol.47, issue.1, pp.16-31, 2012.

M. Mignotte, T. Nath-shorey, and R. Tijdeman, The distance between terms of an algebraic recurrence sequence, Journal für die reine und angewandte Mathematik, issue.349, pp.63-76, 1984.

L. Gary, D. Mullen, and . Panario, Handbook of nite elds, 2013.

A. S. Murawski and J. Ouaknine, On probabilistic program equivalence and re nement, CONCUR 2005 -Concurrency Theory, 16th International Conference, CONCUR 2005, vol.3653, pp.156-170, 2005.

T. Nipkow, Uni cation in primal algebras, their powers and their varieties, J. ACM, vol.37, issue.4, pp.742-776, 1990.

J. Ouaknine and J. Worrell, Decision problems for linear recurrence sequences, 6th International Workshop on Reachability Problems (RP'12), vol.7550, pp.21-28, 2012.

J. Ouaknine and J. Worrell, Positivity problems for low-order linear recurrence sequences, 25th ACM-SIAM Symposium on Discrete Algorithms (SODA'14), pp.366-379, 2014.

J. Toràn, An oracle characterization of the counting hierarchy, 3rd Annual Structure in Complexity Theory Conference, pp.213-223, 1988.

J. Torán, Complexity classes de ned by counting quanti ers, Journal of the ACM, vol.38, pp.753-774, 1991.

. Nk-vereshchagin, The problem of appearance of a zero in a linear recurrence sequence, Mat. Zametki, vol.38, issue.2, pp.609-615, 1985.

A. Weil, Numbers of solutions of equations in nite elds, Bulletin of the AMS, 1949.