Search

Your search keyword '"Rioul, Olivier"' showing total 28 results
Start Over Author "Rioul, Olivier" Topic [math.math-st]mathematics [math]/statistics [math.st]
28 results on '"Rioul, Olivier"'

1. 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

2. 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

3. 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

4. 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

5. 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

6. 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

7. Imagine ℝ

Author

Rioul, Olivier, Zayana, Karim, 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), and Télécom ParisTech

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [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], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS
Abstract

National audience

Published
2019

8. Imagine ℝ

Author

Rioul, Olivier, Zayana, Karim, 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), and Télécom ParisTech

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [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], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS
Abstract

National audience

Published
2019

9. STAnalyzer: A simple static analysis tool for detecting cache-timing leakages

Author

Schaub, Alexander, 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, and Institut Mines-Télécom [Paris] (IMT)

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [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], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; Cache-timing attacks are a class of side-channel attacks that target software implementations of cryptographic algorithms. If the cache-access pattern of the implementation depends on sensitive information, then a cache-timing attack can retrieve this information, which can potentially lead to a secret-key recovery. Implementations which branch on condi- tions depending on sensitive information, or that access memory locations whose address depend on sensitive information, are potentially vulnerable to such attacks.This paper presents an algorithm for verifying that a program, imple- mented in the C language, is free from cache-timing leakages. It consists in computing the dependencies of all the variables used in the program, and listing all sensible values that leak due to branching and memory accesses. An implementation of this algorithm, STAnalyzer, is also pro- vided. It allows to flag sensitive values, and those are tracked across computations, function calls, etc. Therefore, only leakages of sensitive values are reported. Because the algorithm runs directly on an abstract syntaxic tree (AST) of the C program, the output is straightforward to interpret: dependencies between C variables are reported, as well as the stack of function calls and instructions that lead to the leakage of sensitive values.

Published
2019

10. Guessing a secret cryptographic key from side-channel leakages

Author

Cheng, Wei, Rioul, Olivier, Guilley, Sylvain, 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-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], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2019

11. Confused yet successful: Theoretical computation of distinguishers for monobit leakages in terms of confusion coefficient and SNR

Author

Cherisey, Eloi de, Guilley, Sylvain, Rioul, Olivier, Département Communications & Electronique (COMELEC), Télécom ParisTech, 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, Secure-IC S.A.S, Institut Mines-Télécom [Paris] (IMT), and Communications Numériques (COMNUM)

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], Side-channel distinguisher · Differential Power Analysis (DPA) · Difference of Means (DoM) · Correlation Power Analysis (CPA) · Mutual Information Analysis (MIA) · Kolmogorov-Smirnov Analysis (KSA) · Confusion coefficient · Signal-to-noise ratio · Success rate · Success exponent, [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], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; Many side-channel distinguishers (such as DPA/DoM, CPA, Euclidean Distance, KSA, MIA, etc.) have been devised and studied to extract keys from cryptographic devices. Each has pros and cons and find applications in various contexts. These distinguishers have been described theoretically in order to determine which distinguisher is best for a given context, enabling an unambiguous characterization in terms of success rate or number of traces required to extract the secret key.In this paper, we show that in the case of monobit leakages, the the- oretical expression of all distinguishers depend only on two parameters: the confusion coefficient and the signal-to-noise ratio. We provide closed- form expressions and leverage them to compare the distinguishers in terms of convergence speed for distinguishing between key candidates. This study contrasts with previous works where only the asymptotic behavior was determined—when the number of traces tends to infinity, or when the signal-to-noise ratio tends to zero.

Published
2018

12. Speed-accuracy tradeoff of aimed movement: A formal information-theoretic transmission scheme (FITTS)

Author

Gori, Julien, Rioul, Olivier, Guiard, Yves, Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Télécom ParisTech, Human-Centered Computing (LRI) (HCC - LRI), Laboratoire de Recherche en Informatique (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), Communications Numériques (COMNUM), 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), Design, Interaction, Visualization & Applications (DIVA), and Département Informatique et Réseaux (INFRES)

