Recovering Secrets From Prefix-Dependent Leakage
We discuss how to recover a secret bitstring given partial information obtained during a computation over that string, assuming the computation is a deterministic algorithm processing the secret bits sequentially. That abstract situation models certain types of side-channel attacks against discrete...
Main Authors: | Ferradi Houda, Géraud Rémi, Guilley Sylvain, Naccache David, Tibouchi Mehdi |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2020-06-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2015-0048 |
Similar Items
-
Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem
by: Huang Ming-Deh, et al.
Published: (2020-06-01) -
Simulation study of a tree similarity measure based on small subtree counts
by: Mindaugas Bloznelis, et al.
Published: (2009-12-01) -
Processus à valeurs dans les arbres aléatoires continus
by: Hoscheit, Patrick
Published: (2012) -
Delegating a Product of Group Exponentiations with Application to Signature Schemes (Submission to Special NutMiC 2019 Issue of JMC)
by: Crescenzo Giovanni Di, et al.
Published: (2020-10-01) -
Leaf multiplicity in a Bienaymé-Galton-Watson tree
by: Brandenberger, A.M, et al.
Published: (2022)