Search Results

Documents authored by Nyberg, Kaisa


Document
Symmetric Cryptography (Dagstuhl Seminar 20041)

Authors: Nils Gregor Leander, Bart Mennink, Kaisa Nyberg, and Kan Yasuda

Published in: Dagstuhl Reports, Volume 10, Issue 1 (2020)


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 20041 "Symmetric Cryptography". The seminar was held on January 19-24, 2020 in Schloss Dagstuhl - Leibniz Center for Informatics. This was the seventh seminar in the series "Symmetric Cryptography". Previous editions were held in 2007, 2009, 2012, 2014, 2016, and 2018. Participants of the seminar presented their ongoing work and new results on topics of (quantum) cryptanalysis and provable security of symmetric cryptographic primitives. In this report, a brief summary of the seminar is given followed by the abstracts of given talks.

Cite as

Nils Gregor Leander, Bart Mennink, Kaisa Nyberg, and Kan Yasuda. Symmetric Cryptography (Dagstuhl Seminar 20041). In Dagstuhl Reports, Volume 10, Issue 1, pp. 130-143, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)


Copy BibTex To Clipboard

@Article{leander_et_al:DagRep.10.1.130,
  author =	{Leander, Nils Gregor and Mennink, Bart and Nyberg, Kaisa and Yasuda, Kan},
  title =	{{Symmetric Cryptography (Dagstuhl Seminar 20041)}},
  pages =	{130--143},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2020},
  volume =	{10},
  number =	{1},
  editor =	{Leander, Nils Gregor and Mennink, Bart and Nyberg, Kaisa and Yasuda, Kan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.10.1.130},
  URN =		{urn:nbn:de:0030-drops-124023},
  doi =		{10.4230/DagRep.10.1.130},
  annote =	{Keywords: (quantum) cryptanalysis, constrained platforms, symmetric cryptography}
}
Document
Symmetric Cryptography (Dagstuhl Seminar 18021)

Authors: Joan Daemen, Tetsu Iwata, Nils Gregor Leander, and Kaisa Nyberg

Published in: Dagstuhl Reports, Volume 8, Issue 1 (2018)


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 18021 "Symmetric Cryptography", which was held on January 7-12, 2018 in Schloss Dagstuhl - Leibniz Center for Informatics. The seminar was the sixth in a series of Dagstuhl seminars on "Symmetric Cryptography", previously held in 2007, 2009, 2012, 2014, and 2016. During the seminar, many of the participants presented their current research in the design, analysis, and application of symmetric cryptographic algorithms, including ongoing work and open problems. This report documents the abstracts or extended abstracts of the talks presented during the seminar, as well as summaries of the discussion sessions.

Cite as

Joan Daemen, Tetsu Iwata, Nils Gregor Leander, and Kaisa Nyberg. Symmetric Cryptography (Dagstuhl Seminar 18021). In Dagstuhl Reports, Volume 8, Issue 1, pp. 1-32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@Article{daemen_et_al:DagRep.8.1.1,
  author =	{Daemen, Joan and Iwata, Tetsu and Leander, Nils Gregor and Nyberg, Kaisa},
  title =	{{Symmetric Cryptography (Dagstuhl Seminar 18021)}},
  pages =	{1--32},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{1},
  editor =	{Daemen, Joan and Iwata, Tetsu and Leander, Nils Gregor and Nyberg, Kaisa},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.8.1.1},
  URN =		{urn:nbn:de:0030-drops-92832},
  doi =		{10.4230/DagRep.8.1.1},
  annote =	{Keywords: symmetric cryptography, cryptanalysis, authenticated encryption, cryptography for IoT, mass surveillance}
}
Document
Symmetric Cryptography (Dagstuhl Seminar 16021)

Authors: Frederik Armknecht, Tetsu Iwata, Kaisa Nyberg, and Bart Preneel

Published in: Dagstuhl Reports, Volume 6, Issue 1 (2016)


Abstract
From 10.01.2016 to 15.01.2016, the Seminar 16021 in Symmetric Cryptography was held in Schloss Dagstuhl-Leibniz Center for Informatics. It was the fifth in the series of the Dagstuhl seminars "Symmetric Cryptography" held in 2007, 2009, 2012, and 2014. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations were given during the seminar. The first section describes the seminar topics and goals in general.

