3. Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis. 4. Algorithms for linear algebra problems over principal ideal rings

Transcription

1 1. Faktorisierung großer Zahlen 2. On smooth ideals in number fields 3. Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis 4. Algorithms for linear algebra problems over principal ideal rings 5. A one way function based on ideal arithmetic in number fields 6. On some computational problems in finite abelian groups 7. An analysis of the reduction algorithms for binary quadratic forms 8. Sieving Methods for Class Group Computation 9. La factorisation des grandes nombres 10. APPROXIMATE EVALUATION OF L(1, χ ) 11. On factor refinement in number fields 12. Discrete Logarithms: Recent Progress 13. Kernels of Integers Matrices via Modular Arithmetic 14. Cryptographic Protocols Based on the Intractability of Extracting Roots and Computing Discrete Logarithms 15. Wie sicher ist die Public-Key-Kryptographie? 16. FlexiPKI - Realisierung einer flexiblen Public-Key-Infrastuktur 17. CRYPTOGRAPHY BASED ON NUMBER FIELDS WITH LARGE REGULA- TOR 18. Efficient Construction of Cryptographically Strong Elliptic Curves 19. WIE SICHER KANN SICHERHEIT SEIN 20. A Survey on IQ Cryptography 21. A Signature Scheme Based on the Intractability of Computing Roots 22. An IND-CCA2 Public-Key Cryptosystem with Fast Decryption 23. Aus- und Weiterbildung in IT-Sicherheit 24. Kryptographie - Chancen und Risiken 25. Number field cryptography 1

2 26. COMPUTING THE STRUCTURE OF A FINITE ABELIAN GROUP 27. Post-Quantum Signatures 28. Practical Lattice Basis Sampling Reduction 29. An Evaluated Certification Services System for the German National Root CA - Legally Binding and Trustworthy Transactions in EBusiness and EGovernment 30. The Workshop - Implementing Well Structured Enterprise Applications 31. Outflanking and Securely Using the PIN/TAN-System 32. Directory Based Registration in Public Key Infrastructures 33. A Multipurpose Delegation Proxy for WWW Credentials 34. Block Ciphers Sensitive to Gröbner Basis Attacks 35. A Zero-Dimensional Gröbner Basis for AES PERSPECTIVES FOR CRYPTOGRAPHIC LONG-TERM SECURITY 37. CMSS An Improved Merkle Signature Scheme 38. Towards Secure Electronic Workflows 39. Life-Cycle Management of X.509 Certificates Based on LDAP Directories 40. Formal Proof for the Correctness of RSA-PSS 41. Intrinsically Legal-For-Trade Objects by Digital Signatures 42. Digital signierte Wägeresultate - Neue Wege in der Sicherung eichfähiger Messwerte 43. Computer Verification in Cryptography 44. A Formal Approach for Proof Constructions in Cryptography 45. Passwörter oder Smartcards zur Absicherung von Portalen? 46. Krypto Aussichten für langfristige kryptographische Sicherheit 47. Merkle Signatures with Virtually Unlimited Signature Capacity 48. On Coercion-Resistant Electronic Elections with Linear Work 49. Computer Proven Correctness of the Rabin Public-Key Scheme 50. Efficiency Improvement for NTRU 51. Secure Online Elections in Practice 2

3 52. Fast Hash-Based Signatures on Constrained Devices 53. Merkle tree traversal revisited 54. Efficient Hash-Based Signatures on Embedded Devices 55. MutantXL 56. Explicit hard instances of the shortest vector problem 57. Secure and Practical Online Elections via Voting Service Provider Faktorisierung großer Zahlen On smooth ideals in number fields Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis Algorithms for linear algebra problems over principal ideal rings A one way function based on ideal arithmetic in number fields On some computational problems in finite abelian groups An analysis of the reduction algorithms for binary quadratic forms Sieving Methods for Class Group Computation La factorisation des grandes nombres APPROXIMATE EVALUATION OF L(1, χ ) On factor refinement in number fields Discrete Logarithms: Recent Progress Kernels of Integers Matrices via Modular Arithmetic Cryptographic Protocols Based on the Intractability of Extracting Roots and Computing Discrete Logarithms Wie sicher ist die Public-Key-Kryptographie? FlexiPKI - Realisierung einer flexiblen Public-Key-Infrastuktur CRYPTOGRAPHY BASED ON NUMBER FIELDS WITH LARGE REGULA- TOR Efficient Construction of Cryptographically Strong Elliptic Curves WIE SICHER KANN SICHERHEIT SEIN 3

4 A Survey on IQ Cryptography A Signature Scheme Based on the Intractability of Computing Roots An IND-CCA2 Public-Key Cryptosystem with Fast Decryption Aus- und Weiterbildung in IT-Sicherheit Kryptographie - Chancen und Risiken Number field cryptography COMPUTING THE STRUCTURE OF A FINITE ABELIAN GROUP Post-Quantum Signatures Practical Lattice Basis Sampling Reduction An Evaluated Certification Services System for the German National Root CA - Legally Binding and Trustworthy Transactions in EBusiness and EGovernment The Workshop - Implementing Well Structured Enterprise Applications Outflanking and Securely Using the PIN/TAN-System Directory Based Registration in Public Key Infrastructures A Multipurpose Delegation Proxy for WWW Credentials Block Ciphers Sensitive to Gröbner Basis Attacks A Zero-Dimensional Gröbner Basis for AES-128 PERSPECTIVES FOR CRYPTOGRAPHIC LONG-TERM SECURITY CMSS An Improved Merkle Signature Scheme Towards Secure Electronic Workflows Life-Cycle Management of X.509 Certificates Based on LDAP Directories Formal Proof for the Correctness of RSA-PSS Intrinsically Legal-For-Trade Objects by Digital Signatures Digital signierte Wägeresultate - Neue Wege in der Sicherung eichfähiger Messwerte Computer Verification in Cryptography A Formal Approach for Proof Constructions in Cryptography Passwörter oder Smartcards zur Absicherung von Portalen? 4

5 Krypto Aussichten für langfristige kryptographische Sicherheit Merkle Signatures with Virtually Unlimited Signature Capacity On Coercion-Resistant Electronic Elections with Linear Work Computer Proven Correctness of the Rabin Public-Key Scheme Efficiency Improvement for NTRU Secure Online Elections in Practice Fast Hash-Based Signatures on Constrained Devices Merkle tree traversal revisited Efficient Hash-Based Signatures on Embedded Devices MutantXL Explicit hard instances of the shortest vector problem Secure and Practical Online Elections via Voting Service Provider 5