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

Çagdas Gül

dblp:351/0213 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

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

Security and privacy · 2 · 2 first-author · 2 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
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › block cipher
diffusion layer
0.712023
A New Construction Method for Keystream Generators · IEEE Trans. Inf. Forensics Secur. 2023
Cryptographic primitives and cryptanalysis › stream cipher
keystream generator
0.712023
A New Construction Method for Keystream Generators · IEEE Trans. Inf. Forensics Secur. 2023
Cryptographic primitives and cryptanalysis
stream cipher
0.712023
A New Construction Method for Keystream Generators · IEEE Trans. Inf. Forensics Secur. 2023
Cryptographic primitives and cryptanalysis › block cipher
substitution-permutation network
0.712023
A New Construction Method for Keystream Generators · IEEE Trans. Inf. Forensics Secur. 2023
Cryptographic primitives and cryptanalysis › symmetric cryptography
lightweight cryptography
0.212023
A New Construction Method for Keystream Generators · IEEE Trans. Inf. Forensics Secur. 2023

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

security proof · 0.7indistinguishability model · 0.7
YearPublicationVenuePosition
2024 Correction to "A New Construction Method for Keystream Generators"
abstract
The authors would like to extend their apologies for the inadvertent inclusion of an erroneous index of the matrix${M}$for DIZY-80 in[1]. We sincerely regret any inconvenience caused by this typographical error and appreciate the chance to rectify it.
Çagdas Gül, Orhun Kara
IEEE Trans. Inf. Forensics Secur.1
2023 A New Construction Method for Keystream Generators
abstract
We introduce a new construction method of diffusion layers for Substitution Permutation Network (SPN) structures along with its security proofs. The new method can be used in block ciphers, stream ciphers, hash functions, and sponge constructions. Moreover, we define a new stream cipher mode of operation through a fixed pseudorandom permutation and provide its security proofs in the indistinguishability model. We refer to a stream cipher as a Small Internal State Stream (SISS) cipher if its internal state size is less than twice its key size. There are not many studies about how to design and analyze SISS ciphers due to the criterion on the internal state sizes, resulting from the classical tradeoff attacks. We utilize our new mode and diffusion layer construction to design an SISS cipher having two versions, which we call DIZY. We further provide security analyses and hardware implementations of DIZY. In terms of area cost, power, and energy consumption, the hardware performance is among the best when compared to some prominent stream ciphers, especially for frame-based encryptions that need frequent initialization. Unlike recent SISS ciphers such as Sprout, Plantlet, LILLE, and Fruit; DIZY does not have a keyed update function, enabling efficient key changing.
Çagdas Gül, Orhun Kara
IEEE Trans. Inf. Forensics Secur.1