Formalizing Coppersmith’s Method in Isabelle/HOL
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 14960 LNAI, Page: 127-145
2024
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Conference Paper Description
We formalize Coppersmith’s method, an algorithm for finding small (in magnitude) roots of univariate integer polynomials mod M, in the theorem prover Isabelle/HOL. Our work is motivated by the goal of moving cryptography into the realm of formal methods by formalizing not only the correctness and security arguments behind cryptographic algorithms but also the mathematics behind attacks on those algorithms. Coppersmith’s method fits into this goal as it has important applications in cryptography and is used in various attacks on the RSA algorithm for public-key cryptography. We overview and give insights into our formalization, which includes new contributions to Isabelle/HOL’s libraries, and builds on the existing formalization of the Lenstra-Lenstra-Lovász (LLL) algorithm for lattice basis reduction.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85201081249&origin=inward; http://dx.doi.org/10.1007/978-3-031-66997-2_8; https://link.springer.com/10.1007/978-3-031-66997-2_8; https://dx.doi.org/10.1007/978-3-031-66997-2_8; https://link.springer.com/chapter/10.1007/978-3-031-66997-2_8
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know