loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Vladimir Sedlacek 1 ; Dusan Klinec 2 ; Marek Sys 2 ; Petr Svenda 2 and Vashek Matyas 2

Affiliations: 1 Masaryk University, Czech Republic, Ca’ Foscari University of Venice and Italy ; 2 Masaryk University and Czech Republic

Keyword(s): Backdoor, Complex Multiplication, Integer Factorization, RSA Security, Smartcard.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data Engineering ; Databases and Data Security ; Information and Systems Security ; Security in Information Systems ; Security Requirements

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.235.46.191

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 - SECRYPT; ISBN 978-989-758-378-0; ISSN 2184-3236, SciTePress, pages 25-36. DOI: 10.5220/0007786600250036

@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 - SECRYPT},
year={2019},
pages={25-36},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007786600250036},
isbn={978-989-758-378-0},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - SECRYPT
TI - I Want to Break Square-free: The 4p − 1 Factorization Method and Its RSA Backdoor Viability
SN - 978-989-758-378-0
IS - 2184-3236
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
PB - SciTePress