Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision | ||
public:papers:secrypt2019 [2019-08-12 10:19] – [I want to break square-free: The 4p-1 factorization method and its RSA backdoor viability [SeCrypt 2019]] x408178 | public:papers:secrypt2019 [2022-01-19 12:46] – [Other materials] x408178 | ||
---|---|---|---|
Line 27: | Line 27: | ||
< | < | ||
- | @conference{secrypt19, | + | |
- | author={Vladimir Sedlacek. and Dusan Klinec. and Marek Sys. and Petr Svenda. and Vashek Matyas.}, | + | |
- | title={I Want to Break Square-free: | + | |
- | booktitle={Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT, | + | |
- | year={2019}, | + | |
- | pages={25-36}, | + | |
- | publisher={SciTePress}, | + | |
- | organization={INSTICC}, | + | |
- | doi={10.5220/ | + | |
- | isbn={978-989-758-378-0}, | + | |
- | } | + | |
+ | } | ||
</ | </ | ||
Line 54: | Line 55: | ||
===== Other materials ===== | ===== Other materials ===== | ||
* [[https:// | * [[https:// | ||
+ | * ERRATA: The final estimates in Section 5.1 of the paper are flawed. Please see pages 26-27 in [[https:// | ||
===== 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. |