- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources5
- Resource Type
-
02000030000
- More
- Availability
-
50
- Author / Contributor
- Filter by Author / Creator
-
-
Albrecht, Martin (4)
-
Bernhard, Stefan (2)
-
Li, Mo (2)
-
Albrecht, Martin R (1)
-
Bai, Shi (1)
-
Collazo, Ramón (1)
-
Courville, Aimeric (1)
-
Di Felice, Rosa (1)
-
Heninger, Nadia (1)
-
Hetterscheid, Dennis G. H. (1)
-
Hoffmann, Marc P. (1)
-
Kirste, Ronny (1)
-
Li, Jianwei (1)
-
Markurt, Toni (1)
-
Mdluli, Velabo (1)
-
Mohn, Stefan (1)
-
Müller-Bunz, Helge (1)
-
Navarro, Miquel (1)
-
Niemantsverdriet, J. W. Hans (1)
-
Olivares, Marta (1)
-
- Filter by Editor
-
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Albrecht, Martin R ; Heninger, Nadia ( , EUROCRYPT 2021: Advances in Cryptology – EUROCRYPT 2021)Lattice-based algorithms in cryptanalysis often search for a target vector satisfying integer linear constraints as a shortest or closest vector in some lattice. In this work, we observe that these formulations may discard non-linear information from the underlying application that can be used to distinguish the target vector even when it is far from being uniquely close or short. We formalize lattice problems augmented with a predicate distinguishing a target vector and give algorithms for solving instances of these problems. We apply our techniques to lattice-based approaches for solving the Hidden Number Problem, a popular technique for recovering secret DSA or ECDSA keys in side-channel attacks, and demonstrate that our algorithms succeed in recovering the signing key for instances that were previously believed to be unsolvable using lattice approaches. We carried out extensive experiments using our estimation and solving framework, which we also make available with this work.more » « less
-
Mohn, Stefan ; Stolyarchuk, Natalia ; Markurt, Toni ; Kirste, Ronny ; Hoffmann, Marc P. ; Collazo, Ramón ; Courville, Aimeric ; Di Felice, Rosa ; Sitar, Zlatko ; Vennéguès, Philippe ; et al ( , Physical Review Applied)
-
Navarro, Miquel ; Smith, Christene A. ; Li, Mo ; Bernhard, Stefan ; Albrecht, Martin ( , Chemistry - A European Journal)
-
Olivares, Marta ; van der Ham, Cornelis J. M. ; Mdluli, Velabo ; Schmidtendorf, Markus ; Müller-Bunz, Helge ; Verhoeven, Tiny W. G. M. ; Li, Mo ; Niemantsverdriet, J. W. Hans ; Hetterscheid, Dennis G. H. ; Bernhard, Stefan ; et al ( , European Journal of Inorganic Chemistry)