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
C. Schröer, Hierarchisches Clustering mit minimalen Cluster-Durchmessern. 2009.
LibreCat | Files available
 

2009 | Bachelorsthesis | LibreCat-ID: 2896 | OA
G. Liske, Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens. 2009.
LibreCat | Files available
 

2009 | Mastersthesis | LibreCat-ID: 2904
C. Scholz, Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen. 2009.
LibreCat | Files available
 

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

2009 | Book Chapter | LibreCat-ID: 2995
M. R. Ackermann and J. Blömer, “Coresets and Approximate Clustering for Bregman Divergences,” in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009, pp. 1088–1097.
LibreCat | DOI
 

2009 | Journal Article | LibreCat-ID: 2999
J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” Theoretical Computer Science, no. 18, pp. 1648–1665, 2009.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 3000
J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 3001
C. Stern, P. Adelt, V. Krummel, and M. R. Ackermann, “Reliable Evidence of Data Integrity from an Untrusted Storage Service,” in Fourth International Conference on Networking and Services (icns 2008), 2008.
LibreCat | DOI
 

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

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

2007 | Book Chapter | LibreCat-ID: 3002 | OA
J. Blömer and V. Krummel, “Analysis of Countermeasures Against Access Driven Cache Attacks on AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 96–109.
LibreCat | DOI | Download (ext.)
 

2007 | Book Chapter | LibreCat-ID: 3019
A. May, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent,” in Advances in Cryptology — CRYPTO 2002, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 242–256.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3020
J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3021
J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3022
A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution Modular Lattices,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–125.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3026
J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.
LibreCat | DOI
 

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

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

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

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

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

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

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

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

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

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

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

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

2006 | Book Chapter | LibreCat-ID: 3004
J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120.
LibreCat | DOI
 

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

2006 | Book Chapter | LibreCat-ID: 3007
J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52.
LibreCat | Files available | DOI
 

2006 | Bachelorsthesis | LibreCat-ID: 47649
R. Funke, Implementierung und Simulation von Cache-Angriffen auf AES. 2006.
LibreCat
 

2006 | Bachelorsthesis | LibreCat-ID: 47648 | OA
J. Schrieb, Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit. 2006.
LibreCat | Files available
 

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

2006 | Misc | LibreCat-ID: 47691 | OA
M. Gorski, Boomerang- und Rechteckangriff auf AES. 2006.
LibreCat | Files available
 

2005 | Dissertation | LibreCat-ID: 2913
M. Otto, Fault Attacks and Countermeasures. Universität Paderborn, 2005.
LibreCat | Download (ext.)
 

2005 | Book Chapter | LibreCat-ID: 3006
J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.
LibreCat | Files available | DOI
 

2005 | Book Chapter | LibreCat-ID: 3010
M. Ernst, E. Jochemsz, A. May, and B. de Weger, “Partial Key Exposure Attacks on RSA up to Full Size Exponents,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 371–386.
LibreCat | DOI
 

2005 | Bachelorsthesis | LibreCat-ID: 47647
C. Hornkamp, Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve. 2005.
LibreCat
 

2005 | Bachelorsthesis | LibreCat-ID: 47646
T. Süß, Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven. 2005.
LibreCat
 

2005 | Misc | LibreCat-ID: 47693
M. Ernst, Analyse von RSA mittels Coppersmith Methode. 2005.
LibreCat
 

2005 | Misc | LibreCat-ID: 47694 | OA
C. Spanke, Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA. 2005.
LibreCat | Files available
 

2004 | Book Chapter | LibreCat-ID: 3011
J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3012
J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.
LibreCat | Files available | DOI
 

2004 | Book Chapter | LibreCat-ID: 3014
A. May, “Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 218–230.
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3015
A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring,” in Advances in Cryptology – CRYPTO 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 213–219.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 3017
J. Blömer, M. Otto, and J.-P. Seifert, “A new CRT-RSA algorithm secure against bellcore attacks,” in Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03, 2004.
LibreCat | DOI
 

2004 | Bachelorsthesis | LibreCat-ID: 47645
D. Dumrauf, Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen. 2004.
LibreCat
 

2004 | Bachelorsthesis | LibreCat-ID: 47642
T. Herden, Implementierung und Evaluierung eines Angriffs auf DSA. 2004.
LibreCat
 

2004 | Bachelorsthesis | LibreCat-ID: 47644 | OA
S. Gesemann, Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes. 2004.
LibreCat | Files available
 

2004 | Bachelorsthesis | LibreCat-ID: 47643 | OA
M. Gorski, Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven. 2004.
LibreCat | Files available
 

2003 | Dissertation | LibreCat-ID: 2914
A. May, New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn, 2003.
LibreCat | Download (ext.)
 

2003 | Book Chapter | LibreCat-ID: 3016
J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3018
J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.
LibreCat | DOI
 

2003 | Bachelorsthesis | LibreCat-ID: 47641
M. Ernst, Asymptotische Optimalität von LZ77 bei beschränktem Speicher. 2003.
LibreCat
 

