This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revisionBoth sides next revision |
| public:papers:secrypt2019 [2019-08-12 10:21] – x408178 | public:papers:secrypt2019 [2019-08-12 11:38] – [I want to break square-free: The 4p-1 factorization method and its RSA backdoor viability [SeCrypt 2019]] x408178 |
|---|
| <collapse id="bibtex" collapsed="true"> | <collapse id="bibtex" collapsed="true"> |
| @conference{secrypt19, | @conference{secrypt19, |
| author={Vladimir Sedlacek. and Dusan Klinec. and Marek Sys. and Petr Svenda. and Vashek Matyas.}, | 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}, | 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,}, | booktitle={Proceedings of the 16th International Joint Conference on e-Business and Telecommunications (ICETE |
| | 2019) - Volume 2: SECRYPT,}, |
| year={2019}, | year={2019}, |
| pages={25-36}, | pages={25-36}, |