I Want to Break Square-free: The 4p − 1 Factorization Method and Its RSA Backdoor Viability

Vladimir Sedlacek, Dusan Klinec, Marek Sys, Petr Svenda, Vashek Matyas

2019

Abstract

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.

Paper Citation

in Harvard Style

Sedlacek V., Klinec D., Sys M., Svenda P. and Matyas V. (2019). I Want to Break Square-free: The 4p − 1 Factorization Method and Its RSA Backdoor Viability.In Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT, ISBN 978-989-758-378-0, pages 25-36. DOI: 10.5220/0007786600250036

in Bibtex Style

@conference{secrypt19,
author={Vladimir Sedlacek and Dusan Klinec and Marek Sys and Petr Svenda and Vashek Matyas},
title={I Want to Break Square-free: The 4p − 1 Factorization Method and Its RSA Backdoor Viability},
booktitle={Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT,},
year={2019},
pages={25-36},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007786600250036},
isbn={978-989-758-378-0},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT,
TI - I Want to Break Square-free: The 4p − 1 Factorization Method and Its RSA Backdoor Viability
SN - 978-989-758-378-0
AU - Sedlacek V.
AU - Klinec D.
AU - Sys M.
AU - Svenda P.
AU - Matyas V.
PY - 2019
SP - 25
EP - 36
DO - 10.5220/0007786600250036