2003 | Bachelorsthesis | LibreCat-ID: 47635
K. Voß, Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen. 2003.
LibreCat
 

2003 | Misc | LibreCat-ID: 47696 | OA
U. Hoppe, Markovprozesse zur Modellierung bei Codekompression. 2003.
LibreCat | Files available
 

2003 | Bachelorsthesis | LibreCat-ID: 47636 | OA
C. Unterkirchner, Implementierung eines arithmetischen Dekodierers in Java. 2003.
LibreCat | Files available
 

2003 | Bachelorsthesis | LibreCat-ID: 47640 | OA
D. Kuntze, Tabellenbasierte arithmetische Codierung. 2003.
LibreCat | Files available
 

2003 | Bachelorsthesis | LibreCat-ID: 47638
C. Soltenborn, Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision. 2003.
LibreCat
 

2003 | Bachelorsthesis | LibreCat-ID: 47637
C. Todtenbier, Implementierung eines arithmetischen Kodierers in Java. 2003.
LibreCat
 

2003 | Bachelorsthesis | LibreCat-ID: 47634
M. Ziegler, Fehlerangriffe auf spezielle Implementierungen von RSA. 2003.
LibreCat
 

2003 | Bachelorsthesis | LibreCat-ID: 47639
M. Lindner, Verkürzte Huffman-Codierung zur Codekompression. 2003.
LibreCat
 

2003 | Misc | LibreCat-ID: 47695 | OA
M. R. Ackermann, Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten. 2003.
LibreCat | Files available
 

2002 | Journal Article | LibreCat-ID: 3034
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1737–1744, 2002.
LibreCat | Files available | DOI
 

2002 | Conference Paper | LibreCat-ID: 3040
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” in Proceedings 35th Annual Symposium on Foundations of Computer Science, 2002.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 3041
J. Blömer, “Computing sums of radicals in polynomial time,” 2002, doi: 10.1109/sfcs.1991.185434.
LibreCat | Files available | DOI
 

2002 | Journal Article | LibreCat-ID: 35857
J. Blömer, “Denesting by Bounded Degree Radicals,” Algorithmica, vol. 28, no. 1, pp. 2–15, 2002, doi: 10.1007/s004530010028.
LibreCat | DOI
 

2002 | Misc | LibreCat-ID: 47698 | OA
B. Fricke, Construction of Pseudorandom Functions. 2002.
LibreCat | Files available
 

2002 | Misc | LibreCat-ID: 47697
D. Deveci, Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems. 2002.
LibreCat
 

2002 | Misc | LibreCat-ID: 47699
A. Helbich, The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography. 2002.
LibreCat
 

2002 | Misc | LibreCat-ID: 47700
D. Schepers, Timing Attacks for Cryptosystems based on Elliptic Curves. 2002.
LibreCat
 

2002 | Bachelorsthesis | LibreCat-ID: 47633 | OA
U. Hoppe, Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen. 2002.
LibreCat | Files available
 

2001 | Misc | LibreCat-ID: 47701 | OA
V. Krummel, Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael. 2001.
LibreCat | Files available
 

2001 | Misc | LibreCat-ID: 47702 | OA
M. Otto, Brauer Addition-Subtraction Chains. 2001.
LibreCat | Files available
 

2000 | Book Chapter | LibreCat-ID: 3023
J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,” in Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 248–259.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 3024
J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly independent vectors and short bases in a lattice,” 1999, doi: 10.1145/301250.301441.
LibreCat | Files available | DOI
 

1998 | Journal Article | LibreCat-ID: 3028
J. Blömer and B. 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
J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.
LibreCat | Files available | DOI
 

1997 | Journal Article | LibreCat-ID: 3033
J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over finite fields,” Random Structures \& Algorithms, no. 4, pp. 407–419, 1997.
LibreCat | DOI
 

1995 | Journal Article | LibreCat-ID: 3037
H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
LibreCat
 

1995 | Report | LibreCat-ID: 3038
J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, An XOR-based erasure-resilient coding scheme. Berkeley, USA, 1995.
LibreCat | Files available
 

1993 | Report | LibreCat-ID: 3045
J. Blömer, On Kummer theory and the number of roots of unity in radical extensions of Q. Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1993.
LibreCat
 

1992 | Dissertation | LibreCat-ID: 3043
J. Blömer, Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
LibreCat | Files available
 

1992 | Book Chapter | LibreCat-ID: 3046
H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.
LibreCat | DOI
 

1992 | Conference Paper | LibreCat-ID: 3047
J. Blömer, “How to denest Ramanujan’s nested radicals,” in Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992.
LibreCat | DOI
 

1991 | Conference Paper | LibreCat-ID: 3048
H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes (extended abstract),” in Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91, 1991.
LibreCat | DOI
 

1991 | Conference Paper | LibreCat-ID: 3049
J. Blömer, “Computing sums of radicals in polynomial time,” in Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 3050
H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.
LibreCat | DOI
 

Filters and Search Terms

department=64

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed