Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Elmar Tischhauser

dblp:28/8639 · also Elmar Wolfgang Tischhauser · DBLP profile ↗
← Back
16ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-2031-8652ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 16 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Cryptographic primitives and cryptanalysis · 100%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
authenticated encryption
1.132024
The COLM Authenticated Encryption Scheme · J. Cryptol. 2024
Twisted Polynomials and Forgery Attacks on GCM · EUROCRYPT (1) 2015
Parallelizable and Authenticated Online Ciphers · ASIACRYPT (1) 2013
Cryptographic primitives and cryptanalysis › cryptographic implementation
white-box cryptography
0.212016
Towards Practical Whitebox Cryptography: Optimizing Efficiency and Space Hardness · ASIACRYPT (1) 2016
Cryptographic primitives and cryptanalysis › public-key cryptography › signature scheme cryptanalysis
forgery attack
0.212015
Twisted Polynomials and Forgery Attacks on GCM · EUROCRYPT (1) 2015
Cryptographic primitives and cryptanalysis › authenticated encryption
GCM
0.212015
Twisted Polynomials and Forgery Attacks on GCM · EUROCRYPT (1) 2015
Cryptographic primitives and cryptanalysis › symmetric cryptography
online ciphers
0.212013
Parallelizable and Authenticated Online Ciphers · ASIACRYPT (1) 2013
Cryptographic primitives and cryptanalysis
block cipher
0.112012
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract) · EUROCRYPT 2012
Cryptographic primitives and cryptanalysis › block cipher
key-alternating ciphers
0.112012
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract) · EUROCRYPT 2012
Cryptographic primitives and cryptanalysis
provable security
0.112012
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract) · EUROCRYPT 2012
Cryptographic primitives and cryptanalysis
encryption
0.012013
Parallelizable and Authenticated Online Ciphers · ASIACRYPT (1) 2013

Methods — techniques the papers use, named apart from their topics

twisted polynomials · 0.2public permutations · 0.1provable security · 0.1
YearPublicationVenuePosition
2024 The COLM Authenticated Encryption Scheme
Elena Andreeva 0001, Andrey Bogdanov, Nilanjan Datta, Atul Luykx, Bart Mennink, Mridul Nandi, Elmar Tischhauser, Kan Yasuda
J. Cryptol.7
2020 Troika: a ternary cryptographic hash function
Stefan Kölbl, Elmar Tischhauser, Patrick Derbez, Andrey Bogdanov
Des. Codes Cryptogr.2
2016 Towards Practical Whitebox Cryptography: Optimizing Efficiency and Space Hardness
Andrey Bogdanov, Takanori Isobe 0001, Elmar Tischhauser
ASIACRYPT (1)3
2016 A MAC Mode for Lightweight Block Ciphers
Atul Luykx, Bart Preneel, Elmar Tischhauser, Kan Yasuda
FSE3
2015 Twisted Polynomials and Forgery Attacks on GCM
Mohamed Ahmed Abdelraheem, Peter Beelen, Andrey Bogdanov, Elmar Tischhauser
EUROCRYPT (1)4
2015 Comb to Pipeline: Fast Software Encryption Revisited
Andrey Bogdanov, Martin M. Lauridsen, Elmar Tischhauser
FSE3
2015 Fast and Memory-Efficient Key Recovery in Side-Channel Attacks
Andrey Bogdanov, Ilya Kizhvatov, Kamran Manzoor, Elmar Tischhauser, Marc Witteman
SAC4
2014 Internal differential collision attacks on the reduced-round Grøstl-0 hash function
Kota Ideguchi, Elmar Tischhauser, Bart Preneel
Des. Codes Cryptogr.2
2013 Parallelizable and Authenticated Online Ciphers
Elena Andreeva 0001, Andrey Bogdanov, Atul Luykx, Bart Mennink, Elmar Tischhauser, Kan Yasuda
ASIACRYPT (1)5
2013 ALE: AES-Based Lightweight Authenticated Encryption
Andrey Bogdanov, Florian Mendel, Francesco Regazzoni 0001, Vincent Rijmen, Elmar Tischhauser
FSE5
2013 On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui's Algorithm 2
Andrey Bogdanov, Elmar Tischhauser
FSE2
2012 A Simple Key-Recovery Attack on McOE-X
Florian Mendel, Bart Mennink, Vincent Rijmen, Elmar Tischhauser
CANS4
2012 Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract)
Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, François-Xavier Standaert, John P. Steinberger, Elmar Tischhauser
EUROCRYPT6
2012 A Model for Structure Attacks, with Applications to PRESENT and Serpent
Elmar Tischhauser, Bart Preneel
FSE3
2010 Improved Collision Attacks on the Reduced-Round Grøstl Hash Function
Kota Ideguchi, Elmar Tischhauser, Bart Preneel
ISC2
2010 Whirlwind: a new cryptographic hash function
abstract
A new cryptographic hash function Whirlwind is presented. We give the full specification and explain the design rationale. We show how the hash function can be implemented efficiently in software and give first performance numbers. A detailed analysis of the security against state-of-the-art cryptanalysis methods is also provided. In comparison to the algorithms submitted to the SHA-3 competition, Whirlwind takes recent developments in cryptanalysis into account by design. Even though software performance is not outstanding, it compares favourably with the 512-bit versions of SHA-3 candidates such as LANE or the original CubeHash proposal and is about on par with ECHO and MD6.
Paulo S. L. M. Barreto, Ventzislav Nikov, Svetla Nikova, Vincent Rijmen, Elmar Tischhauser
Des. Codes Cryptogr.5