Biased RSA Private Keys: Origin Attribution of GCD-Factorable Keys

被引:3
|
作者
Janovsky, Adam [1 ,2 ]
Nemec, Matus [3 ]
Svenda, Petr [1 ]
Sekan, Peter [1 ]
Matyas, Vashek [1 ]
机构
[1] Masaryk Univ, Brno, Czech Republic
[2] Invasys, Brno, Czech Republic
[3] Linkoping Univ, Linkoping, Sweden
来源
关键词
Cryptographic library; RSA factorization; Measurement; RSA key classification; Statistical model;
D O I
10.1007/978-3-030-59013-0_25
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In 2016,.Svenda et al. (USENIX 2016, The Million-key Question) reported that the implementation choices in cryptographic libraries allow for qualified guessing about the origin of public RSA keys. We extend the technique to two new scenarios when not only public but also private keys are available for the origin attribution - analysis of a source of GCD-factorable keys in IPv4-wide TLS scans and forensic investigation of an unknown source. We learn several representatives of the bias from the private keys to train a model on more than 150 million keys collected from 70 cryptographic libraries, hardware security modules and cryptographic smartcards. Our model not only doubles the number of distinguishable groups of libraries (compared to public keys from.Svenda et al.) but also improves more than twice in accuracy w.r.t. random guessing when a single key is classified. For a forensic scenario where at least 10 keys from the same source are available, the correct origin library is correctly identified with average accuracy of 89% compared to 4% accuracy of a random guess. The technique was also used to identify libraries producing GCD-factorable TLS keys, showing that only three groups are the probable suspects.
引用
收藏
页码:505 / 524
页数:20
相关论文
共 13 条
  • [1] Origin Attribution of RSA Public Keys
    Branca, Enrico
    Abazari, Farzaneh
    Carranza, Ronald Rivera
    Stakhanova, Natalia
    SECURITY AND PRIVACY IN COMMUNICATION NETWORKS, SECURECOMM 2021, PT I, 2021, 398 : 374 - 396
  • [2] An evaluation of the RSA private keys and the presence of weak keys
    Almazari, Mahmoud M.
    Taqieddin, Eyad
    Shatnawi, Ahmed S.
    Al-Shara, Zakarea
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2023, 26 (08): : 2273 - 2284
  • [3] On the Existence of Multiple RSA Private Keys
    Wu, Chuan-Kun
    Zhao, Bin
    SECURITY AND COMMUNICATION NETWORKS, 2022, 2022
  • [4] Correcting Errors in RSA Private Keys
    Henecka, Wilko
    May, Alexander
    Meurer, Alexander
    ADVANCES IN CRYPTOLOGY - CRYPTO 2010, 2010, 6223 : 351 - 369
  • [5] Storing RSA private keys in your head
    Krivoruchko, Taisya
    Diamond, James
    Hooper, Jeff
    12TH PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING, PROCEEDINGS, 2006, : 129 - +
  • [6] Bulk GCD Computation Using a GPU to Break Weak RSA Keys
    Fujita, Toru
    Nakano, Koji
    Ito, Yasuaki
    2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, 2015, : 385 - 394
  • [7] Reducing the Complexity in the Distributed Computation of Private RSA Keys
    Lory, Peter
    INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 2009, 5594 : 250 - 263
  • [8] Recovering RSA Private Keys on Implementations with Tampered LSBs
    Patsakis, Constantinos
    PROCEEDINGS OF THE 10TH INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY (SECRYPT 2013), 2013, : 453 - 460
  • [9] A Practical Cold Boot Attack on RSA Private Keys
    Wang, Tian
    Cui, Xiaoxin
    Ni, Yewen
    Yu, Dunshan
    Cui, Xiaole
    Qu, Gang
    PROCEEDINGS OF THE 2017 ASIAN HARDWARE ORIENTED SECURITY AND TRUST SYMPOSIUM (ASIANHOST), 2017, : 55 - 60
  • [10] Reconstructing RSA Private Keys from Random Key Bits
    Heninger, Nadia
    Shacham, Hovav
    ADVANCES IN CRYPTOLOGY - CRYPTO 2009, 2009, 5677 : 1 - +