Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
109 Publications
2005 | Dissertation | LibreCat-ID: 2913
Otto, Martin. Fault Attacks and Countermeasures. Universität Paderborn, 2005.
LibreCat
| Download (ext.)
2005 | Book Chapter | LibreCat-ID: 3006
Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:10.1007/11426639_15.
LibreCat
| Files available
| DOI
2005 | Book Chapter | LibreCat-ID: 3010
Ernst, Matthias, et al. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 371–86, doi:10.1007/11426639_22.
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3011
Blömer, Johannes, et al. “Provably Secure Masking of AES.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:10.1007/978-3-540-30564-4_5.
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3012
Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 1–13, doi:10.1007/978-3-540-24632-9_1.
LibreCat
| Files available
| DOI
2004 | Book Chapter | LibreCat-ID: 3014
May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.” Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 218–30, doi:10.1007/978-3-540-24632-9_16.
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3015
May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.” Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, 2004, pp. 213–19, doi:10.1007/978-3-540-28628-8_13.
LibreCat
| DOI
2004 | Conference Paper | LibreCat-ID: 3017
Blömer, Johannes, et al. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” Proceedings of the 10th ACM Conference on Computer and Communication Security - CCS ’03, ACM Press, 2004, doi:10.1145/948109.948151.
LibreCat
| DOI
2003 | Dissertation | LibreCat-ID: 2914
May, Alexander. New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn, 2003.
LibreCat
| Download (ext.)
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:10.1007/978-3-540-45146-4_2.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3018
Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” Financial Cryptography, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:10.1007/978-3-540-45126-6_12.
LibreCat
| DOI
2002 | Journal Article | LibreCat-ID: 3034
Albanese, Andres, et al. “Priority Encoding Transmission.” IEEE Transactions on Information Theory, vol. 42, no. 6, Institute of Electrical and Electronics Engineers (IEEE), 2002, pp. 1737–44, doi:10.1109/18.556670.
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., et al. “Priority Encoding Transmission.” Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002, doi:10.1109/sfcs.1994.365731.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002, doi:10.1109/sfcs.1991.185434.
LibreCat
| Files available
| DOI
2002 | Journal Article | LibreCat-ID: 35857
Blömer, J. “Denesting by Bounded Degree Radicals.” Algorithmica, vol. 28, no. 1, Springer Science and Business Media LLC, 2002, pp. 2–15, doi:10.1007/s004530010028.
LibreCat
| DOI
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” Automata, Languages and Programming, Springer Berlin Heidelberg, 2000, pp. 248–59, doi:10.1007/3-540-45022-x_22.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.” Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99, ACM Press, 1999, doi:10.1145/301250.301441.
LibreCat
| Files available
| DOI
1998 | Journal Article | LibreCat-ID: 3028
Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” Technical Report/Departement of Computer Science, ETH Zürich, 1998.
LibreCat
| Files available
1997 | Book Chapter | LibreCat-ID: 3029
Blömer, Johannes. “Denesting by Bounded Degree Radicals.” Algorithms — ESA ’97, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:10.1007/3-540-63397-9_5.
LibreCat
| Files available
| DOI
1997 | Journal Article | LibreCat-ID: 3033
Blömer, Johannes, et al. “The Rank of Sparse Random Matrices over Finite Fields.” Random Structures \& Algorithms, no. 4, 1997, pp. 407–19, doi:10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y.
LibreCat
| DOI
Filters and Search Terms
(department=64) AND (type=book OR type=book_editor OR type=book_chapter OR type=publicationtype_review OR type=conference_abstract OR type=conference_editor OR type=conference OR type=dissertation OR type=encyclopedia_article OR type=journal_article OR type=journal_editor OR type=newspaper_article OR type=patent OR type=preprint OR type=report OR type=translation OR type=translation_chapter OR type=working_paper OR type=research_data)