P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. on Computing, pp.1484-1509, 1997.

F. L. Traversa, C. Ramella, F. Bonani, and M. D. Ventra, Memcomputing NPcomplete problems in polynomial time using polynomial resources and collective states, Science Advances, vol.1, issue.6, 2015.

C. E. Shannon, Communication Theory of Secrecy Systems*, Bell System Technical Journal, vol.28, issue.4, 1949.
DOI : 10.1002/j.1538-7305.1949.tb00928.x

F. Biondi, T. Given-wilson, and A. Legay, Attainable Unconditional Security for Shared-Key Cryptosystems, The 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom-15)
DOI : 10.1016/j.ins.2016.06.019
URL : https://hal.archives-ouvertes.fr/hal-01378640

F. Helsinki, Available: https, 2015.

G. Smith, On the Foundations of Quantitative Information Flow, pp.288-302, 2009.
DOI : 10.1137/060651380

F. Biondi, T. Given-wilson, and A. Legay, Attainable Unconditional Security for Shared-Key Cryptosystems, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01378640

M. S. Alvim, K. Chatzikokolakis, C. Palamidessi, and G. Smith, Measuring Information Leakage Using Generalized Gain Functions, 2012 IEEE 25th Computer Security Foundations Symposium, pp.265-279, 2012.
DOI : 10.1109/CSF.2012.26
URL : https://hal.archives-ouvertes.fr/hal-00734044

A. Mciver, C. Morgan, G. Smith, L. Espinoza, and . Meinicke, Abstract channels and their robust information-leakage ordering Held as Part of the European Joint Conferences on Theory and Practice of Software, Principles of Security and Trust -Third International Conference Proceedings, ser. Lecture Notes in Computer Science, pp.83-102, 2014.

M. Alimomeni and R. Safavi-naini, Guessing secrecy, " in Information Theoretic Security, ser. Lecture Notes in Computer Science, A. Smith, pp.1-13

M. S. Alvim, K. Chatzikokolakis, A. Mciver, C. Morgan, C. Palamidessi et al., Additive and Multiplicative Notions of Leakage, and Their Capacities, 2014 IEEE 27th Computer Security Foundations Symposium, pp.308-322, 2014.
DOI : 10.1109/CSF.2014.29
URL : https://hal.archives-ouvertes.fr/hal-00989462

C. Braun, K. Chatzikokolakis, and C. Palamidessi, Quantitative Notions of Leakage for One-try Attacks, Electronic Notes in Theoretical Computer Science, vol.249, pp.75-91, 2009.
DOI : 10.1016/j.entcs.2009.07.085
URL : https://hal.archives-ouvertes.fr/inria-00424852

M. R. Clarkson, A. C. Myers, and F. B. Schneider, Quantifying information flow with beliefs, Journal of Computer Security, vol.17, issue.5, pp.655-701, 2009.
DOI : 10.3233/JCS-2009-0353
URL : http://doi.org/10.3233/jcs-2009-0353

S. Hamadou, V. Sassone, and C. Palamidessi, Reconciling Belief and Vulnerability in Information Flow, 2010 IEEE Symposium on Security and Privacy, pp.79-92, 2010.
DOI : 10.1109/SP.2010.13
URL : https://hal.archives-ouvertes.fr/inria-00548007

T. Cover and J. Thomas, Elements of Information Theory, ser. A Wiley- Interscience publication, 2006.

S. Kotz, N. Balakrishnan, and N. Johnson, Continuous Multivariate Distributions, Models and Applications, 2004.

B. Köpf and D. A. Basin, An information-theoretic model for adaptive side-channel attacks, Proceedings of the 14th ACM conference on Computer and communications security , CCS '07, pp.286-296, 2007.
DOI : 10.1145/1315245.1315282

S. Mayzner, Tables of Single-letter and Digram Frequency Counts for Various Word-length and Letter-position Combinations, ser. Psychonomic monograph supplements, 1965.