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


2009 | Bachelorsthesis | LibreCat-ID: 2880
Schröer, Carsten. Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern. 2009.
LibreCat | Files available
 

2009 | Bachelorsthesis | LibreCat-ID: 2896 | OA
Liske, Gennadij. Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens. 2009.
LibreCat | Files available
 

2009 | Mastersthesis | LibreCat-ID: 2904
Scholz, Christoph. Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen. 2009.
LibreCat | Files available
 

2009 | Dissertation | LibreCat-ID: 2911
Ackermann, Marcel Rudolf. Algorithms for the Bregman K-Median Problem. Universität Paderborn, 2009.
LibreCat | Download (ext.)
 

2009 | Book Chapter | LibreCat-ID: 2995
Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2009, pp. 1088–97, doi:10.1137/1.9781611973068.118.
LibreCat | DOI
 

2009 | Journal Article | LibreCat-ID: 2999
Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” Theoretical Computer Science, no. 18, 2009, pp. 1648–65, doi:10.1016/j.tcs.2008.12.045.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 3000
Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.” FM 2009: Formal Methods, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:10.1007/978-3-642-05089-3_8.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 3001
Stern, Claudius, et al. “Reliable Evidence of Data Integrity from an Untrusted Storage Service.” Fourth International Conference on Networking and Services (Icns 2008), IEEE, 2008, doi:10.1109/icns.2008.28.
LibreCat | DOI
 

2008 | Misc | LibreCat-ID: 47685 | OA
Schrieb, Jonas. Construction and Applications of Identity-Based Encryption without Pairings. 2008.
LibreCat | Files available
 

2007 | Dissertation | LibreCat-ID: 2912
Krummel, Volker. Tamper Resistance of AES -- Models, Attacks and Countermeasures. Universität Paderborn, 2007.
LibreCat | Download (ext.)
 

2007 | Book Chapter | LibreCat-ID: 3002 | OA
Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 96–109, doi:10.1007/978-3-540-77360-3_7.
LibreCat | DOI | Download (ext.)
 

2007 | Book Chapter | LibreCat-ID: 3019
May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.” Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, 2007, pp. 242–56, doi:10.1007/3-540-45708-9_16.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3020
Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3021
Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:10.1007/3-540-45537-x_26.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3022
May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 110–25, doi:10.1007/3-540-44670-2_10.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3026
Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” Algorithms — ESA’ 98, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:10.1007/3-540-68530-8_13.
LibreCat | DOI
 

2007 | Bachelorsthesis | LibreCat-ID: 47650
Ziegert, Steffen. Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem. 2007.
LibreCat
 

2007 | Bachelorsthesis | LibreCat-ID: 47651
Richert, Manuel. Sichere Kryptosysteme durch Zero-Knowledge. 2007.
LibreCat
 

2007 | Misc | LibreCat-ID: 47688
Klein, Wiebke. Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln. 2007.
LibreCat
 

2007 | Misc | LibreCat-ID: 47690
Käthler, Olga. Kryptanalyse des EAC-Protokolls biometrischer Reisepässe. 2007.
LibreCat
 

2007 | Misc | LibreCat-ID: 47687 | OA
Brieden, Benedikt. Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode. 2007.
LibreCat | Files available
 

2007 | Misc | LibreCat-ID: 47689 | OA
Kuntze, Daniel. Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz. 2007.
LibreCat | Files available
 

2007 | Misc | LibreCat-ID: 47686 | OA
Borghoff, Julia. Vergleich multivariater Varianten der Methode von Coppersmith. 2007.
LibreCat | Files available
 

2007 | Bachelorsthesis | LibreCat-ID: 2887 | OA
Landwehr, Andreas Cord. Untersuchungen zur Sicherheit einzelner RSA Bits. 2007.
LibreCat | Files available
 

2007 | Bachelorsthesis | LibreCat-ID: 47653 | OA
Klose, Jaroslaw. Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT. 2007.
LibreCat | Files available
 

2007 | Bachelorsthesis | LibreCat-ID: 47652 | OA
Niemeier, Martin. Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen. 2007.
LibreCat | Files available
 

2007 | Bachelorsthesis | LibreCat-ID: 47654 | OA
Birkner, Stefan. Behandlung von Korrekturtermen in der Methode von Coppersmith. 2007.
LibreCat | Files available
 

2006 | Journal Article | LibreCat-ID: 3003
Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” Journal of Universal Computer Science (J.UCS), no. 6, 2006, pp. 654--671, doi:10.3217/jucs-012-06-0654.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3004
Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:10.1007/11889700_11.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3005
Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:10.1007/11889700_2.
LibreCat | DOI
 

2006 | Book Chapter | LibreCat-ID: 3007
Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 36–52, doi: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 | OA
Schrieb, Jonas. Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit. 2006.
LibreCat | Files available
 

2006 | Misc | LibreCat-ID: 47692 | OA
Naewe, Stefanie. Samplemethoden in der algorithmischen Geometrie der Zahlen. 2006.
LibreCat | Files available
 

2006 | Misc | LibreCat-ID: 47691 | OA
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.” 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
 

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 | OA
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, 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
 

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 | OA
Gesemann, Sebastian. Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes. 2004.
LibreCat | Files available
 

Filters and Search Terms

department=64

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed