文件名称:510
介绍说明－－下载内容均来自于网络，请自行研究使用
We show that an RSA private key with small public exponent can be eciently recovered
given a 0.27 fraction of its bits at random. An important application of this work is to the
\cold boot" attacks of Halderman et al. We make new observations about the structure of RSA
keys that allow our algorithm to make use of the redundant information in the typical storage
format of an RSA private key. Our algorithm itself is elementary and does not make use of the
lattice techniques used in other RSA key reconstruction problems. We give an analysis of the
running time behavior of our algorithm that matches the threshold phenomenon observed in
our experiments.
given a 0.27 fraction of its bits at random. An important application of this work is to the
\cold boot" attacks of Halderman et al. We make new observations about the structure of RSA
keys that allow our algorithm to make use of the redundant information in the typical storage
format of an RSA private key. Our algorithm itself is elementary and does not make use of the
lattice techniques used in other RSA key reconstruction problems. We give an analysis of the
running time behavior of our algorithm that matches the threshold phenomenon observed in
our experiments.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
510.pdf