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

M. Grassl, B. Langenberg, M. Roetteler, and R. Steinwandt, Applying Grover???s Algorithm to AES: Quantum Resource Estimates, pp.29-43, 2016.
DOI : 10.1007/978-3-319-29360-8_3

URL : http://arxiv.org/pdf/1512.04965

F. L. Traversa, C. Ramella, F. Bonani, and M. D. Ventra, Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states, Science Advances, vol.1, issue.6, 2015.
DOI : 10.1126/sciadv.1500031

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

G. Smith, On the Foundations of Quantitative Information Flow, Foundations of Software Science and Computational Structures, 12th International Conference, pp.288-302, 2009.
DOI : 10.1137/060651380

F. Biondi, T. Given-wilson, and A. Legay, Attainable unconditional security for shared-key cryptosystems, 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, pp.1-8, 2015.
DOI : 10.1109/trustcom.2015.370

URL : https://hal.archives-ouvertes.fr/hal-01233185

F. Biondi, T. Given-wilson, and A. Legay, Attainable unconditional security for shared-key cryptosystems, Information Sciences, vol.369, pp.80-99, 2016.
DOI : 10.1016/j.ins.2016.06.019

URL : https://hal.archives-ouvertes.fr/hal-01233185

M. H. Khouzani and P. Malacaria, Relative Perfect Secrecy: Universally Optimal Strategies and Channel Design, 2016 IEEE 29th Computer Security Foundations Symposium (CSF), pp.61-76, 2016.
DOI : 10.1109/CSF.2016.12

B. Köpf and D. A. Basin, Automatically deriving information-theoretic bounds for adaptive side-channel attacks, Journal of Computer Security, vol.19, issue.1, pp.1-31, 2011.
DOI : 10.3233/JCS-2009-0397

C. E. Shannon, A mathematical theory of communication The Bell system technical journal, pp.379-423, 1948.

J. L. Massey, On probabilistic encipherment, 1987.

C. G. Günther, A Universal Algorithm for Homophonic Coding, Workshop on the Theory and Application of of Cryptographic Techniques, pp.405-414, 1988.
DOI : 10.1007/3-540-45961-8_37

H. N. Jendal, Y. J. Kuhn, and J. L. Massey, An Information-Theoretic Treatment of Homophonic Substitution, Workshop on the Theory and Application of of Cryptographic Techniques, pp.382-394, 1989.
DOI : 10.1007/3-540-46885-4_38

A. Rényi, On measures of entropy and information, Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability Contributions to the Theory of Statistics, pp.547-561, 1961.

M. H. Khouzani and P. Malacaria, Leakage-Minimal Design: Universality, Limitations, and Applications, 2017 IEEE 30th Computer Security Foundations Symposium (CSF), 2017.
DOI : 10.1109/CSF.2017.40

A. Russell and H. Wang, How to fool an unbounded adversary with a short key, International Conference on the Theory and Applications of Cryptographic Techniques, pp.133-148, 2002.

Y. Dodis and A. Smith, Entropic Security and the Encryption of High Entropy Messages, Theory of Cryptography Conference, pp.556-577, 2005.
DOI : 10.1007/978-3-540-30576-7_30

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

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

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

M. S. Alvim, K. Chatzikokolakis, A. Mciver, C. Morgan, C. Palamidessi et al., Axioms for Information Leakage, 2016 IEEE 29th Computer Security Foundations Symposium (CSF), pp.77-92, 2016.
DOI : 10.1109/CSF.2016.13

URL : https://hal.archives-ouvertes.fr/hal-01330414

F. Biondi, A. Legay, P. Malacaria, and A. Wasowski, Quantifying information leakage of randomized protocols, Theoretical Computer Science, vol.597, pp.62-87, 2015.
DOI : 10.1016/j.tcs.2015.07.034

URL : https://hal.archives-ouvertes.fr/hal-01088193

P. Malacaria, Algebraic foundations for information theoretical, probabilistic and guessability measures of information flow, 1101.