Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
public:papers:usenix2016 [2016-08-09 20:07] – [Q&A section] petrs | public:papers:usenix2016 [2023-06-02 09:20] (current) – xsvenda | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== The Million-Key Question – Investigating the Origins of RSA Public Keys [Usenix Sec 2016] ====== | + | ====== The Million-Key Question – Investigating the Origins of RSA Public Keys [Usenix Sec 2016, Best Paper Award] ====== |
~~NOTOC~~ | ~~NOTOC~~ | ||
**Authors: Petr Svenda, Matus Nemec, Peter Sekan, Rudolf Kvasnovsky, David Formanek, David Komarek and Vashek Matyas** | **Authors: Petr Svenda, Matus Nemec, Peter Sekan, Rudolf Kvasnovsky, David Formanek, David Komarek and Vashek Matyas** | ||
- | **Primary contact:** Petr Svenda < | + | **[[https://rsa.sekan.eu/|---> Try online classification tool!]]** |
- | <note warning> | + | |
+ | **Primary contact:** Petr Svenda | ||
**Abstract: | **Abstract: | ||
Line 12: | Line 13: | ||
* Conference page: [[https:// | * Conference page: [[https:// | ||
- | * Download author pre-print of the paper: {{: | + | |
- | * Download extended version of paper: {{: | + | |
- | * Download presentation: | + | * Download extended version of paper: {{: |
+ | * Download presentation: | ||
+ | * See 1 minute [[https:// | ||
+ | * See [[https:// | ||
+ | * {{fa> | ||
* Download [[: | * Download [[: | ||
* Try online key classification tool: http:// | * Try online key classification tool: http:// | ||
- | **Bibtex (regular paper):** | + | |
+ | **Bibtex (regular paper)** | ||
| | ||
| | ||
Line 29: | Line 35: | ||
} | } | ||
| | ||
- | **Bibtex (technical report):** | + | **Bibtex (technical report)** |
| | ||
| | ||
Line 47: | Line 53: | ||
===== Q&A section ===== | ===== Q&A section ===== | ||
- | ==Q: So what you did?== | + | ==Q: So what did you do?== |
- | A: Figured | + | A: We figured |
==Q: Is single key enough to identify source library?== | ==Q: Is single key enough to identify source library?== | ||
- | A: Sometimes yes, but mostly no. If you have 5 keys from the same source, it will be quite accurate. Try automatic tool at http:// | + | A: Sometimes yes, but mostly no. If you have 5 keys from the same source, it will be quite accurate. Try our automatic tool at [[http:// |
==Q: Can I mutually distinguish all libraries? | ==Q: Can I mutually distinguish all libraries? | ||
- | A: Not always. Source libraries introducing exactly same bias to the value of generated public moduli will be undistinguishable. | + | A: Not always. Source libraries introducing exactly same bias to the value of generated public moduli will be indistinguishable. |
- | ==Q: Can I identify | + | ==Q: Can I also identify |
A: Sometimes. The new version of a library that did not change source code of key generation method will not be distinguishable from the older one. E.g., OpenSSL 1.0.2f is not distinguishable from OpenSSL 1.0.2g, but OpenSSL 1.0.2g is distinguishable from OpenSSL 2.0.12 FIPS. | A: Sometimes. The new version of a library that did not change source code of key generation method will not be distinguishable from the older one. E.g., OpenSSL 1.0.2f is not distinguishable from OpenSSL 1.0.2g, but OpenSSL 1.0.2g is distinguishable from OpenSSL 2.0.12 FIPS. | ||
==Q: Have you tested all libraries of the world?== | ==Q: Have you tested all libraries of the world?== | ||
- | A: No. We test a lot of them, but not all. We also did not test all possible version of given library. We are also missing hardware sources | + | A: No. We tested |
==Q: How quickly will be the information leakage vulnerability you found fixed?== | ==Q: How quickly will be the information leakage vulnerability you found fixed?== | ||
- | A: Probably not soon. The fix would require changing code of key generation method for the most libraries. And developers don't like to mess with that part of crypto too often. Even if fixed in the new version, lot of old legacy libraries will use for a long time. | + | A: Probably not soon. The fix would require changing code of key generation method for the most libraries. And developers don't like to mess with that part of crypto too often. Even if fixed in the new version, |
==Q: So how can I protect my key(s)?== | ==Q: So how can I protect my key(s)?== | ||
- | A: If you need just one key, it is easy - just generate 5 keys instead of one, let all to be classified by our tool (http:// | + | A: If you need just one key, it is easy - just generate 5 keys instead of one, let all be classified by our tool ([[http:// |
- | ==Q: Are data you gathered and used publicly available? | + | ==Q: Are the data you gathered and used publicly available? |
- | A: Definitely! Download everything in datasets section and try own analysis. Please don't forget to cite us. | + | A: Definitely! Download everything in the datasets section and try your own analysis. Please don't forget to cite our Usenix paper if you will use it. |
==Q: I want to know more details!== | ==Q: I want to know more details!== | ||
Line 90: | Line 96: | ||
* //Mask value// (first column) is computed as: 2nd-7th most significant bit of modulus | 2nd least significant bit of modulus | modulus mod 3 | modulus_length_in_bits mod 2 | * //Mask value// (first column) is computed as: 2nd-7th most significant bit of modulus | 2nd least significant bit of modulus | modulus mod 3 | modulus_length_in_bits mod 2 | ||
* Probability for given group is given in percentage. If a group never produces modulus with particular mask value, sign ' | * Probability for given group is given in percentage. If a group never produces modulus with particular mask value, sign ' | ||
- | * Dataset: [[https://drive.google.com/folderview? | + | * {{fa> |
- | * Separate zip files for every library and length of RSA keys. Naming format: | + | |
- | * Dataset: | + | |
- | * Separate zip files for every library and length | + | |
- | * Dataset: [[https:// | + | |
- | * Separate binary files for every smartcard obtained using RandomData.generate() on-card method. If more files for the same card were generated, appendix _0/1/2 is used. Format: // | + | |
- | * Dataset: [[https:// | + | |
- | * Separate binary files for every smartcard obtained using RandomData.generate() on-card method. If more files for the same card were generated, appendix _0/1/2 is used. Format: // | + | |
- | * Coming soon: Filtered TLS dataset, filtered PGP dataset, filtered Certificate Transparency set | + | |
- | * Coming soon: Processing scripts | + | |