Improved attacks on sLiSCP permutation and tight bound of limited birthday distinguishers
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Improved attacks on sLiSCP permutation and tight bound of limited birthday distinguishers ; volume:2020 ; number:4 ; pages:147-172
IACR transactions on symmetric cryptology ; 2020, Heft 4, 147-172
- Classification
-
Informatik
- Creator
-
Hosoyamada, Akinori
Naya-Plasencia, María
Sasaki, Yu
- DOI
-
10.46586/tosc.v2020.i4.147-172
- URN
-
urn:nbn:de:hbz:294-ToSC-2161
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:38 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Hosoyamada, Akinori
- Naya-Plasencia, María
- Sasaki, Yu
Other Objects (12)
Permutation-Based Hashing Beyond the Birthday Bound
Beyond-birthday-bound security for 4-round linear Substitution-Permutation Networks
CTET+: A beyond-birthday-bound secure tweakable enciphering scheme using a single pseudorandom permutation
Further attacks on the birational permutation signature schemes
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Permutation-Based Hashing Beyond the Birthday Bound
Beyond-birthday-bound security for 4-round linear Substitution-Permutation Networks
CTET+: A beyond-birthday-bound secure tweakable enciphering scheme using a single pseudorandom permutation
Further attacks on the birational permutation signature schemes
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Permutation-Based Hashing Beyond the Birthday Bound
Beyond-birthday-bound security for 4-round linear Substitution-Permutation Networks
CTET+: A beyond-birthday-bound secure tweakable enciphering scheme using a single pseudorandom permutation
Further attacks on the birational permutation signature schemes
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes