Publications of the cosec research group (von zur Gathen, Bonn-Aachen International Center for Information Technology)
Subject area: Cryptography (sorted by year)
Last generated: 13 May 2012, 03:35.
There is also a BibTeX file corresponding to this list.
The local PDFs contained in this page are included as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that these works are posted here electronically. It is understood that all persons copying any of these documents will adhere to the terms and constraints invoked by each copyright holder, and in particular use them only for noncommercial purposes. These works may not be posted elsewhere without the explicit written permission of the copyright holder.
2009
Laila El Aimani (2009). Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm. Cryptology ePrint Archive, Report 2009/435. Link to electronic version.
Laila El Aimani (2009). On Generic Constructions of Designated Confirmer Signatures (The “Encryption of a Signature” Paradigm Revisited). Cryptology ePrint Archive, Report 2009/403. Link to electronic version.
Laila El Aimani (2009). Toward a Generic Construction of Convertible Undeniable Signatures from Pairing-Based Signatures. Cryptology ePrint Archive, Report 2009/362. Link to electronic version.
Neyire Deniz Sarier (2009). A Survey of Distributed Biometric Authentication Systems. In BIOSIG’09, volume 155 of LNI, 43-55. Gesellschaft für Informatik. ISBN 3885792494. Local PDF (180KB).
2008
Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase & Tsuyoshi Takagi (2008). Algorithms and arithmetic operators for computing the ηT pairing in characteristic three. IEEE Transactions on ComputersSpecial Section on Special-Purpose Hardware for Cryptography and Cryptanalysis 57(11). Link to electronic version.
Joachim von zur Gathen (2008). Subset Sum Pseudorandom Generators. In Extended Abstracts of the Second Workshop on Mathematical Cryptology WmC 08, Álvar Ibeas & Jaime Gutiérrez, editors, 20. Link to electronic version.
Joachim von zur Gathen, José Luis Imaña & Çetin Kaya Koç (editors) (2008). Arithmetic of Finite Fields, volume 5130 of LNCS. Berlin, Heidelberg. ISSN 0302-9743 (Print) 1611-3349 (Online). Link to electronic version.
Christoph Puttmann, Jamshid Shokrollahi & Mario Porrmann (2008). Resource Efficiency of Instruction Set Extensions for Elliptic Curve Cryptography. In Proceedings of the 5th International Conference on Information Technology: New Generations (ITNG ’08), Shahram Latifi, editor, 131-136. IEEE Computer Society Press, Las Vegas, Nevada, USA. Link to electronic version.
Christoph Puttmann, Jamshid Shokrollahi, Mario Porrmann & Ulrich Rückert (2008). Hardware Accelerators for Elliptic Curve Cryptography. Advances in Radio Science (ARS) (6), 259-264. Link to electronic version.
2007
Pierre-Louis Cayrel, Ayoub Otmani & Damien Vergnaud (2007). On Kabatianskii-Krouk-Smeets Signatures. In International Workshop on the Arithmetic of Finite Fields, WAIFI 2007, Claude Carlet & Berk Sunar, editors, number 4547 in Lecture Notes in Computer Science, 237-251. Springer-Verlag, Berlin/ Heidelberg. ISSN 0302-9743 (Print) 1611-3349 (Online). Link to electronic version. Local PDF (328KB).
Laila El Aimani & Damien Vergnaud (2007). Gradually Convertible Undeniable Signatures (Michels-Petersen-Horster Convertible Undeniable Signatures Revisited). In Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Jonathan Katz & Moti Yung, editors, number 4521 in Lecture Notes in Computer Science, 478-496. Springer-Verlag, Berlin, Heidelberg. ISBN 978-3-540-72738-5. ISSN 0302-9743 (Print), 1611-3349 (Online). Link to electronic version. Local PDF (353KB).
Joachim von zur Gathen (2007). Zimmermann Telegram: The Original Draft. Cryptologia 31(1), 2-37. Link to electronic version. Local PDF (2.8MB).
Joachim von zur Gathen, Amin Shokrollahi & Jamshid Shokrollahi (2007). Efficient Multiplication Using Type 2 Optimal Normal Bases. In International Workshop on the Arithmetic of Finite Fields, WAIFI 2007, Claude Carlet & Berk Sunar, editors, number 4547 in Lecture Notes in Computer Science, 55-68. Springer-Verlag, Berlin/ Heidelberg. ISSN 0302-9743 (Print) 1611-3349 (Online). Link to electronic version. Local PDF (254KB).
Elisa Gorla, Christoph Puttmann & Jamshid Shokrollahi (2007). Explicit Formulas for Efficient Multiplication in F36m. In Selected Areas in Cryptography, Carlisle Adams, Ali Miri & Michael Wiener, editors, volume 4876 of LNCS, 173-183. Berlin, Heidelberg. ISSN 0302-9743 (Print) 1611-3349 (Online). Link to electronic version.
Fabien Laguillaumie & Damien Vergnaud (2007). Multi-Designated Verifiers Signatures: Anonymity without Encryption. Information Processing Letters 102(2-3), 127-132. Link to electronic version. Local PDF (257KB).
Christoph Puttmann & Jamshid Shokrollahi (2007). MPSoC-coupled Hardware Accelerator for Ellipic Curve Cryptography. In Proceedings of the Western European Workshop on Research in Cryptology (WEWoRC’07), Stefan Lucks, Ahmad reza Sadeghi & Christopher Wolf, editors, 1-10. Bochum. Link to electronic version. Local PDF (209KB).
Jamshid Shokrollahi, Elisa Gorla & Christoph Puttmann (2007). Efficient FPGA-based multipliers for F397 and F36⋅97. In Field Programmable Logic and Applications, 2007. FPL 2007, Walid Najjar & Koen Bertels, editors, 339-344. Amsterdam, Netherlands. Link to electronic version.
2006
Joachim von zur Gathen & Jamshid Shokrollahi (2006). Fast arithmetic for polynomials over F2 in hardware. In IEEE Information Theory Workshop (2006), 107-111. IEEE, Punta del Este, Uruguay. Local PDF (152KB).
Jamshid Shokrollahi (2006). Efficient Implementation of Elliptic Curve Cryptography on FPGAs. Ph.D. thesis, Mathematisch-Naturwissenschaftliche Fakultät der Rheinischen Friedrich-Wilhelms-Universität Bonn. 141 pages.
2005
Joachim von zur Gathen & Michael Nöcker (2005). Polynomial and normal bases for finite fields. Journal of Cryptology 18(4), 337-355. ISSN 0933-2790. Link to electronic version. Local PDF (455KB).
Joachim von zur Gathen & Jamshid Shokrollahi (2005). Efficient FPGA-based Karatsuba multipliers for polynomials over F2. In Selected Areas in Cryptography (SAC 2005), Bart Preneel & Stafford Tavares, editors, number 3897 in Lecture Notes in Computer Science, 359-369. Springer-Verlag, Kingston, ON, Canada. ISBN 3-540-33108-5. Link to electronic version. Local PDF (194KB).
2004
Joachim von zur Gathen (2004). Arithmetic Circuits for Discrete Logarithms. In LATIN04, Martin Farach-Colton, editor, number 2976 in Lecture Notes in Computer Science, 557-566. Springer-Verlag, Berlin, Heidelberg. ISBN 978-3-540-21258-4. ISSN 0302-9743 (Print) 1611-3349 (Online). Link to electronic version. Local PDF (291KB).
Joachim von zur Gathen (2004). Friederich Johann Buck: arithmetic puzzles in cryptography. Cryptologia XXVIII(4), 309-324. Link to electronic version. Local PDF (1.5MB).
Joachim von zur Gathen & Jürgen Gerhard (2004). Computing special powers in finite fields. Mathematics of Computation 73(247), 1499-1523. ISSN 0025-5718. Link to electronic version. Article electronically published on September 26, 2003. Local PDF (511KB).
Joachim von zur Gathen & Michael Nöcker (2004). Fast arithmetic with general Gauß periods. Theoretical Computer Science 315, 419-452. Link to electronic version. Local PDF (498KB).
Joachim von zur Gathen & Igor E. Shparlinski (2004). Polynomial Interpolation from Multiples. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, J. Ian Munro, editor, 1125-1130. Link to electronic version. Local PDF (254KB).
Joachim von zur Gathen & Igor E. Shparlinski (2004). Predicting Subset Sum Pseudorandom Generators. In Lecture Notes in Computer Science—Selected Areas in Cryptography: 11th International Workshop, SAC 2004, Waterloo, Canada, August 9-10, 2004, Revised Selected Papers, Helena Handschuh & M. Anwar Hasan, editors, volume 3357, 241-251. Springer-Verlag Heidelberg. ISBN 3-540-24327-5. Link to electronic version. Local PDF (230KB).
2003
Joachim von zur Gathen (2003). Claude Comiers: the first arithmetical cryptography. Cryptologia XXVII(4), 339-349. Link to electronic version. Local PDF (4.9MB).
Joachim von zur Gathen (2003). Efficient exponentiation in finite fields. In Tagungsband: Computeralgebra. Universität Kassel 15. - 17. Mai 2003, 8.
Joachim von zur Gathen (2003). Irreducible trinomials over finite fields. Mathematics of Computation 72, 1987-2000. Link to electronic version. Local PDF (339KB).
C. Grabbe, M. Bednara, J. Shokrollahi, J. Teich & J. von zur Gathen (2003). FPGA Designs of parallel high performance GF(2233) Multipliers. In Proc. of the IEEE International Symposium on Circuits and Systems (ISCAS-03), volume II, 268-271. Bangkok, Thailand. Local PDF (244KB).
C. Grabbe, M. Bednara, J. Shokrollahi, J. Teich & J. von zur Gathen (2003). A High Performance VLIW Processor for Finite Field Arithmetic. In Proc. of The 10th Reconfigurable Architectures Workshop (RAW-03). Local PDF (185KB).
Carsten Keller (2003). The Java class SecureRandom for generating random prime numbers with cryptoP@d. Technical report, Universität Paderborn, Fak. EIM-M.
2002
M. Bednara, M. Daldrup, J. Shokrollahi, J. Teich & J. von zur Gathen (2002). Reconfigurable Implementation of Elliptic Curve Crypto Algorithms. In Proc. of The 9th Reconfigurable Architectures Workshop (RAW-02), 157-164. Fort Lauderdale FL, USA. Local PDF (193KB).
M. Bednara, M. Daldrup, J. Shokrollahi, J. Teich & J. von zur Gathen (2002). Tradeoff Analysis of FPGA Based Elliptic Curve Cryptography. In Proc. of the IEEE International Symposium on Circuits and Systems (ISCAS-02), volume V, 797-800. Scottsdale, Arizona, U.S.A. Link to PDF version. Local PDF (109KB).
Olaf Müller & Michael Nüsken (2002). Never Trust Victor: An Alternative Resettable Zero-Knowledge Proof System. In Progress in Cryptology - INDOCRYPT 2002, Alfred Menezes & Palash Sarkar, editors, number 2551 in Lecture Notes in Computer Science, 79-92. Springer-Verlag, Berlin, Heidelberg. ISBN 3-540-00263-4. ISSN 0302-9743. Abstract and electronic version.
2001
Joachim von zur Gathen (2001). Irreducible Trinomials over Finite Fields. In Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation ISSAC2001, London, Canada, Bernard Mourrain, editor, 332-336. ACM Press. Final version in Mathematics of Computation.
Olaf Müller (2001). Resettable Zero-Knowledge. Diplomarbeit, Universität Paderborn. Link to electronic version.
Michael Nöcker (2001). Data structures for parallel exponentiation in finite fields. Doktorarbeit, Universität Paderborn, Germany. Author’s homepage. Local PDF (3.1MB).
Martin Otto (2001). Brauer addition-subtraction chains. Diplomarbeit, University of Paderborn. Link to author’s homepage. Local PDF (2.2MB).
2000
Cristopher Creutzig (2000). Cryptographic Functions and Gröbner Bases. Diplomarbeit, University of Paderborn.
Joachim von zur Gathen & Francesco Pappalardi (2000). Density estimates for Gauß periods. In Proc. Workshop on Cryptography and Computational Number Theory (CCNT’99, Singapore), K.-Y. Lam, I. E. Shparlinski, H. Wang & C. Xing, editors. Birkhäuser Verlag. Final version in Progress in Computer Science and Applied Logic.
1999
Joachim von zur Gathen & Michael Nöcker (1999). Normal bases, Gauss periods, and fast arithmetic. In Abstracts of the Fifth International Conference on Finite Fields and Applications, University of Augsburg, 70.
Joachim von zur Gathen & Igor Shparlinski (1999). Constructing Elements of Large Order in Finite Fields. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Marc Fossorier, Hideki Imai, Shu Lin & Alain Poli, editors, number 1719 in Lecture Notes in Computer Science, 404-409. Springer-Verlag, Berlin, Heidelberg. ISBN 3-540-66723-7. ISSN 0302-9743. Link to electronic version.
1998
Shuhong Gao, Joachim von zur Gathen & Daniel Panario (1998). Gauss periods: orders and cryptographical applications. Mathematics of Computation 67(221), 343-352. Link to electronic version. With microfiche supplement. Local PDF (232KB).
Joachim von zur Gathen (1998). Algebra für Spione, Datenschützer und das Internet: Kryptographie und endliche Körper. Forschungsforum Paderborn 1-98, 8-13. Link to electronic version. Local PDF (428KB).
Preda Mihăilescu (1998). Cyclotomy Primality Proving—Recent Developments. In Algorithmic Number Theory, Third International Symposium, ANTS-III, Portland, Oregon, USA, J. P. Buhler, editor, number 1423 in Lecture Notes in Computer Science, 95-110. Springer-Verlag. ISSN 0302-9743. Link to electronic version.
1997
Joachim von zur Gathen & Michael Nöcker (1997). Exponentiation in Finite Fields: Theory and Practice. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: AAECC-12, Toulouse, France, Teo Mora & Harold Mattson, editors, number 1255 in Lecture Notes in Computer Science, 88-113. Springer-Verlag. ISSN 0302-9743. Link to electronic version. Local PDF (414KB).
Joachim von zur Gathen & James R. Roche (1997). Polynomials with two values. Combinatorica 17(3), 345-362. Link to electronic version.
Preda Mihăilescu (1997). Cyclotomy of Rings & Primality Testing. Ph.D. thesis, Swiss Federal Institute of Technology, Zürich, Switzerland. Author’s homepage.
1992
Joachim von zur Gathen (1992). Processor-efficient exponentiation in finite fields. Information Processing Letters 41, 81-86. Link to electronic version.
1991
Joachim von zur Gathen (1991). Efficient and optimal exponentiation in finite fields. computational complexity 1, 360-394. Link to electronic version.
Joachim von zur Gathen (1991). Efficient exponentiation in finite fields. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, San Juan PR, 384-391. IEEE Computer Society Press, Los Alamitos CA. Final version in computational complexity, see von zur Gathen (1991a).