Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision		 Previous revision
Next revisionBoth sides next revision
public:papers:secrypt2019 [2019-08-12 10:02] – x408178public:papers:secrypt2019 [2022-01-19 12:53] – [Other materials] x408178
Line 27: Line 27:
  
 <collapse id="bibtex" collapsed="true"> <collapse id="bibtex" collapsed="true">
-  @Article{2019-secrypt-sedlacek, +    @conference{secrypt19, 
-    Title = {I want to break square-free: The 4p-1 factorization method and its RSA backdoor viability}, +     author={Vladimir Sedlacek and Dusan Klinec and Marek Sys and Petr Svenda and Vashek Matyas.}, 
-    Author = {Vladimir Sedlacek, Dusan Klinec, Marek Sys, Petr Svenda, Vashek Matyas}, +     title={I Want to Break Square-free: The 4p − 1 Factorization Method and Its RSA Backdoor Viability}, 
-    booktitle = {16th International Conference on Security and Cryptography (Secrypt'2019)}, +     booktitle={Proceedings of the 16th International Joint Conference on e-Business and Telecommunications (ICETE  
-    Year = {2019}, +     2019) - Volume 2: SECRYPT,}, 
-    publisher = {SCITEPRESS} +     year={2019}, 
-  }+     pages={25-36}, 
 +     publisher={SciTePress}, 
 +     organization={INSTICC}, 
 +     doi={10.5220/0007786600250036}, 
 +     isbn={978-989-758-378-0}, 
 +    }
 </collapse> </collapse>
  
Line 48: Line 53:
  
  
-===== Other materials =====+===== Other materials and notes=====
   * [[https://github.com/crocs-muni/cm_factorization | Factorization implementation, testing code and more]]   * [[https://github.com/crocs-muni/cm_factorization | Factorization implementation, testing code and more]]
 +  * ERRATA: The final estimates in Section 5.1 of the paper are flawed. Please see pages 26-27 in [[https://is.muni.cz/th/urpxn/Dissertation_thesis_final.pdf | the relevant PhD thesis]] for the correct version. However, the conclusions do not fundamentally change. 
 +  * There has been a quite interesting timeline of developments related to the method. In 2002, Cheng published [[https://eprint.iacr.org/2002/109 | a version]] working for linear Hilbert polynomials, and shortly after that, a [[https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.8.9071&rep=rep1&type=pdf | a revised version]] working for all Hilbert polynomial degrees. 
 ===== Acknowledgements ===== ===== Acknowledgements =====
-We acknowledge the support of the Czech Science Foundation, project GA16-08565S. The access to the computing and storage resources of National Grid Infrastructure MetaCentrum (LM2010005) is greatly appreciated.+We acknowledge the support of the Czech Science Foundation, project GA16-08565S. V.Sedlacek was also supported by the Brno Ph.D. Talent Scholarship (funded by the Brno City Municipality). The access to the computing and storage resources of National Grid Infrastructure MetaCentrum (LM2010005) is greatly appreciated.