The SCEAS System
Navigation Menu

Search the dblp DataBase


Johannes Buchmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johannes Buchmann, Michael Pohst
    On the Complexity of Computing Class Groups of Algebraic Number Fields. [Citation Graph (0, 0)][DBLP]
    AAECC, 1988, pp:122-130 [Conf]
  2. Johannes Buchmann, Attila Pethö
    Computation of Independent Units in Number Fields by Dirichlet's Method. [Citation Graph (0, 0)][DBLP]
    AAECC, 1985, pp:302-305 [Conf]
  3. Johannes Buchmann
    Reducing lattice bases by means of approximations. [Citation Graph (0, 0)][DBLP]
    ANTS, 1994, pp:160-168 [Conf]
  4. Johannes Buchmann, Christoph Ludwig
    Practical Lattice Basis Sampling Reduction. [Citation Graph (0, 0)][DBLP]
    ANTS, 2006, pp:222-237 [Conf]
  5. Ingrid Biehl, Johannes Buchmann, Christoph Thiel
    Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:56-60 [Conf]
  6. Johannes Buchmann, Stephan Düllmann
    On the Computation of Discrete Logarithms in Class Groups. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:134-139 [Conf]
  7. Johannes Buchmann, J. Loho, J. Zayer
    An Implementation of the General Number Field Sieve. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:159-165 [Conf]
  8. Johannes Buchmann, Sachar Paulus
    A One Way Function Based on Ideal Arithmetic in Number Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:385-394 [Conf]
  9. Johannes Buchmann, Hugh C. Williams
    A Key Exchange System Based on Real Quadratic Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:335-343 [Conf]
  10. Alexander Wiesmaier, Marcus Lippert, Vangelis Karatsiolis, Georgios Raptis, Johannes Buchmann
    An Evaluated Certification Services System for the German National Root CA - Legally binding and trustworthy Transactions in E-Business and E-Government. [Citation Graph (0, 0)][DBLP]
    CSREA EEE, 2005, pp:103-110 [Conf]
  11. Alexander Wiesmaier, Mike Fisher, Marcus Lippert, Johannes Buchmann
    Ouflanking and Securely Using the PIN/TAN-System. [Citation Graph (0, 0)][DBLP]
    Security and Management, 2005, pp:313-319 [Conf]
  12. Johannes Buchmann, Andrei Pyshkin, Ralf-Philipp Weinmann
    Block Ciphers Sensitive to Gröbner Basis Attacks. [Citation Graph (0, 0)][DBLP]
    CT-RSA, 2006, pp:313-331 [Conf]
  13. Johannes Buchmann
    The Generalized Voronoi-Algorithm in Totally Real Algebraic Number Fields. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:479-486 [Conf]
  14. Johannes Buchmann, Michael Pohst
    Computing a lattice basis from a system of generating vectors. [Citation Graph (0, 0)][DBLP]
    EUROCAL, 1987, pp:54-63 [Conf]
  15. Ingrid Biehl, Johannes Buchmann, Bernd Meyer, Christian Thiel, Christoph Thiel
    Tools for Proving Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:356-365 [Conf]
  16. Johannes Buchmann, Stephan Düllmann, Hugh C. Williams
    On the Complexity and Efficiency of a New Key Exchange System. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:597-616 [Conf]
  17. Renate Scheidler, Johannes Buchmann, Hugh C. Williams
    Implementation of a Key Exchange Protocol Using Some Real Quadratic Fields. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:98-109 [Conf]
  18. Tobias Straub, Thilo-Alexander Ginkel, Johannes Buchmann
    A Multipurpose Delegation Proxy for WWW Credentials. [Citation Graph (0, 0)][DBLP]
    EuroPKI, 2005, pp:1-21 [Conf]
  19. Sebastian Fritsch, Vangelis Karatsiolis, Marcus Lippert, Alexander Wiesmaier, Johannes Buchmann
    Towards Secure Electronic Workflows. [Citation Graph (0, 0)][DBLP]
    EuroPKI, 2006, pp:154-168 [Conf]
  20. Johannes Buchmann
    A Criterion for the Equivalence of Two Ideals. [Citation Graph (0, 0)][DBLP]
    EUROSAM, 1984, pp:333-340 [Conf]
  21. Johannes Buchmann
    Number Theoretic Algorithms and Cryptology. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:16-21 [Conf]
  22. Johannes Buchmann, Andrei Pyshkin, Ralf-Philipp Weinmann
    A Zero-Dimensional Gröbner Basis for AES-128. [Citation Graph (0, 0)][DBLP]
    FSE, 2006, pp:78-88 [Conf]
  23. Johannes Buchmann, Kouichi Sakurai, Tsuyoshi Takagi
    An IND-CCA2 Public-Key Cryptosystem with Fast Decryption. [Citation Graph (0, 0)][DBLP]
    ICISC, 2001, pp:51-71 [Conf]
  24. Johannes Buchmann, Harald Baier
    Efficient Construction of Cryptographically Strong Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2000, pp:191-202 [Conf]
  25. Johannes Buchmann, Luis Carlos Coronado García, Erik Dahmen, Martin Döring, Elena Klintsevich
    CMSS - An Improved Merkle Signature Scheme. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2006, pp:349-363 [Conf]
  26. Johannes Buchmann, Volker Müller
    Computing the Number of Points of Elliptic Curves Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1991, pp:179-182 [Conf]
  27. Alexander Wiesmaier, Vangelis Karatsiolis, Marcus Lippert, Johannes Buchmann
    The Workshop - Implementing Well Structured Enterprise Applications. [Citation Graph (0, 0)][DBLP]
    Software Engineering Research and Practice, 2005, pp:947-0 [Conf]
  28. Alexander Wiesmaier, Ulrich Rauchschwalbe, Christoph Ludwig, Birgit Henhapl, Markus Ruppert, Johannes Buchmann
    Intrinsically Legal-For-Trade Objects by Digital Signatures. [Citation Graph (0, 0)][DBLP]
    Sicherheit, 2006, pp:218-221 [Conf]
  29. Johannes Buchmann, Victor Shoup
    Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:72-79 [Conf]
  30. Johannes Buchmann, Alexander May, Ulrich Vollmer
    Perspectives for cryptographic long-term security. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2006, v:49, n:9, pp:50-55 [Journal]
  31. Vangelis Karatsiolis, Marcus Lippert, Alexander Wiesmaier, A. Pitaev, Markus Ruppert, Johannes Buchmann
    Towards a Flexible Intra-Trustcenter Management Protocol [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  32. Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer
    A Signature Scheme Based on the Intractability of Computing Roots. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:25, n:3, pp:223-236 [Journal]
  33. Johannes Buchmann, Hugh C. Williams
    Some remarks concerning the complexity of computing class groups of quadratic fields. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1991, v:7, n:3, pp:311-315 [Journal]
  34. Marcus Lippert, Vangelis Karatsiolis, Alexander Wiesmaier, Johannes Buchmann
    Life-cycle management of X.509 certificates based on LDAP directories. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 2006, v:14, n:5, pp:419-439 [Journal]
  35. Johannes Buchmann, Hugh C. Williams
    A Key-Exchange System Based on Imaginary Quadratic Fields. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1988, v:1, n:2, pp:107-118 [Journal]
  36. Renate Scheidler, Johannes Buchmann, Hugh C. Williams
    A Key-Exchange Protocol Using Real Quadratic Fields. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1994, v:7, n:3, pp:171-199 [Journal]
  37. Johannes Buchmann, Hugh C. Williams
    On Principal Ideal Testing in Algebraic Number Fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1987, v:4, n:1, pp:11-19 [Journal]
  38. Johannes Buchmann, Friedrich Eisenbrand
    On factor refinement in number fields. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1999, v:68, n:225, pp:345-350 [Journal]
  39. Johannes Buchmann, Michael J. Jacobson Jr., Edlyn Teske
    On some computational problems in finite abelian groups. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1997, v:66, n:220, pp:1663-1687 [Journal]
  40. Johannes Buchmann, Victor Shoup
    Constructing nonresidues in finite fields and the extended Riemann hypothesis. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1996, v:65, n:215, pp:1311-1326 [Journal]
  41. Johannes Buchmann, Erik Dahmen, Elena Klintsevich, Katsuyuki Okeya, Camille Vuillaume
    Merkle Signatures with Virtually Unlimited Signature Capacity. [Citation Graph (0, 0)][DBLP]
    ACNS, 2007, pp:31-45 [Conf]
  42. Alexander Wiesmaier, Ulrich Rauchschwalbe, Christoph Ludwig, Birgit Henhapl, Markus Ruppert, Johannes Buchmann
    Intrinsically Legal-For-Trade Objects by Digital Signatures [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  43. On Coercion-Resistant Electronic Elections with Linear Work. [Citation Graph (, )][DBLP]

  44. A Taxonomy Refining the Security Requirements for Electronic Voting: Analyzing Helios as a Proof of Concept. [Citation Graph (, )][DBLP]

  45. Algebraic Attack on the MQQ Public Key Cryptosystem. [Citation Graph (, )][DBLP]

  46. Fast Hash-Based Signatures on Constrained Devices. [Citation Graph (, )][DBLP]

  47. Towards the impact of the operational environment on the security of e-voting. [Citation Graph (, )][DBLP]

  48. Classifying Privacy and Verifiability Requirements for Electronic Voting. [Citation Graph (, )][DBLP]

  49. Elektronische Wahlen: Verifizierung vs. Zertifizierung. [Citation Graph (, )][DBLP]

  50. MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals. [Citation Graph (, )][DBLP]

  51. Secure Parameters for SWIFFT. [Citation Graph (, )][DBLP]

  52. Efficiency Improvement for NTRU. [Citation Graph (, )][DBLP]

  53. Public Key Authentication with Memory Tokens. [Citation Graph (, )][DBLP]

  54. Developing a Legal Framework for Remote Electronic Voting. [Citation Graph (, )][DBLP]

  55. Towards long-term free and secret electronic elections providing voter-verifiability in the bulletin board model. [Citation Graph (, )][DBLP]

  56. An Evaluation and Certification Approach to Enable Voting Service Providers. [Citation Graph (, )][DBLP]

  57. Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over F2. [Citation Graph (, )][DBLP]

  58. Parallel Shortest Lattice Vector Enumeration on Graphics Cards. [Citation Graph (, )][DBLP]

  59. Explicit Hard Instances of the Shortest Vector Problem. [Citation Graph (, )][DBLP]

  60. MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy. [Citation Graph (, )][DBLP]

  61. Merkle Tree Traversal Revisited. [Citation Graph (, )][DBLP]

  62. Selecting Parameters for the Rainbow Signature Scheme. [Citation Graph (, )][DBLP]

  63. Post-quantum cryptography: lattice signatures. [Citation Graph (, )][DBLP]

  64. The Workshop - Implementing Well Structured Enterprise Applications [Citation Graph (, )][DBLP]

Search in 0.021secs, Finished in 0.026secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002