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.
229 Publications
- 1
- 2
- 3
- 4 (current)
- 5
2006 | Book Chapter | LibreCat-ID: 3007
Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” In Lecture Notes in Computer Science, 36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_4.
LibreCat
| Files available
| DOI
2006 | Bachelorsthesis | LibreCat-ID: 47649
Funke, Rafael. Implementierung und Simulation von Cache-Angriffen auf AES, 2006.
LibreCat
2006 | Bachelorsthesis | LibreCat-ID: 47648 | 
Schrieb, Jonas. Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit, 2006.
LibreCat
| Files available
2006 | Misc | LibreCat-ID: 47692 |
Naewe, Stefanie. Samplemethoden in der algorithmischen Geometrie der Zahlen, 2006.
LibreCat
| Files available
2006 | Misc | LibreCat-ID: 47691 |
Gorski, Michael. Boomerang- Und Rechteckangriff Auf AES, 2006.
LibreCat
| Files available
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.” In EUROCRYPT 2005, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. https://doi.org/10.1007/11426639_15.
LibreCat
| Files available
| DOI
2005 | Book Chapter | LibreCat-ID: 3010
Ernst, Matthias, Ellen Jochemsz, Alexander May, and Benne de Weger. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” In EUROCRYPT 2005, 371–86. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. https://doi.org/10.1007/11426639_22.
LibreCat
| DOI
2005 | Bachelorsthesis | LibreCat-ID: 47647
Hornkamp, Christian. Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve, 2005.
LibreCat
2005 | Bachelorsthesis | LibreCat-ID: 47646
Süß, Tim. Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven, 2005.
LibreCat
2005 | Misc | LibreCat-ID: 47693
Ernst, Matthias. Analyse von RSA mittels Coppersmith Methode, 2005.
LibreCat
2005 | Misc | LibreCat-ID: 47694 |
Spanke, Christoph. Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA, 2005.
LibreCat
| Files available
2004 | Book Chapter | LibreCat-ID: 3011
Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.” In Selected Areas in Cryptography, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/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.” In Public Key Cryptography – PKC 2004, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/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.” In Public Key Cryptography – PKC 2004, 218–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/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.” In Advances in Cryptology – CRYPTO 2004, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. https://doi.org/10.1007/978-3-540-28628-8_13.
LibreCat
| DOI
2004 | Conference Paper | LibreCat-ID: 3017
Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” In Proceedings of the 10th ACM Conference on Computer and Communication Security - CCS ’03. ACM Press, 2004. https://doi.org/10.1145/948109.948151.
LibreCat
| DOI
2004 | Bachelorsthesis | LibreCat-ID: 47645
Dumrauf, Dominic. Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen, 2004.
LibreCat
2004 | Bachelorsthesis | LibreCat-ID: 47642
Herden, Tim. Implementierung und Evaluierung eines Angriffs auf DSA, 2004.
LibreCat
2004 | Bachelorsthesis | LibreCat-ID: 47644 |
Gesemann, Sebastian. Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes, 2004.
LibreCat
| Files available
2004 | Bachelorsthesis | LibreCat-ID: 47643 |
Gorski, Michael. Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven, 2004.
LibreCat
| Files available
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.” In Advances in Cryptology - CRYPTO 2003, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/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).” In Financial Cryptography, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45126-6_12.
LibreCat
| DOI
2003 | Bachelorsthesis | LibreCat-ID: 47641
Ernst, Matthias. Asymptotische Optimalität von LZ77 bei beschränktem Speicher, 2003.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47635
Voß, Kerstin. Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen, 2003.
LibreCat
2003 | Misc | LibreCat-ID: 47696 |
Hoppe, Ulrich. Markovprozesse zur Modellierung bei Codekompression, 2003.
LibreCat
| Files available
2003 | Bachelorsthesis | LibreCat-ID: 47636 |
Unterkirchner, Claudia. Implementierung eines arithmetischen Dekodierers in Java, 2003.
LibreCat
| Files available
2003 | Bachelorsthesis | LibreCat-ID: 47640 |
Kuntze, Daniel. Tabellenbasierte arithmetische Codierung, 2003.
LibreCat
| Files available
2003 | Bachelorsthesis | LibreCat-ID: 47638
Soltenborn, Christian. Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision, 2003.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47637
Todtenbier, Christian. Implementierung eines arithmetischen Kodierers in Java, 2003.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47634
Ziegler, Max. Fehlerangriffe Auf Spezielle Implementierungen von RSA, 2003.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47639
Lindner, Marvin. Verkürzte Huffman-Codierung zur Codekompression, 2003.
LibreCat
2003 | Misc | LibreCat-ID: 47695 |
Ackermann, Marcel R. Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten, 2003.
LibreCat
| Files available
2002 | Journal Article | LibreCat-ID: 3034
Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu Sudan. “Priority Encoding Transmission.” IEEE Transactions on Information Theory 42, no. 6 (2002): 1737–44. https://doi.org/10.1109/18.556670.
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority Encoding Transmission.” In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press, 2002. https://doi.org/10.1109/sfcs.1994.365731.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 2002. https://doi.org/10.1109/sfcs.1991.185434.
LibreCat
| Files available
| DOI
2002 | Journal Article | LibreCat-ID: 35857
Blömer, J. “Denesting by Bounded Degree Radicals.” Algorithmica 28, no. 1 (2002): 2–15. https://doi.org/10.1007/s004530010028.
LibreCat
| DOI
2002 | Misc | LibreCat-ID: 47698 |
Fricke, Birgitta. Construction of Pseudorandom Functions, 2002.
LibreCat
| Files available
2002 | Misc | LibreCat-ID: 47697
Deveci, Deniz. Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems, 2002.
LibreCat
2002 | Misc | LibreCat-ID: 47699
Helbich, Anke. The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography, 2002.
LibreCat
2002 | Misc | LibreCat-ID: 47700
Schepers, Daniel. Timing Attacks for Cryptosystems Based on Elliptic Curves, 2002.
LibreCat
2002 | Bachelorsthesis | LibreCat-ID: 47633 |
Hoppe, Ulrich. Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen, 2002.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47701 |
Krummel, Volker. Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael, 2001.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47702 |
Otto, Martin. Brauer Addition-Subtraction Chains, 2001.
LibreCat
| Files available
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. https://doi.org/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.” In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99. ACM Press, 1999. https://doi.org/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.” In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. https://doi.org/10.1007/3-540-63397-9_5.
LibreCat
| Files available
| DOI
1997 | Journal Article | LibreCat-ID: 3033
Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random Matrices over Finite Fields.” Random Structures \& Algorithms, no. 4 (1997): 407–19. https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y.
LibreCat
| DOI
- 1
- 2
- 3
- 4 (current)
- 5