Search

Your search keyword '"Rioul, Olivier"' showing total 26 results
Start Over Author "Rioul, Olivier" Topic [info.info-it] computer science [cs]/information theory [cs.it]
26 results on '"Rioul, Olivier"'

1. The life and work of Kolmogorov

Author

Rioul, Olivier and Rioul, Olivier

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [MATH] Mathematics [math], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST]
Abstract

Andrei Kolmogorov is one of the greatest mathematicians of the 20th century. He revolutionized every subject he approached from a surprisingly original perspective with astonishing insight and imagination...

Published
2022

2. Evaluation of side-channel attacks using alpha-information

Author

Liu, Yi, Cheng, Wei, Guilley, Sylvain, Rioul, Olivier, and Rioul, Olivier

Subjects
[MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract

Mutual information as an information-theoretic tool has been frequently used in many security analyses. Ch ́erisey et al. used Shannon information- theoretic tools to establish some universal inequalities between the probabil- ity of success of a side-channel attack and the minimum number of queries to reach a given success rate. α-information theory is a generalization of clas- sic information-theoretic tools which seems more persuasive in a side-channel context. Such metrics include R ́enyi’s α-entropy, α-divergence, Arimoto’s con- ditional α-entropy, Sibson’s α-information, etc.In this work, we aim at extending the work of Ch ́erisey et al. to α-information quantities depending on a parameter α. A conditional version of Sibson’s α- information is defined using a simple closed-form expression. Our definition of conditional α-information satisfies important properties such as consistency, uni- form expansion, and data processing inequalities, while other previous proposals do not satisfy all of these properties. Based on our proposal and a generalized Fano inequality, we extend the case α = 1 of previous works to any α > 0, and obtain sharp universal upper bounds for the probability of success of any type of side-channel attack. It turns out the bound is improved as α increases, and it is already very tight when α = 2.

Published
2022

3. Rényi Entropy Power and Normal Transport

Author

Rioul, Olivier, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, IEICE, and Rioul, Olivier

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract

International audience; A framework for deriving Rényi entropy-power inequalities (REPIs) is presented that uses linearization and an inequality of Dembo, Cover, and Thomas. Simple arguments are given to recover the previously known Rényi EPIs and derive new ones, by unifying a multiplicative form with constant c and a modification with exponent α of previous works. An information-theoretic proof of the Dembo-Cover-Thomas inequality-equivalent to Young's convolutional inequality with optimal constants-is provided, based on properties of Rényi conditional and relative entropies and using transportation arguments from Gaussian densities. For log-concave densities, a transportation proof of a sharp varentropy bound is presented. This work was partially presented at the 2019 Information Theory and Applications Workshop, San Diego, CA.

Published
2020

4. Rényi Entropy Estimation for Secure Silicon Fingerprints

Author

Schaub, Alexander, Rioul, Olivier, Guilley, Sylvain, Danger, Jean-Luc, Boutros, Joseph, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Secure-IC S.A.S, Institut Mines-Télécom [Paris] (IMT), Secure and Safe Hardware (SSH), Electrical and Computer Engineering Department | Texas A&M University at Qatar, UCSD, and Rioul, Olivier

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience

Published
2020

5. Alpha-leakage via Fano's inequality for alpha-information

Author

Rioul, Olivier, Rioul, Olivier, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, and UCSD

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], ComputingMilieux_MISCELLANEOUS, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract

International audience

Published
2020

6. Transportation proofs of Rényi entropy power inequalities

Author

Rioul, Olivier, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, and Rioul, Olivier

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract

International audience; A framework for deriving Rényi entropy-power inequalities (EPIs) is presented that uses linearization and an inequality of Dembo, Cover, and Thomas. Simple arguments are given to recover the previously known Rényi EPIs and derive new ones, by unifying a multiplicative form with con- stant c and a modification with exponent α of previous works. An information-theoretic proof of the Dembo-Cover-Thomas inequality—equivalent to Young’s convolutional inequality with optimal constants—is provided, based on properties of Rényi conditional and relative entropies and using transportation ar- guments from Gaussian densities. For log-concave densities, a transportation proof of a sharp varentropy bound is presented.

Published
2019

7. Asymptotic Normality of Q-ary Linear Codes

Author

Shi, Minjia, Rioul, Olivier, Solé, Patrick, Rioul, Olivier, Anhui University [Hefei], Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Institut de Mathématiques de Marseille (I2M), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), and Centre National de la Recherche Scientifique (CNRS)

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; Sidel’nikov proved in 1971 that the weight distribution of long binary codes is asymptotically Gaus- sian. Delsarte sketched in 1975 an extension of this result to Q-ary codes when Q > 2. In this note, we complete Delsarte’s proof.

Published
2019

8. Matrix entropy-power inequality via normal transport

Author

Rioul, Olivier, Zamir, Ram, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, and Rioul, Olivier

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract

International audience

Published
2018

9. Teoria da informação e da codificação

Author

Rioul, Olivier, Rioul, Olivier, and Editora da Unicamp / Editora da Universidade de Brasilia

Subjects
[MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract

Livro de referência que trata da teoria da informação em detalhes, desde a apresentação das ferramentas básicas da teoria (entropia, divergência, informação mútua, teorema de tratamento de dados, informação de Fisher e variância entrópica) até a demonstração dos teoremas de Shannon (para a codificação de fonte com ou sem perdas, a codificação de canal e a codificação conjunta fonte/canal). Seu público-alvo são os pesquisadores e engenheiros de telecomunicações, assim como os estudantes universitários interessados no tema.

Published
2018

10. Préface

Author

Rioul, Olivier and HAL, TelecomParis

Subjects
[MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], ComputingMilieux_MISCELLANEOUS
Published
2018

11. Optimal attacks for multivariate and multi-model side-channel leakages

Author

Bruneau, Nicolas, Guilley, Sylvain, Heuser , Annelie, Damien, Marion, Rioul, Olivier, Secure and Safe Hardware (SSH), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Secure-IC S.A.S, Institut Mines-Télécom [Paris] (IMT), Communications Numériques (COMNUM), and Rioul, Olivier

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience

Published
2016

12. SECRET KEY ESTIMATION METHODS AND DEVICES

Author

Rioul, Olivier, Guilley, Sylvain, Département Communications & Electronique (COMELEC), Télécom ParisTech, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Secure and Safe Hardware (SSH), Rioul, Olivier, and Institut Polytechnique de Paris (IP Paris)

Subjects
TheoryofComputation_MISCELLANEOUS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract

A secret key estimation device is provided for determining an estimate of at least one secret key used during a number of executions of a cryptographic function used by at least one cryptographic algorithm. The number of executions of the cryptographic function is at least equal to two. The secret key estimation device comprises an analysis unit for determining a plurality of sets of leakage traces from a side-channel information acquired during the number of executions of the cryptographic function. Each set of leakage traces corresponds to an execution of the cryptographic function and comprising at least one leakage trace. The secret key estimation device further comprises a processing unit configured to determine a statistical distribution of the acquired plurality of sets of leakage traces. The statistical distribution is dependent on a leakage function, the leakage function being represented in a basis of functions by a set of real values. The secret key estimation device is configured to determine the secret key from the statistical distribution of the plurality of sets of leakage traces using an estimation algorithm according to the maximization of a performance metric.

Published
2016

13. METHODS AND DEVICES FOR ESTIMATING SECRET VALUES

Author

Rioul, Olivier, Guilley, Sylvain, Rioul, Olivier, Département Communications & Electronique (COMELEC), Télécom ParisTech, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, and Secure and Safe Hardware (SSH)

Subjects
TheoryofComputation_MISCELLANEOUS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract

The invention generally relates to cryptographic systems and in particular to methods and devices for estimating secret values used in cryptographic mechanisms.

Published
2015

14. METHODS FOR RECOVERING SECRET DATA OF A CRYPTOGRAPHIC DEVICE AND FOR EVALUATING THE SECURITY OF SUCH A DEVICE

Author

Guilley, Sylvain, Heuser , Annelie, Rioul, Olivier, Secure and Safe Hardware (SSH), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Communications Numériques (COMNUM), and Rioul, Olivier

Subjects
TheoryofComputation_MISCELLANEOUS, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract

The invention relates to the field of security of cryptographic systems. More specifically, it relates to a method for recovering secret data, e.g. a secret, key of a cryptographic device, i.e. to a method of “attacking” the cryptographic device to gain access to concealed information. The invention also relates to a method for evaluating the security of a cryptographic system, i.e. its resistance to attacks aiming at gaining access to its key, or moregenerally to a secret information contained within said system.

Published
2014

15. Success rate exponents for side-channel attacks

Author

Guilley, Sylvain, Heuser, Annelie, Ren, Martial, Rioul, Olivier, Sellem, Simon, Secure and Safe Hardware (SSH), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Secure-IC S.A.S, Institut Mines-Télécom [Paris] (IMT), Communications Numériques (COMNUM), and Rioul, Olivier

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience

Published
2014

16. Maximizing the success of a side-channel attack

Author

Heuser , Annelie, Guilley, Sylvain, Rioul, Olivier, Rioul, Olivier, Secure and Safe Hardware (SSH), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Secure-IC S.A.S, Institut Mines-Télécom [Paris] (IMT), Communications Numériques (COMNUM), and Institut Mines-Télécom

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience

Published
2014

17. Success metric: An all-in-one criterion for comparing side-channel distinguishers

Author

Heuser, Annelie, Guilley, Sylvain, Rioul, Olivier, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Secure and Safe Hardware (SSH), Secure-IC S.A.S, Institut Mines-Télécom [Paris] (IMT), Guido Bertoni, Jean-Sébastien Coron, and Rioul, Olivier

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience

Published
2013

18. Side-channel attacks

Author

Heuser , Annelie, Guilley, Sylvain, Rioul, Olivier, Rioul, Olivier, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Secure and Safe Hardware (SSH), Secure-IC S.A.S, and Institut Mines-Télécom [Paris] (IMT)

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience

Published
2013

19. Contributions aux théories des ondelettes, du codage conjoint source-canal et de l'information

Author

Rioul, Olivier, Rioul, Olivier, Département Communications & Electronique (COMELEC), Télécom ParisTech, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Université Pierre et Marie Curie, and Georges Alquié

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Information theory, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Wavelets, [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], Codage source-canal conjoint, Théorie de l’information, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], Ondelettes, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Joint source-channel coding, [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Published
2009

20. Codage source/canal combiné: Impact du codage BCH sur la compression d'images

Author

Gabay, Abraham, Rioul, Olivier, Duhamel, Pierre, Rioul, Olivier, Laboratoire Traitement et Communication de l'Information (LTCI), Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), Laboratoire des signaux et systèmes (L2S), and CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)

Subjects
[MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience

Published
1999

21. L'éloge de la paresse en codage conjoint source/canal

Author

Bergot, François-Xavier, Rioul, Olivier, Rioul, Olivier, Laboratoire Traitement et Communication de l'Information (LTCI), and Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience

Published
1998

22. Exploitation de la redondance résiduelle pour combattre le bruit

Author

Gabay, Abraham, Duhamel, Pierre, Rioul, Olivier, Rioul, Olivier, Laboratoire Traitement et Communication de l'Information (LTCI), Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), Laboratoire des signaux et systèmes (L2S), and CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)

Subjects
[MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience

Published
1998

23. This is IT: A Primer on Shannon’s Entropy and Information

Author

Olivier Rioul, Institut Polytechnique de Paris (IP Paris), Département Communications & Electronique (COMELEC), Télécom ParisTech, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Bertrand Duplantier and Vincent Rivasseau, and Rioul, Olivier

Subjects
Shannon's source coding theorem, Logarithm, Computer science, Entropy power inequality, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], Information theory, Notation, Exponential function, Shannon’s entropy, [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], Channel coding theorem, restrict, Shannon’s capacity formula, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], Information inequality, Entropy (information theory), Entropy power, Source coding theorem, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], Mathematical economics
Abstract

International audience; What is Shannon’s information theory (IT)? Despite its continued impact on our digital society, Claude Shannon’s life and work is still unknown to numerous people. In this tutorial, we review many aspects of the concept of entropy and information from a historical and mathematical point of view. The text is structured into small, mostly independent sections, each covering a particular topic. For simplicity we restrict our attention to one-dimensional variables and use logarithm and exponential notations log and exp without specifying the base. We culminate with a simple exposition of a recent proof (2017) of the entropy power inequality (EPI), one of the most fascinating inequalities in the theory.

Published
2021

24. Persistent Fault Analysis with Few Encryptions

Author

Sylvain Guilley, Sébastien Carré, Olivier Rioul, Secure-IC S.A.S, Institut Mines-Télécom [Paris] (IMT), Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, and Rioul, Olivier

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Computational complexity theory, Distribution (number theory), [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, Computer science, [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], 01 natural sciences, Maximum Likelihood Distinguisher, [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], Persistent Fault Analysis, 0103 physical sciences, Ciphertext, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing, Block cipher, 010302 applied physics, Substitution (logic), [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], Estimator, [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], Plaintext, [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], Expression (mathematics), 020202 computer hardware & architecture, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], Substitution Box, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], Key Enumeration, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Algorithm
Abstract

International audience; Persistent fault analysis (PFA) consists in guessing block cipher secret keys by biasing their substitution box. This paper improves the original attack of Zhang et al. on AES-128 presented at CHES 2018. By a thorough analysis, the exact probability distribution of the ciphertext (under a uniformly distributed plaintext) is derived, and the maximum likelihood key recovery estimator is computed exactly. Its expression is turned into an attack algorithm, which is shown to be twice more efficient in terms of number of required encryptions than the original attack of Zhang et al. This algorithm is also optimized from a computational complexity standpoint. In addition, our optimal attack is naturally amenable to key enumeration, which expedites full 16-bytes key extraction. Various tradeoffs between data and computational complexities are investigated.

Published
2021

25. Challenge codes for physically unclonable functions with Gaussian delays: A maximum entropy problem

Author

Jean-Luc Danger, Alexander Schaub, Olivier Rioul, Joseph J. Boutros, Sylvain Guilley, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Secure and Safe Hardware (SSH), Secure-IC S.A.S, Institut Mines-Télécom [Paris] (IMT), Texas A&M University at Qatar, and Rioul, Olivier

Subjects
[MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Computer Networks and Communications, Gaussian, Binary number, Multivariate normal distribution, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Microbiology, [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], symbols.namesake, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, Entropy (information theory), [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], Mathematics, Discrete mathematics, Algebra and Number Theory, Computer Science::Information Retrieval, Applied Mathematics, Principle of maximum entropy, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], 020206 networking & telecommunications, [SPI.TRON]Engineering Sciences [physics]/Electronics, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], 010201 computation theory & mathematics, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], ComputingMethodologies_DOCUMENTANDTEXTPROCESSING, symbols, Probability distribution, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], Random variable
Abstract

