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
2013 | Preprint | LibreCat-ID: 538 | 
Blömer, Johannes, and Gennadij Liske. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn, 2013.
LibreCat
| Files available
| Download (ext.)
2013 | Bachelorsthesis | LibreCat-ID: 553
Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.
LibreCat
2012 | Conference Paper | LibreCat-ID: 2982
Ackermann, Marcel Rudolf, et al. StreamKM++: A Clustering Algorithm for Data Streams. Vol. 17, ACM, 2012, doi:10.1145/2133803.2184450.
LibreCat
| DOI
2012 | Journal Article | LibreCat-ID: 2984
Blömer, Johannes. “Turing Und Kryptografie.” Informatik-Spektrum, vol. 35, no. 4, 2012, doi:10.1007/s00287-012-0622-7.
LibreCat
| DOI
2012 | Bachelorsthesis | LibreCat-ID: 606
Löken, Nils. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012.
LibreCat
2012 | Bachelorsthesis | LibreCat-ID: 607
Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.
LibreCat
2012 | Bachelorsthesis | LibreCat-ID: 629
Schleiter, Patrick. Attribute-basierte Verschlüsselung. Universität Paderborn, 2012.
LibreCat
2011 | Bachelorsthesis | LibreCat-ID: 2872
Böttger, Timm. Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen. 2011.
LibreCat
| Files available
2011 | Mastersthesis | LibreCat-ID: 2902
Märtens, Marcus. The Monotone Complexity of Computing K-Clique on Random Graphs. 2011.
LibreCat
2011 | Dissertation | LibreCat-ID: 2910
Naewe, Stefanie. Algorithms for Lattice Problems with Respect to General Norms. Universität Paderborn, 2011.
LibreCat
| Download (ext.)
2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, Marcel R., et al. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.
LibreCat
2011 | Book Chapter | LibreCat-ID: 2986
Blömer, Johannes. “How to Share a Secret.” Algorithms Unplugged, Springer Berlin Heidelberg, 2011, pp. 159–68, doi:10.1007/978-3-642-15328-0_17.
LibreCat
| DOI
2011 | Preprint | LibreCat-ID: 2987
Blömer, Johannes, and Stefanie Naewe. “Solving the Closest Vector Problem with Respect to Lp Norms.” ArXiv:1104.3720, 2011.
LibreCat
2011 | Mastersthesis | LibreCat-ID: 659
Liske, Gennadij. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn, 2011.
LibreCat
| Files available
2010 | Book Chapter | LibreCat-ID: 2988
Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.” SWAT 2010, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:10.1007/978-3-642-13731-0_21.
LibreCat
| DOI
2010 | Journal Article | LibreCat-ID: 2990
Ackermann, Marcel R., et al. “Clustering for Metric and Nonmetric Distance Measures.” ACM Trans. Algorithms, no. 4, 2010, pp. 59:1--59:26, doi:10.1145/1824777.1824779.
LibreCat
| DOI
2010 | Journal Article | LibreCat-ID: 2991
Krueger, Alexander, et al. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat
2010 | Conference Paper | LibreCat-ID: 2993
Schrieb, Jonas. Efficient and Compact CCA Security from Partitioned IBKEM. 2010.
LibreCat
2010 | Conference Paper | LibreCat-ID: 2994
Schäfer, Wilhelm, et al. “Engineering Self-Coordinating Software Intensive Systems.” Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010, doi:10.1145/1882362.1882428.
LibreCat
| DOI
2010 | Misc | LibreCat-ID: 47684 |
Postler, Tim. Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung. 2010.
LibreCat
| Files available
2009 | Bachelorsthesis | LibreCat-ID: 2880
Schröer, Carsten. Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern. 2009.
LibreCat
| Files available
2009 | Bachelorsthesis | LibreCat-ID: 2896 |
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 |
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 |
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 |
Brieden, Benedikt. Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode. 2007.
LibreCat
| Files available
2007 | Misc | LibreCat-ID: 47689 |
Kuntze, Daniel. Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz. 2007.
LibreCat
| Files available
2007 | Misc | LibreCat-ID: 47686 |
Borghoff, Julia. Vergleich multivariater Varianten der Methode von Coppersmith. 2007.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 2887 |
Landwehr, Andreas Cord. Untersuchungen zur Sicherheit einzelner RSA Bits. 2007.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 47653 |
Klose, Jaroslaw. Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT. 2007.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 47652 |
Niemeier, Martin. Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen. 2007.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 47654 |
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 |
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.” 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 |
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 |
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.” 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
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, 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
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.” 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