I want to break square-free: The 4p - 1 factorization method
and its RSA backdoor viability

D 2019

I want to break square-free: The 4p - 1 factorization method and its RSA backdoor viability

SEDLÁČEK, Vladimír; Dušan KLINEC; Marek SÝS; Petr ŠVENDA; Václav MATYÁŠ et al.

Základní údaje

Originální název

I want to break square-free: The 4p - 1 factorization method and its RSA backdoor viability

Autoři

SEDLÁČEK, Vladimír; Dušan KLINEC; Marek SÝS; Petr ŠVENDA a Václav MATYÁŠ

Vydání

Prague, Czech Republic, Proceedings of the 16th International Joint Conference on e-Business and Telecommunications (ICETE 2019) - Volume 2: SECRYPT, od s. 25-36, 12 s. 2019

Nakladatel

SCITEPRESS

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Portugalsko

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

elektronická verze "online"

Označené pro přenos do RIV

Ano

Kód RIV

RIV/00216224:14330/19:00110000

Organizační jednotka

Fakulta informatiky

ISBN

978-989-758-378-0

Klíčová slova anglicky

Backdoor; complex multiplication; integer factorization; RSA security; smartcard

Štítky

core_B, firank_B

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 3. 5. 2020 12:37, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

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.

Citovat

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 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://doi.org/10.5220/0007786600250036.

@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 = {https://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  - CONF
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://doi.org/10.5220/0007786600250036.

Přehled o publikaci