Search Results

Documents authored by Buchmann, Johannes

Found 2 Possible Name Variants:

Buchmann, Johannes A.

Document
DOI: 10.4230/DagSemProc.09221.1
09221 Abstracts Collection – Algorithms and NumberTheory

Authors: Johannes A. Buchmann, John Cremona, and Michael Pohst

Published in: Dagstuhl Seminar Proceedings, Volume 9221, Algorithms and Number Theory (2009)

Abstract
From 24.05. to 29.05.2009, the Dagstuhl Seminar 09221 ``Algorithms and Number Theory '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Johannes A. Buchmann, John Cremona, and Michael Pohst. 09221 Abstracts Collection – Algorithms and NumberTheory. In Algorithms and Number Theory. Dagstuhl Seminar Proceedings, Volume 9221, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{buchmann_et_al:DagSemProc.09221.1,
  author =	{Buchmann, Johannes A. and Cremona, John and Pohst, Michael},
  title =	{{09221 Abstracts Collection – Algorithms and NumberTheory}},
  booktitle =	{Algorithms and Number Theory},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9221},
  editor =	{Johannes A. Buchmann and John Cremona and Michael E. Pohst},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09221.1},
  URN =		{urn:nbn:de:0030-drops-21282},
  doi =		{10.4230/DagSemProc.09221.1},
  annote =	{Keywords: Algorithms, Number Theory, Cryptography}
}
Document
DOI: 10.4230/DagSemProc.09221.2
Density of Ideal Lattices

Authors: Johannes A. Buchmann and Richard Lindner

Published in: Dagstuhl Seminar Proceedings, Volume 9221, Algorithms and Number Theory (2009)

Abstract
The security of many emph{efficient} cryptographic constructions, e.g.~collision-resistant hash functions, digital signatures, and identification schemes, has been proven assuming the hardness of emph{worst-case} computational problems in ideal lattices. These lattices correspond to ideals in the ring of integers of some fixed number field $K$. In this paper we show that the density of $n$-dimensional ideal lattices with determinant $le b$ among all lattices under the same bound is in $O(b^{1-n})$. So for lattices of dimension $> 1$ with bounded determinant, the subclass of ideal lattices is always vanishingly small.
Cite as

Johannes A. Buchmann and Richard Lindner. Density of Ideal Lattices. In Algorithms and Number Theory. Dagstuhl Seminar Proceedings, Volume 9221, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{buchmann_et_al:DagSemProc.09221.2,
  author =	{Buchmann, Johannes A. and Lindner, Richard},
  title =	{{Density of Ideal Lattices}},
  booktitle =	{Algorithms and Number Theory},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9221},
  editor =	{Johannes A. Buchmann and John Cremona and Michael E. Pohst},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09221.2},
  URN =		{urn:nbn:de:0030-drops-21256},
  doi =		{10.4230/DagSemProc.09221.2},
  annote =	{Keywords: Post-quantum cryptography, provable security, ideal lattices}
}
Document
DOI: 10.4230/DagSemProc.09031.10
MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis

Authors: Johannes A. Buchmann, Jintai Ding, Mohamed Saied Emam Mohamed, and Wael Said Abd Elmageed Mohamed

Published in: Dagstuhl Seminar Proceedings, Volume 9031, Symmetric Cryptography (2009)

Abstract
MutantXL is an algorithm for solving systems of polynomial equations that was proposed at SCC 2008 and improved in PQC 2008. This article gives an overview over the MutantXL algorithm. It also presents experimental results comparing the behavior of the MutantXL algorithm to the $F_4$ algorithm on HFE and randomly generated multivariate systems. In both cases MutantXL is faster and uses less memory than the Magma's implementation of $F_4$.
Cite as

Johannes A. Buchmann, Jintai Ding, Mohamed Saied Emam Mohamed, and Wael Said Abd Elmageed Mohamed. MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 9031, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{buchmann_et_al:DagSemProc.09031.10,
  author =	{Buchmann, Johannes A. and Ding, Jintai and Mohamed, Mohamed Saied Emam and Mohamed, Wael Said Abd Elmageed},
  title =	{{MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis}},
  booktitle =	{Symmetric Cryptography},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9031},
  editor =	{Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09031.10},
  URN =		{urn:nbn:de:0030-drops-19456},
  doi =		{10.4230/DagSemProc.09031.10},
  annote =	{Keywords: Multivariate systems, MutantXL}
}

Buchmann, Johannes

Document
DOI: 10.4230/DagSemRep.133
Computeralgebra - Software (Dagstuhl Seminar 9606)

Authors: Johannes Buchmann, Rüdiger Loos, and Roman Mäder

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Johannes Buchmann, Rüdiger Loos, and Roman Mäder. Computeralgebra - Software (Dagstuhl Seminar 9606). Dagstuhl Seminar Report 133, pp. 1-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1996)

Copy BibTex To Clipboard

@TechReport{buchmann_et_al:DagSemRep.133,
  author =	{Buchmann, Johannes and Loos, R\"{u}diger and M\"{a}der, Roman},
  title =	{{Computeralgebra - Software (Dagstuhl Seminar 9606)}},
  pages =	{1--30},
  ISSN =	{1619-0203},
  year =	{1996},
  type = 	{Dagstuhl Seminar Report},
  number =	{133},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.133},
  URN =		{urn:nbn:de:0030-drops-150201},
  doi =		{10.4230/DagSemRep.133},
}
Document
DOI: 10.4230/DagSemRep.100
Algorithms and Number Theory (Dagstuhl Seminar 9441)

Authors: Johannes Buchmann, Harald Niederreiter, Andrew M. Odlyzko, and Horst Günther Zimmer

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Johannes Buchmann, Harald Niederreiter, Andrew M. Odlyzko, and Horst Günther Zimmer. Algorithms and Number Theory (Dagstuhl Seminar 9441). Dagstuhl Seminar Report 100, pp. 1-32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1995)

Copy BibTex To Clipboard

@TechReport{buchmann_et_al:DagSemRep.100,
  author =	{Buchmann, Johannes and Niederreiter, Harald and Odlyzko, Andrew M. and Zimmer, Horst G\"{u}nther},
  title =	{{Algorithms and Number Theory (Dagstuhl Seminar 9441)}},
  pages =	{1--32},
  ISSN =	{1619-0203},
  year =	{1995},
  type = 	{Dagstuhl Seminar Report},
  number =	{100},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.100},
  URN =		{urn:nbn:de:0030-drops-149888},
  doi =		{10.4230/DagSemRep.100},
}
Document
DOI: 10.4230/DagSemRep.39
Algorithms and Number Theory (Dagstuhl Seminar 9226)

Authors: Johannes Buchmann, Harald Niederreiter, Andrew M. Odlyzko, and Horst G. Zimmer

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Johannes Buchmann, Harald Niederreiter, Andrew M. Odlyzko, and Horst G. Zimmer. Algorithms and Number Theory (Dagstuhl Seminar 9226). Dagstuhl Seminar Report 39, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1992)

Copy BibTex To Clipboard

@TechReport{buchmann_et_al:DagSemRep.39,
  author =	{Buchmann, Johannes and Niederreiter, Harald and Odlyzko, Andrew M. and Zimmer, Horst G.},
  title =	{{Algorithms and Number Theory (Dagstuhl Seminar 9226)}},
  pages =	{1--28},
  ISSN =	{1619-0203},
  year =	{1992},
  type = 	{Dagstuhl Seminar Report},
  number =	{39},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.39},
  URN =		{urn:nbn:de:0030-drops-149278},
  doi =		{10.4230/DagSemRep.39},
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact