Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1542236,
author = {Sedláček, Vladimír and Klinec, Dušan and Sýs, Marek and Švenda, Petr and Matyáš, Václav},
address = {Prague, Czech Republic},
booktitle = {Proceedings of the 16th International Joint Conference on e-Business and Telecommunications (ICETE 2019) - Volume 2: SECRYPT},
doi = {http://dx.doi.org/10.5220/0007786600250036},
keywords = {Backdoor; complex multiplication; integer factorization; RSA security; smartcard},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Prague, Czech Republic},
isbn = {978-989-758-378-0},
pages = {25-36},
publisher = {SCITEPRESS},
title = {I want to break square-free: The 4p - 1 factorization method and its RSA backdoor viability},
year = {2019}
}
TY - JOUR
ID - 1542236
AU - Sedláček, Vladimír - Klinec, Dušan - Sýs, Marek - Švenda, Petr - Matyáš, Václav
PY - 2019
TI - I want to break square-free: The 4p - 1 factorization method and its RSA backdoor viability
PB - SCITEPRESS
CY - Prague, Czech Republic
SN - 9789897583780
KW - Backdoor
KW - complex multiplication
KW - integer factorization
KW - RSA security
KW - smartcard
N2 - We analyze Cheng’s 4p - 1 factorization method as the means of a potential backdoor for the RSA primes generated inside black-box devices like cryptographic smartcards. We devise three detection methods for such a backdoor and also audit 44 millions of RSA keypairs generated by 18 different types of cryptographic devices. Finally, we present an improved, simplified and asymptotically deterministic version of the method, together with a deeper analysis of its performance and we offer a public implementation written in Sage.
ER -
SEDLÁČEK, Vladimír, Dušan KLINEC, Marek SÝS, Petr ŠVENDA a Václav MATYÁŠ. I want to break square-free: The 4p - 1 factorization method and its RSA backdoor viability. Online. In \textit{Proceedings of the 16th International Joint Conference on e-Business and Telecommunications (ICETE 2019) - Volume 2: SECRYPT}. Prague, Czech Republic: SCITEPRESS, 2019, s.~25-36. ISBN~978-989-758-378-0. Dostupné z: https://dx.doi.org/10.5220/0007786600250036.
|
