“Ooh Aah... Just a Little Bit” : A Small Amount of Side Channel Can Go a Long Way
- 1 January 2014
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Improvement of trace-driven I-Cache timing attack on the RSA algorithmJournal of Systems and Software, 2013
- Cache-Timing Template AttacksLecture Notes in Computer Science, 2009
- A Vulnerability in RSA Implementations Due to Instruction Cache Analysis and Its Demonstration on OpenSSLLecture Notes in Computer Science, 2008
- New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software CountermeasuresPublished by Springer Science and Business Media LLC ,2007
- Solving Discrete Logarithms from Partial Knowledge of the KeyPublished by Springer Science and Business Media LLC ,2007
- On the low hamming weight discrete logarithm problem for nonadjacent representationsApplicable Algebra in Engineering, Communication and Computing, 2005
- Experimenting with Faults, Lattices and the DSALecture Notes in Computer Science, 2005
- Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problemMathematics of Computation, 2001
- Lattice basis reduction: Improved practical algorithms and solving subset sum problemsLecture Notes in Computer Science, 1991
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982