Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors? Noboru Kunihiro1 , Naoyuki Shinohara2 , and Tetsuya Izu3 1 The University of Tokyo, Japan - Eprint - Document - PDFSEARCH.IO

First Page	Meta Content
	Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors? Noboru Kunihiro1 , Naoyuki Shinohara2 , and Tetsuya Izu3 1 The University of Tokyo, Japan Add to Reading List Document Date: 2012-12-13 19:33:04 Open Document File Size: 189,39 KB Share Result on Facebook City NICT / / Company Japan 3 Fujitsu Labs / / Country Japan / / / Facility The University of Tokyo / / Holiday Assumption / / IndustryTerm meta-algorithm / bad partial solution / natural abstract algorithm / above algorithm / eﬃcient algorithm / candidate solutions / correct solution / partial solution / polynomial time algorithm / naive algorithm / / NaturalFeature mt. Henecka et al. / / Organization University of Tokyo / / Technology following naive algorithm / encryption / above algorithm / eﬃcient algorithm / secret key / public key / proposed algorithm / polynomial time algorithm / natural abstract algorithm / Heninger-Shacham algorithm / two known algorithms / / SocialTag Public-key cryptography Error detection and correction Electronic commerce RSA XTR Bit error rate Entropy Key Cryptography Finite fields

Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors? Noboru Kunihiro1 , Naoyuki Shinohara2 , and Tetsuya Izu3 1 The University of Tokyo, JapanAdd to Reading List