Meltem Sönmez Turan

Orcid: 0000-0002-1950-7130

According to our database1, Meltem Sönmez Turan authored at least 28 papers between 2007 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A Note on Feedback-PRF Mode of KDF from NIST SP 800-108.
IACR Cryptol. ePrint Arch., 2025

Cryptographic Treatment of Key Control Security - In Light of NIST SP 800-108.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Optimizing Implementations of Boolean Functions.
IACR Cryptol. ePrint Arch., 2024

2023
Resistance of Ascon Family Against Conditional Cube Attacks in Nonce-Misuse Setting.
IEEE Access, 2023

Final Steps of the NIST Lightweight Cryptography Standardization (keynote abstract).
Proceedings of the 30th Computer & Electronics Security Application Rendezvous Conference (C&ESAR 2023) co-located with the 8th European Cyber Week (ECW 2023), 2023

2022
New Bounds on the Multiplicative Complexity of Boolean Functions.
IACR Cryptol. ePrint Arch., 2022

2021
On the Multiplicative Complexity of Cubic Boolean Functions.
IACR Cryptol. ePrint Arch., 2021

Recovering the Key from the Internal State of Grain-128AEAD.
IACR Cryptol. ePrint Arch., 2021

2020
Observations on COMET.
IACR Cryptol. ePrint Arch., 2020

TMPS: Ticket-Mediated Password Strengthening.
Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

2019
Boolean Functions with Multiplicative Complexity 3 and 4.
IACR Cryptol. ePrint Arch., 2019

Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions.
IACR Cryptol. ePrint Arch., 2019

2018
The Multiplicative Complexity of 6-variable Boolean Functions.
IACR Cryptol. ePrint Arch., 2018

2017
The number of boolean functions with multiplicative complexity 2.
Int. J. Inf. Coding Theory, 2017

2015
Predictive Models for Min-entropy Estimation.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2015, 2015

2014
The Multiplicative Complexity of Boolean Functions on Four and Five Variables.
Proceedings of the Lightweight Cryptography for Security and Privacy, 2014

2013
Related-Key Slide Attacks on Block Ciphers with Secret Components.
Proceedings of the Lightweight Cryptography for Security and Privacy, 2013

A Chosen IV Related Key Attack on Grain-128a.
Proceedings of the Information Security and Privacy - 18th Australasian Conference, 2013

2012
On The Nonlinearity of Maximum-length NFSR Feedbacks.
IACR Cryptol. ePrint Arch., 2012

PDR: A Prevention, Detection and Response Mechanism for Anomalies in Energy Control Systems.
Proceedings of the Critical Information Infrastructures Security, 2012

2011
Evolutionary construction of de bruijn sequences.
Proceedings of the 4th ACM Workshop on Security and Artificial Intelligence, 2011

2010
On Feedback Functions of Maximum Length Nonlinear Feedback Shift Registers.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Message Recovery and Pseudo-preimage Attacks on the Compression Function of Hamsi-256.
Proceedings of the Progress in Cryptology, 2010

Near-Collisions for the Reduced Round Versions of Some Second Round SHA-3 Compression Functions Using Hill Climbing.
Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

2009
Cryptanalysis of the ESSENCE Family of Hash Functions.
Proceedings of the Information Security and Cryptology - 5th International Conference, 2009

2008
On Independence and Sensitivity of Statistical Randomness Tests.
Proceedings of the Sequences and Their Applications, 2008

New Distinguishers Based on Random Mappings against Stream Ciphers.
Proceedings of the Sequences and Their Applications, 2008

2007
A Framework for Chosen IV Statistical Analysis of Stream Ciphers.
Proceedings of the Progress in Cryptology, 2007


  Loading...