id: 06086100
dt: a
an: 06086100
au: Lenstra, Arjen K.; Hughes, James P.; Augier, Maxime; Bos, Joppe W.;
    Kleinjung, Thorsten; Wachter, Christophe
ti: Public keys.
so: Safavi-Naini, Reihaneh (ed.) et al., Advances in cryptology ‒ CRYPTO
    2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August
    19‒23, 2012. Proceedings. Berlin: Springer (ISBN
    978-3-642-32008-8/pbk). Lecture Notes in Computer Science 7417, 626-642
    (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: sanity check; public keys; (batch) factoring; discrete logarithm; Euclidean
    algorithm; seeding random number generators
ci: 
li: doi:10.1007/978-3-642-32009-5_37
ab: Summary: We performed a sanity check of public keys collected on the web
    and found that the vast majority works as intended. Our main goal was
    to test the validity of the assumption that different random choices
    are made each time keys are generated. We found that this is not always
    the case, resulting in public keys that offer no security. Our
    conclusion is that generating secure public keys in the real world is
    challenging. We did not study usage of public keys.
rv: