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.
79 Publications
2020 | Journal Article | LibreCat-ID: 20888
Blömer, Johannes, et al. “A Complexity Theoretical Study of Fuzzy K-Means.” ACM Transactions on Algorithms, vol. 16, no. 4, 2020, pp. 1–25, doi:10.1145/3409385.
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
2023 | Conference Paper | LibreCat-ID: 43458 | 
Blömer, Johannes, et al. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. 2023.
LibreCat
| Download (ext.)
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
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
2014 | Conference Paper | LibreCat-ID: 463
Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136, doi:10.1109/FDTC.2014.22.
LibreCat
| Files available
| 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
2016 | Conference Paper | LibreCat-ID: 2367
Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.” 2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–10, doi:10.1109/icdm.2016.0094.
LibreCat
| DOI
2014 | Conference Paper | LibreCat-ID: 2977
Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.” 2014 22nd International Conference on Pattern Recognition, IEEE, 2014, doi:10.1109/icpr.2014.253.
LibreCat
| DOI
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
2016 | Book Chapter | LibreCat-ID: 2970
Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.
LibreCat
| DOI
2016 | Book Chapter | LibreCat-ID: 2978
Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.
LibreCat
| DOI
1995 | Report | LibreCat-ID: 3038
Blömer, Johannes, et al. An XOR-Based Erasure-Resilient Coding Scheme. 1995.
LibreCat
| Files available
2014 | Journal Article | LibreCat-ID: 2976
Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.” Algorithmica, vol. 69, Springer US, 2014, doi:10.1007/s00453-012-9717-4.
LibreCat
| DOI
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.)
2015 | Conference Paper | LibreCat-ID: 322 |
Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.” Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488, doi:10.1007/978-3-662-47854-7_29.
LibreCat
| Files available
| DOI
| Download (ext.)
1995 | Journal Article | LibreCat-ID: 3037
Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
LibreCat
1991 | Conference Paper | LibreCat-ID: 3048
Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes (Extended Abstract).” Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91, ACM Press, 1991, doi:10.1145/109648.109669.
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 3050
Alt, Helmut, et al. “Approximation of Convex Polygons.” Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi:10.1007/bfb0032068.
LibreCat
| DOI
2017 | Conference Paper | LibreCat-ID: 2344 |
Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” Foundations and Practice of Security, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-75650-9_1.
LibreCat
| Files available
| DOI
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
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
2018 | Conference Paper | LibreCat-ID: 2965
Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, pp. 25:1--25:10, doi:10.1145/3230833.3230853.
LibreCat
| Files available
| 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
1991 | Conference Paper | LibreCat-ID: 3049
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991, doi:10.1109/sfcs.1991.185434.
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
2014 | Preprint | LibreCat-ID: 442 |
Blömer, Johannes, and Gennadij Liske. Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions. Universität Paderborn, 2014.
LibreCat
| Files available
| Download (ext.)
2016 | Conference Paper | LibreCat-ID: 208
Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” Proceedings of the CT-RSA 2016, 2016, pp. 431–47, doi:10.1007/978-3-319-29485-8_25.
LibreCat
| Files available
| DOI
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
2018 | Conference Paper | LibreCat-ID: 4344
Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.” 29th International Symposium on Algorithms and Computation (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:10.4230/LIPIcs.ISAAC.2018.46.
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 2379 |
Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.” ACNS 2018 Applied Cryptography & Network Security, doi:10.1007/978-3-319-93387-0_12.
LibreCat
| Files available
| DOI
| Download (ext.)
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
2023 | Conference Paper | LibreCat-ID: 44855
Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” ECIS 2023 Research Papers, 2023.
LibreCat
| Files available
| Download (ext.)
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.)
2019 | Conference Paper | LibreCat-ID: 13557 |
Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” 12th International Symposium on Foundations and Practice of Security, FPS 2019, vol. 12056, Springer, 2019.
LibreCat
| Download (ext.)
2016 | Report | LibreCat-ID: 2971
Blömer, Johannes, and Peter Günther. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
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
2018 | Conference Paper | LibreCat-ID: 3873 |
Blömer, Johannes, et al. “Enhanced Security of Attribute-Based Signatures.” The International Conference on Cryptology And Network Security (CANS), vol. 11124, Springer, 2018, pp. 235–55, doi:10.1007/978-3-030-00434-7_12.
LibreCat
| Files available
| DOI
| Download (ext.)
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
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
2018 | Conference Paper | LibreCat-ID: 3265 |
Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.” Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, doi:10.1145/3230833.3234517.
LibreCat
| Files available
| DOI
| Download (ext.)
2016 | Preprint | LibreCat-ID: 2969 |
Blömer, Johannes, et al. Hard-Clustering with Gaussian Mixture Models. Computing Research Repository, 2016.
LibreCat
| Download (ext.)
2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, Marcel R., et al. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.
LibreCat
1992 | Conference Paper | LibreCat-ID: 3047
Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.” Proceedings., 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, doi:10.1109/sfcs.1992.267807.
LibreCat
| DOI
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
2020 | Journal Article | LibreCat-ID: 10790
Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.” Advances in Data Analysis and Classification, vol. 14, 2020, pp. 147–173, doi:10.1007/s11634-019-00366-7.
LibreCat
| DOI
2013 | Book Chapter | LibreCat-ID: 2979
Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.” Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, 2013, pp. 154–68, doi:10.1007/978-3-642-40026-1_10.
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: 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
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
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
2023 | Conference Paper | LibreCat-ID: 35014 |
Blömer, Johannes, et al. On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC. 2023.
LibreCat
| Download (ext.)
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
2019 | Conference Paper | LibreCat-ID: 13554 |
Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” Security and Trust Management, STM 2019, vol. 11738, 2019, doi:10.1007/978-3-030-31511-5_9.
LibreCat
| Files available
| DOI
2023 | Book Chapter | LibreCat-ID: 45901 |
Blömer, Johannes, et al. “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–46, doi:10.5281/zenodo.8068755.
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 2862 |
Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, 2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25.
LibreCat
| Files available
| DOI
| Download (ext.)
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
2018 | Working Paper | LibreCat-ID: 5820
Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.
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
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
1992 | Book Chapter | LibreCat-ID: 3046
Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, 1992, pp. 1–24, doi:10.1007/3-540-55488-2_19.
LibreCat
| DOI
2023 | Book Chapter | LibreCat-ID: 45891 |
Blömer, Johannes, et al. “Robustness and Security.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64, doi:10.5281/zenodo.8068629.
LibreCat
| Files available
| 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
2013 | Conference Paper | LibreCat-ID: 488
Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.
LibreCat
| Files available
2015 | Conference Paper | LibreCat-ID: 253
Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.” Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–80, doi:10.1007/978-3-319-32859-1_14.
LibreCat
| Files available
| 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
1992 | Dissertation | LibreCat-ID: 3043
Blömer, Johannes. Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
LibreCat
| Files available
2016 | Conference Paper | LibreCat-ID: 2947
Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.” 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2016, doi:10.1109/fdtc.2015.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
2017 | Conference Paper | LibreCat-ID: 2967 |
Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), vol. 10693, Springer International Publishing, 2017, pp. 438–53, doi:10.1007/978-3-319-72453-9_35.
LibreCat
| Files available
| DOI
| Download (ext.)
2014 | Conference Paper | LibreCat-ID: 355
Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.” Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7, doi:10.1109/FDTC.2014.10.
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
2016 | Book Chapter | LibreCat-ID: 2968
Blömer, Johannes, et al. “Theoretical Analysis of the K-Means Algorithm – A Survey.” Algorithm Engineering, Springer International Publishing, 2016, pp. 81–116, doi:10.1007/978-3-319-49487-6_3.
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
2019 | Conference Paper | LibreCat-ID: 13904 |
Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.” Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019, doi:10.1145/3319535.3354223.
LibreCat
| Files available
| DOI
| Download (ext.)
2018 | Journal Article | LibreCat-ID: 2685
Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, 2018, pp. 314–38, doi:10.1137/17M1132045.
LibreCat
| Files available
| DOI
2015 | Report | LibreCat-ID: 233 |
Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.
LibreCat
| Files available
| Download (ext.)
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