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, J., Otto, M., & Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In Lecture Notes in Computer Science (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_4
LibreCat
| Files available
| DOI
2006 | Bachelorsthesis | LibreCat-ID: 47649
Funke, R. (2006). Implementierung und Simulation von Cache-Angriffen auf AES.
LibreCat
2006 | Bachelorsthesis | LibreCat-ID: 47648 | 
Schrieb, J. (2006). Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit.
LibreCat
| Files available
2006 | Misc | LibreCat-ID: 47692 |
Naewe, S. (2006). Samplemethoden in der algorithmischen Geometrie der Zahlen.
LibreCat
| Files available
2006 | Misc | LibreCat-ID: 47691 |
Gorski, M. (2006). Boomerang- und Rechteckangriff auf AES.
LibreCat
| Files available
2005 | Dissertation | LibreCat-ID: 2913
Otto, M. (2005). Fault Attacks and Countermeasures. Universität Paderborn.
LibreCat
| Download (ext.)
2005 | Book Chapter | LibreCat-ID: 3006
Blömer, J., & May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_15
LibreCat
| Files available
| DOI
2005 | Book Chapter | LibreCat-ID: 3010
Ernst, M., Jochemsz, E., May, A., & de Weger, B. (2005). Partial Key Exposure Attacks on RSA up to Full Size Exponents. In EUROCRYPT 2005 (pp. 371–386). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_22
LibreCat
| DOI
2005 | Bachelorsthesis | LibreCat-ID: 47647
Hornkamp, C. (2005). Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve.
LibreCat
2005 | Bachelorsthesis | LibreCat-ID: 47646
Süß, T. (2005). Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven.
LibreCat
2005 | Misc | LibreCat-ID: 47693
Ernst, M. (2005). Analyse von RSA mittels Coppersmith Methode.
LibreCat
2005 | Misc | LibreCat-ID: 47694 |
Spanke, C. (2005). Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA.
LibreCat
| Files available
2004 | Book Chapter | LibreCat-ID: 3011
Blömer, J., Guajardo, J., & Krummel, V. (2004). Provably Secure Masking of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_5
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3012
Blömer, J., & May, A. (2004). A Generalized Wiener Attack on RSA. In Public Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_1
LibreCat
| Files available
| DOI
2004 | Book Chapter | LibreCat-ID: 3014
May, A. (2004). Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In Public Key Cryptography – PKC 2004 (pp. 218–230). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_16
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3015
May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In Advances in Cryptology – CRYPTO 2004 (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_13
LibreCat
| DOI
2004 | Conference Paper | LibreCat-ID: 3017
Blömer, J., Otto, M., & Seifert, J.-P. (2004). 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. https://doi.org/10.1145/948109.948151
LibreCat
| DOI
2004 | Bachelorsthesis | LibreCat-ID: 47645
Dumrauf, D. (2004). Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen.
LibreCat
2004 | Bachelorsthesis | LibreCat-ID: 47642
Herden, T. (2004). Implementierung und Evaluierung eines Angriffs auf DSA.
LibreCat
2004 | Bachelorsthesis | LibreCat-ID: 47644 |
Gesemann, S. (2004). Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes.
LibreCat
| Files available
2004 | Bachelorsthesis | LibreCat-ID: 47643 |
Gorski, M. (2004). Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven.
LibreCat
| Files available
2003 | Dissertation | LibreCat-ID: 2914
May, A. (2003). New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn.
LibreCat
| Download (ext.)
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, J., & May, A. (2003). New Partial Key Exposure Attacks on RSA. In Advances in Cryptology - CRYPTO 2003 (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45146-4_2
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3018
Blömer, J., & Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In Financial Cryptography (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45126-6_12
LibreCat
| DOI
2003 | Bachelorsthesis | LibreCat-ID: 47641
Ernst, M. (2003). Asymptotische Optimalität von LZ77 bei beschränktem Speicher.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47635
Voß, K. (2003). Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen.
LibreCat
2003 | Misc | LibreCat-ID: 47696 |
Hoppe, U. (2003). Markovprozesse zur Modellierung bei Codekompression.
LibreCat
| Files available
2003 | Bachelorsthesis | LibreCat-ID: 47636 |
Unterkirchner, C. (2003). Implementierung eines arithmetischen Dekodierers in Java.
LibreCat
| Files available
2003 | Bachelorsthesis | LibreCat-ID: 47640 |
Kuntze, D. (2003). Tabellenbasierte arithmetische Codierung.
LibreCat
| Files available
2003 | Bachelorsthesis | LibreCat-ID: 47638
Soltenborn, C. (2003). Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47637
Todtenbier, C. (2003). Implementierung eines arithmetischen Kodierers in Java.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47634
Ziegler, M. (2003). Fehlerangriffe auf spezielle Implementierungen von RSA.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47639
Lindner, M. (2003). Verkürzte Huffman-Codierung zur Codekompression.
LibreCat
2003 | Misc | LibreCat-ID: 47695 |
Ackermann, M. R. (2003). Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten.
LibreCat
| Files available
2002 | Journal Article | LibreCat-ID: 3034
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. IEEE Transactions on Information Theory, 42(6), 1737–1744. https://doi.org/10.1109/18.556670
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1994.365731
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
Blömer, J. (2002). Computing sums of radicals in polynomial time. [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. https://doi.org/10.1109/sfcs.1991.185434
LibreCat
| Files available
| DOI
2002 | Journal Article | LibreCat-ID: 35857
Blömer, J. (2002). Denesting by Bounded Degree Radicals. Algorithmica, 28(1), 2–15. https://doi.org/10.1007/s004530010028
LibreCat
| DOI
2002 | Misc | LibreCat-ID: 47698 |
Fricke, B. (2002). Construction of Pseudorandom Functions.
LibreCat
| Files available
2002 | Misc | LibreCat-ID: 47697
Deveci, D. (2002). Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems.
LibreCat
2002 | Misc | LibreCat-ID: 47699
Helbich, A. (2002). The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography.
LibreCat
2002 | Misc | LibreCat-ID: 47700
Schepers, D. (2002). Timing Attacks for Cryptosystems based on Elliptic Curves.
LibreCat
2002 | Bachelorsthesis | LibreCat-ID: 47633 |
Hoppe, U. (2002). Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47701 |
Krummel, V. (2001). Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47702 |
Otto, M. (2001). Brauer Addition-Subtraction Chains.
LibreCat
| Files available
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45022-x_22
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, J., & Seifert, J.-P. (1999). 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. https://doi.org/10.1145/301250.301441
LibreCat
| Files available
| DOI
1998 | Journal Article | LibreCat-ID: 3028
Blömer, J., & Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. Technical Report/Departement of Computer Science, ETH Zürich.
LibreCat
| Files available
1997 | Book Chapter | LibreCat-ID: 3029
Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-63397-9_5
LibreCat
| Files available
| DOI
1997 | Journal Article | LibreCat-ID: 3033
Blömer, J., Karp, R., & Welzl, E. (1997). The rank of sparse random matrices over finite fields. Random Structures \& Algorithms, (4), 407–419. 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