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

Deniz Toz

dblp:70/331 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

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

Security and privacy · 7 · 1 first-authorSystems, architecture and hardware · 1

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
4 papers
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
hash functions
0.432013
SPONGENT: The Design Space of Lightweight Cryptographic Hashing · IEEE Trans. Computers 2013
spongent: A Lightweight Hash Function · CHES 2011
Rebound Attack on JH42 · ASIACRYPT 2011
Cryptographic primitives and cryptanalysis › hash functions › dedicated hash functions
lightweight hash function
0.322013
SPONGENT: The Design Space of Lightweight Cryptographic Hashing · IEEE Trans. Computers 2013
spongent: A Lightweight Hash Function · CHES 2011
Cryptographic primitives and cryptanalysis › hash functions › hash function constructions
sponge construction
0.212013
SPONGENT: The Design Space of Lightweight Cryptographic Hashing · IEEE Trans. Computers 2013
Cryptographic primitives and cryptanalysis
block cipher cryptanalysis
0.112012
Differential Analysis of the LED Block Cipher · ASIACRYPT 2012
Integrated circuit design
ASIC design
0.012013
SPONGENT: The Design Space of Lightweight Cryptographic Hashing · IEEE Trans. Computers 2013
Internet of things and sensor networks › iot security
constrained device security
0.012011
spongent: A Lightweight Hash Function · CHES 2011

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

differential cryptanalysis · 0.5security analysis · 0.3sponge construction · 0.2rebound attack · 0.1
YearPublicationVenuePosition
2015 Related-key rectangle cryptanalysis of Rijndael-160 and Rijndael-192
abstract
In this study, the authors present the first related‐key rectangle cryptanalysis of Rijndael‐160/160 and Rijndael‐192/192. The author's attack on Rijndael‐160/160 covers eight rounds. The attack complexities are 2 126.5 chosen plaintexts, 2 129.28 8‐round Rijndael‐160/160 encryptions and 2 132.82 bytes. Their attack on Rijndael‐192/192 covers ten rounds. It requires 2 179 chosen plaintexts, 2 181.09 10‐round Rijndael‐192/192 encryptions and 2 185.59 bytes memory. These are the currently best cryptanalytic results on Rijndael‐160/160 and Rijndael‐192/192 in terms of the number of attacked rounds. Furthermore, their results show that the slow diffusion in the key schedule of Rijndael makes it a target for this type of analysis.
Qingju Wang 0001, Zhiqiang Liu 0001, Deniz Toz, Kerem Varici, Dawu Gu
IET Inf. Secur.3
2013 Collisions for the WIDEA-8 Compression Function
Florian Mendel, Vincent Rijmen, Deniz Toz, Kerem Varici
CT-RSA3
2013 SPONGENT: The Design Space of Lightweight Cryptographic Hashing
abstract
The design of secure yet efficiently implementable cryptographic algorithms is a fundamental problem of cryptography. Lately, lightweight cryptography--optimizing the algorithms to fit the most constrained environments--has received a great deal of attention, the recent research being mainly focused on building block ciphers. As opposed to that, the design of lightweight hash functions is still far from being well investigated with only few proposals in the public domain. In this paper, we aim to address this gap by exploring the design space of lightweight hash functions based on the sponge construction instantiated with present-type permutations. The resulting family of hash functions is called spongent. We propose 13 spongent variants--or different levels of collision and (second) preimage resistance as well as for various implementation constraints. For each of them, we provide several ASIC hardware implementations--ranging from the lowest area to the highest throughput. We make efforts to address the fairness of comparison with other designs in the field by providing an exhaustive hardware evaluation on various technologies, including an open core library. We also prove essential differential properties of spongent permutations, give a security analysis in terms of collision and preimage resistance, as well as study in detail dedicated linear distinguishers.
Andrey Bogdanov, Miroslav Knezevic, Gregor Leander, Deniz Toz, Kerem Varici, Ingrid Verbauwhede
IEEE Trans. Computers4
2012 Differential Analysis of the LED Block Cipher
Florian Mendel, Vincent Rijmen, Deniz Toz, Kerem Varici
ASIACRYPT3
2011 Rebound Attack on JH42
María Naya-Plasencia, Deniz Toz, Kerem Varici
ASIACRYPT2
2011 spongent: A Lightweight Hash Function
Andrey Bogdanov, Miroslav Knezevic, Gregor Leander, Deniz Toz, Kerem Varici, Ingrid Verbauwhede
CHES4
2010 Rebound Attack on Reduced-Round Versions of JH
Vincent Rijmen, Deniz Toz, Kerem Varici
FSE2
2008 Analysis of Two Attacks on Reduced-Round Versions of the SMS4
Deniz Toz, Orr Dunkelman
ICICS1