Cite as

Frederik Armknecht, Tetsu Iwata, Kaisa Nyberg, and Bart Preneel. Symmetric Cryptography (Dagstuhl Seminar 16021). In Dagstuhl Reports, Volume 6, Issue 1, pp. 34-54, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@Article{armknecht_et_al:DagRep.6.1.34,
  author =	{Armknecht, Frederik and Iwata, Tetsu and Nyberg, Kaisa and Preneel, Bart},
  title =	{{Symmetric Cryptography (Dagstuhl Seminar 16021)}},
  pages =	{34--54},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{6},
  number =	{1},
  editor =	{Armknecht, Frederik and Iwata, Tetsu and Nyberg, Kaisa and Preneel, Bart},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.6.1.34},
  URN =		{urn:nbn:de:0030-drops-58088},
  doi =		{10.4230/DagRep.6.1.34},
  annote =	{Keywords: authenticity, block ciphers, confidentiality, cryptanalysis, hash functions, integrity, lightweight cryptography, provable security, stream ciphers}
}
Document
Statistical Tests for Key Recovery Using Multidimensional Extension of Matsui's Algorithm 1

Authors: Miia Hermelin, Joo Yeon Cho, and Kaisa Nyberg

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


Abstract
In one dimension, there is essentially just one binomially distributed statistic, bias or correlation, for testing correctness of a key bit in Matsui's Algorithm 1. In multiple dimensions, different statistical approaches for finding the correct key candidate are available. The purpose of this work is to investigate the efficiency of such test in theory and practice, and propose a new key class ranking statistic using distributions based on multidimensional linear approximation and generalisation of the ranking statistic presented by Selc cuk.

Cite as

Miia Hermelin, Joo Yeon Cho, and Kaisa Nyberg. Statistical Tests for Key Recovery Using Multidimensional Extension of Matsui's Algorithm 1. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 9031, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{hermelin_et_al:DagSemProc.09031.14,
  author =	{Hermelin, Miia and Cho, Joo Yeon and Nyberg, Kaisa},
  title =	{{Statistical Tests for Key Recovery Using Multidimensional   Extension of Matsui's Algorithm 1}},
  booktitle =	{Symmetric Cryptography},
  pages =	{1--14},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09031.14},
  URN =		{urn:nbn:de:0030-drops-19541},
  doi =		{10.4230/DagSemProc.09031.14},
  annote =	{Keywords: Block cipher, key recovery attacks, key ranking, linear cryptanalysis, multidimensional approximation}
}
Document
A Key-Recovery Attack on SOBER-128

Authors: Kaisa Nyberg and Risto Hakala

Published in: Dagstuhl Seminar Proceedings, Volume 7021, Symmetric Cryptography (2007)


Abstract
In this talk we consider linear approximations of layered cipher constructions with secret key-dependent constants that are inserted between layers, and where the layers have strong interdependency. Then clearly, averaging over the constant would clearly be wrong as it will break the interdependencies, and the Piling Up-lemma cannot be used. We show how to use linear approximations to divide the constants into constant classes, not necessary determined by a linear relation. As an example, a nonlinear filter generator SOBER-128 is considered and we show how to extend Matsui's Algorithm I in this case. Also the possibility of using multiple linear approximations simultaneously is considered.

Cite as

Kaisa Nyberg and Risto Hakala. A Key-Recovery Attack on SOBER-128. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 7021, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@InProceedings{nyberg_et_al:DagSemProc.07021.4,
  author =	{Nyberg, Kaisa and Hakala, Risto},
  title =	{{A Key-Recovery Attack on SOBER-128}},
  booktitle =	{Symmetric Cryptography},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7021},
  editor =	{Eli Biham and Helena Handschuh and Stefan Lucks and Vincent Rijmen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07021.4},
  URN =		{urn:nbn:de:0030-drops-10188},
  doi =		{10.4230/DagSemProc.07021.4},
  annote =	{Keywords: Linear approximations, correlation, linear cryptanalysis, key recovery attack, piling-up lemma, SOBER-128}
}
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