Subjects
channel capacity, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [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], Fitts’ law, [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [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], speed-accuracy tradeoff, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.13: Theory and methods, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS, Computer Science::Information Theory
Abstract

International audience; The rationale for Fitts’ law is that pointing tasks have the information-theoretic analogy of sending a signal over a noisy channel, thereby matching Shannon’s capacity formula. Yet, the currently received analysis is incomplete and unsatisfactory: There is no explicit communication model for pointing; there is a confusion between central concepts of capacity (a mathematical limit), throughput (an average performance measure), and bandwidth (a physical quantity); and there is also a confusion between source and channel coding so that Shannon’s Theorem 17 can be misinterpreted. We develop an information-theoretic model for pointing tasks where the index of difficulty (ID) is the expression of both a source entropy and a zero-error channel capacity. Then, we extend the model to include misses at rate ε and prove that ID should be adjusted to (1 − ε)ID. Finally, we reflect on Shannon’s channel coding theorem and argue that only minimum movement times, not performance averages, should be considered.

Published
2018

13. Teoria da informação e da codificação: Théorie de l'information et du codage

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 Editora da Unicamp / Editora da Universidade de Brasilia

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [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], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract

Tradutor: José Carlos Magossi; International audience; 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

14. Shannon et la théorie de l'information

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), and Télécom ParisTech

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [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], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; Nous fˆetions en 2016 le centenaire de la naissance de Claude Shannon, un math ́ematicien et ing ́enieur am ́ericain consid ́er ́e comme le “p`ere de l’Aˆge de l’information”. Son nom ne vous dit peut-ˆetre pas grand chose : Hollywood a glorifi ́e d’autres h ́eros scientifiques comme Alan Turing ou John Nash. Shannon, lui, a eu une vie rang ́ee, modeste... et surtout ludique : adepte du monocycle et du jonglage, il s’est amus ́e `a construire des machines plus ou moins loufoques. Dans le mˆeme temps, il a fait des avanc ́ees th ́eoriques d ́ecisives dans des domaines aussi divers que les circuits logiques, la cryptographie, l’intelligence artificielle, l’investissement boursier, le wearable computing. . . et surtout, la th ́eorie de l’information. Son article fondateur de 1948 rassemble tellement d’avanc ́ees fondamentales et de coups de g ́enie que Shannon est aujourd’hui le h ́eros de milliers de chercheurs, lou ́e presque comme une divinit ́e. On peut dire, sans exag ́erer, que c’est le math ́ematicien dont les th ́eor`emes ont rendu possible le monde du num ́erique que nous connaissons aujourd’hui. Dans cet expos ́e on d ́ecrit ses contributions les plus marquantes : le paradigme de Shannon; les mod`eles probabilistes des donn ́ees; l’unit ́e logarithmique d’information; les limites de performances; l’entropie, l’entropie relative et la d ́efinition math ́ematique de l’information; la technique du codage al ́eatoire; la formule de capacit ́e. On va jusqu’`a pr ́esenter les id ́ees des d ́emonstrations des premier et second th ́eor`emes de Shannon avec des moyens ́el ́ementaires. Si le temps le permet, on abordera une preuve r ́ecente de l’in ́egalit ́e de la puissance entropique dont Shannon a eu l’intuition g ́eniale

Published
2018

15. 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

16. Taylor Expansion of Maximum Likelihood Attacks for Masked and Shuffled Implementations

Author

Bruneau, Nicolas, Guilley, Sylvain, Heuser , Annelie, Rioul, Olivier, Standaert, François-Xavier, Teglia, Yannick, 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, Communications Numériques (COMNUM), and Université Catholique de Louvain = Catholic University of Louvain (UCL)

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

International audience

Published
2016

17. 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

18. 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

19. On Some Almost Properties

Author

Rioul, Olivier, Costa, Max H. M., 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 University of Campinas [Campinas] (UNICAMP)

Subjects
[MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]
Abstract