Motivated by a security application on physically unclonable functions, we evaluate the probability distributions and Renyi entropies of signs of scalar products of i.i.d. Gaussian random variables against binary codewords in \begin{document}$ \{\pm1\}^n $\end{document} . The exact distributions are determined for small values of \begin{document}$ n $\end{document} and upper bounds are provided by linking this problem to the study of Boolean threshold functions. Finally, Monte-Carlo simulations are used to approximate entropies up to \begin{document}$ n = 10 $\end{document} .

Published
2018

26. Information theory: An analysis and design tool for HCI

Author

Wanyu Liu, Antti Oulasvirta, Olivier Rioul, Michel Beaudouin-Lafon, Yves Guiard, Communications Numériques (COMNUM), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Communications & Electronique (COMELEC), Télécom ParisTech, Institut de Recherche et Coordination Acoustique/Musique (IRCAM), Aalto University, Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Extreme Interaction (EX-SITU), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Design, Interaction, Visualization & Applications (DIVA), Département Informatique et Réseaux (INFRES), Human-Centered Computing (LRI) (HCC - LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), European Project: 695464,ERC,ONE(2016), European Project: 637991,H2020,ERC-2014-STG,COMPUTED(2015), Rioul, Olivier, Unified Principles of Interaction - ONE - - ERC2016-10-01 - 2021-09-30 - 695464 - VALID, and Computational User Interface Design - COMPUTED - - H20202015-04-01 - 2020-03-31 - 637991 - VALID

Subjects
Optimization, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Information theory, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, Entropy, Performance, [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], InformationSystems_MODELSANDPRINCIPLES, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [MATH.MATH-ST] Mathematics [math]/Statistics [math.ST], [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR], HCI, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], Mutual information, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Model
Abstract

Position Paper; International audience; Shannon’s information theory, since its first introduction in 1948, has received much attention and successful applications in many domains. Apart from Fitts’ law and Hick’s law, which came out when experimental psychologists were enthusiastic about applying information theory to various areas of psychology, the relation of information theory to human-computer interaction (HCI) has not been clear. Even the two above-mentioned “laws” remain controversial in both psychology and HCI. On the other hand, in recent years, information theory has started to directly inspire or contribute to HCI research.

Catalog

Books, media, physical & digital resources
See catalog results