Instituto de Matem\acute{a}tica
UFRGS
UFRGS
<\br><\br><\br><\br><\br><\br><\br><\br><\br><\br><\br><\br>
2013
Joachim von zur Gathen (2013). Lower bounds for decomposable univariate wild polynomials. Journal of Symbolic Computation 50, 409-430. Link to electronic version. Local PDF (312KB).
Daniel Loebenberger & Michael Nüsken (2013). Notions for RSA integers. To appear in International Journal of Applied Cryptography ISSN 1753-0571 (online), 1753-0563 (print). e-print arXiv:1104.4356v2.
2012
Raoul Blankertz, Joachim von zur Gathen & Konstantin Ziegler (2012). Compositions and collisions at degree p2. In Proceedings of the 2012 International Symposium on Symbolic and Algebraic Computation ISSAC2012, Grenoble, France, 91-98. ACM Press, New York, USA. Full version available at http://arxiv.org/abs/1202.5810.
Joachim von zur Gathen, Daniel Panario & Bruce Richmond (2012). Interval Partitions and Polynomial Factorization. Algorithmica 63, 363-397. Link to electronic version. Local PDF (343KB).
Daniel Loebenberger & Michael Nüsken (2012). Coarse-grained integers. e-print arXiv:1003.2165v2 Link to electronic version.
Kumar Sharad (2012). Certificateless Encryption Scheme Using Biometric Identity. Master’s thesis, Department of Computer Security, b-it, Bonn. Local PDF (1.9MB).
2011
Raoul Blankertz (2011). Decomposition of Polynomials. Diplomarbeit, Universität Bonn, Bonn. Modified version available at http://arxiv.org/abs/1107.0687. Local PDF (333KB).
Joachim von zur Gathen (2011). Census of Polynomials. Plenary talk. Joint work with Raoul Blankertz, Mark Giesbrecht, Alfredo Viola, and Konstantin Ziegler. In Fq10 - The Tenth International Conference on Finite Fields and Their Applications, p.8. Local PDF (66KB).
Daniel Loebenberger & Michael Nüsken (2011). Analyzing standards for RSA integers. In Africacrypt 2011, Abderrahmane Nitaj & David Pointcheval, editors, volume 6737 of Lecture Notes in Computer Science, 260-277. Springer. ISBN 978-3-642-21968-9. ISSN 0302-9743. Link to electronic version. Local PDF (242KB).
Neyire Deniz Sarier (2011). A new biometric identity based encryption scheme secure against DoS attacks. Security and Communication Networks 4(1), 23-32. Link to electronic version. Local PDF (238KB).
2010
Laila El Aimani & Yona Raekow (2010). Reselling Digital Content. In FARES 2010, Lisa O’Conner, editor, IEEE Computer Society, 391-396. IEEE Computer Society, 10662 Los Vaqueros Circle Los Alamitos, California 90720-1314. ISSN 0302-9743 (Print) 1611-3349 (Online). Link to electronic version. Local PDF (196KB).
Jean-Charles Faugère, Joachim von zur Gathen & Ludovic Perret (2010). Decomposition of Generic Multivariate Polynomials. In Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation ISSAC2010, Munich, Germany, 131-137. Link to electronic version. Local PDF (174KB).
Joachim von zur Gathen (2010). Counting decomposable multivariate polynomials. Applicable Algebra in Engineering, Communication and Computing 22(3), 165-185. Link to electronic version. Abstract in Abstracts of the Ninth International Conference on Finite Fields and their Applications, pages 21-22, Dublin, July 2009, Claude Shannon Institute, http://www.shannoninstitute.ie/fq9/AllFq9Abstracts.pdf. Local PDF (331KB).
Joachim von zur Gathen (2010). Shift-invariant polynomials and Ritt’s Second Theorem. In Finite Fields: Theory and Applications, Gary McGuire, Gary L. Mullen, Daniel Panario & Igor E. Shparlinski, editors, volume 518 of Contemporary Mathematics, 161-184. ISBN 0-8218-4786-4 (ISBN-10), 978-0-8218-4786-2 (ISBN-13). The Local PDF is a corrected version. Local PDF (338KB).
Joachim von zur Gathen, Mark Giesbrecht & Konstantin Ziegler (2010). Composition collisions and projective polynomials. Statement of results. In Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation ISSAC2010, Munich, Germany, Stephen Watt, editor, 123-130. ACM Press. Preprint available at http://arxiv.org/abs/1005.1087.
Joachim von zur Gathen, Maurice Mignotte & Igor E. Shparlinski (2010). Approximate polynomial gcd: small degree and small height perturbations. Journal of Symbolic Computation Link to electronic version. The Local PDF is a corrected version. Local PDF (217KB).
Joachim von zur Gathen, Alfredo Viola & Konstantin Ziegler (2010). Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields (Extended Abstract). In Proceedings of LATIN 2010, Oaxaca, Mexico, Alejandro López-Ortiz, editor, volume 6034 of Lecture Notes in Computer Science, 243-254. Springer-Verlag, Berlin, Heidelberg. ISBN 978-3-642-12199-9. ISSN 0302-9743 (Print) 1611-3349 (Online). Link to electronic version.