International audience; Previous works have shown that regular distribu- tions with differential entropy or mean-squared error behavior close to that of the Gaussian are also close to the Gaussian with respect to some distances like Kolmogorov-Smirnov or Wasserstein distances, or vice versa. In keeping with these results, we show that under the assumption of a functional dependence on the Gaussian, any regular distribution that is almost Gaussian in differential entropy has a mean-squared error behavior of an almost linear estimator. A partial converse result is established under the addition of an arbitrary independent quantity: a small mean-squared error yields a small entropy difference. The proofs use basic properties of Shannon’s information measures and can be employed in an alternative solution to the missing corner point problem of Gaussian interference channels.

Published
2016

20. 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

21. Reconciling Fitts' law with Shannon's information theory

Author

Gori, Julien, Rioul, Olivier, Guiard, Yves, 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, Design, Interaction, Visualization & Applications (DIVA), and Département Informatique et Réseaux (INFRES)

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [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], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [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], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; Shannon’s information theory has had a tremendous impact on various scientific fields in the 1950s and 1960s, including psychology [1]. In this period of time there has been a strong reaction of Shannon and colleagues [2,3] against the exaggerated use of information theoretic ideas in fields such as psychology, biology and linguistics. The fact is, Shannon’s mathematical theory of communication has been more or less put aside in psychology and is no longer considered useful today [4].What seems to be an important exception is Fitts’ law [5,6], a well-known empirical rule which predicts the average time T it takes people, under time pressure, to reach with some pointer a target of width W located at distance D. The movement time is a linear function of the index of difficulty ID which is generally given by the so-called Shannon formulation ID= log2(1 + D/W ) [7] (an ISO standard) yet other similar formulations can also be considered [8].Despite an attempt to theoretically explain Fitts’ law in terms of information theory [9], many different aspects are still unclear [10] and it seems that the only justification is a vague analogy with Shannon’s capacity theorem. Based on [11], we go beyond the analysis of [9] and derive a new mathematical approach that attempts to derive Fitts’ law from information-theoretic arguments:We first present combinatorial arguments in various geometric frameworks to account for different formulations of the index of difficulty.We then propose a simple communication channel model for rapid aimed movement leading to Fitts’ law, with discrete input (the intention of the participant) maximizing the information to be transmitted, uniform additive noise (maximizing entropy under the simple assumption of zero error) and continuous output representing the endpoint coordinates.Finally, we show that the formulation ID= log2(1+D/W) can be obtained anew by a rigorous derivation of Shannon’s capacity theorem for our simple channel model, reconciling Fitts’ law with Shannon’s theorem 17: C = W log(1 + S/N ).

Published
2015

22. On the optimality of mutual information analysis for discrete leakages

Author

Cherisey, Eloi de, Heuser , Annelie, Guilley, Sylvain, 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), and Communications Numériques (COMNUM)

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [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], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; Recent works investigated mutual information analysis (MIA) as a generic distinguisher for which the attack does not require specific information about the leakage model of the attacked device. We give a theoretical proof that MIA can be optimal in the absence of profiling, in the sense that it maximizes the empirical likelihood estimated on line from the data with a specific prediction function when no specific information about the model is known. We recover the earlier result that a non-injective prediction function is required for success. We also propose new strategies for estimating conditional entropy and mutual information using fast algorithms with shared cumulative data counts. Finally, we investigate discrete leakage models and identify various optimal exploitation strategies. In one of them, it is proved that MIA outperforms CPA. Similar schemes can be relevant in the real world, such as web side-channels where transmitted packets’ sizes and arrival times leak information.

Published
2015

23. 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

24. 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

25. On the Optimality of Mutual Information Analysis

Author

Bailly, François, Guilley, Sylvain, Heuser , Annelie, Rioul, Olivier, Université de Montréal (UdeM), 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), Embedded Security and Cryptography / Sécurité cryptographie embarquée (EMSEC), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Communications Numériques (COMNUM), Lejla Batina, Matthew Robshaw, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes)

Subjects
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [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], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2014

26. 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

27. 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

28. 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