This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revisionLast revisionBoth sides next revision |
public:papers:primality_esorics20 [2020-09-14 15:33] – xsvenda | public:papers:primality_esorics20 [2021-12-04 20:27] – [Summarizing video] x408178 |
---|
<button type="warning" icon="fa fa-file-pdf-o">[[https://crocs.fi.muni.cz/_media/publications/pdf/2020-esorics-foolingprimes.pdf|Pre-print PDF]]</button> | <button type="warning" icon="fa fa-file-pdf-o">[[https://crocs.fi.muni.cz/_media/publications/pdf/2020-esorics-foolingprimes.pdf|Pre-print PDF]]</button> |
\_ | \_ |
<button icon="fa fa-file-image-o">[[https://crocs.fi.muni.cz/_media/publications/pdf/2020-esorics-foolingprimes.pdf|Presentation]]</button> | <button icon="fa fa-file-image-o">[[https://crocs.fi.muni.cz/_media/publications/pdf/esorics2020_pseudoprimes_final.pdf |Presentation]]</button> |
\_ | \_ |
<button collapse="bibtex" icon="fa fa-file-code-o">BiBTeX</button> | <button collapse="bibtex" icon="fa fa-file-code-o">BiBTeX</button> |
<button type="primary" icon="fa fa-github">[[https://github.com/crocs-muni/fooling-primality-tests|GitHub]]</button> | <button type="primary" icon="fa fa-github">[[https://github.com/crocs-muni/fooling-primality-tests|GitHub]]</button> |
| |
| ===== Summarizing video ===== |
| |
| {{ https://www.youtube.com/watch?v=RJY0A2IPVLE |A formula for disaster: a unified approach to elliptic curve special-point-based attacks}} |
| |
===== Selected conclusions ===== | ===== Selected conclusions ===== |
| |
===== Acknowledgements ===== | ===== Acknowledgements ===== |
J. Jancar was supported by the grant MUNI/C/1701/2018, V.Sedlacek by the Czech Science Foundation project GA2003426S. Some of the tools used and P.Svenda were supported by the CyberSec4Europe Competence Network. Computational resources were supplied by the project e-INFRA LM2018140. | J. Jancar was supported by the grant MUNI/C/1701/2018, V.Sedlacek by the Czech Science Foundation project GA2003426S and the Brno Ph.D. Talent Scholarship (funded by the Brno City Municipality). Some of the tools used and P.Svenda were supported by the CyberSec4Europe Competence Network. Computational resources were supplied by the project e-INFRA LM2018140. |