default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeltem Sönmez Turan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i16]Meltem Sönmez Turan:
Optimizing Implementations of Boolean Functions. IACR Cryptol. ePrint Arch. 2024: 133 (2024)- 2023
- [j7]Donghoon Chang
, Deukjo Hong, Jinkeon Kang, Meltem Sönmez Turan:
Resistance of Ascon Family Against Conditional Cube Attacks in Nonce-Misuse Setting. IEEE Access 11: 4501-4516 (2023) - [c14]Meltem Sönmez Turan:
Final Steps of the NIST Lightweight Cryptography Standardization (keynote abstract). C&ESAR 2023: 17 - 2022
- [i15]Meltem Sönmez Turan:
New Bounds on the Multiplicative Complexity of Boolean Functions. IACR Cryptol. ePrint Arch. 2022: 1077 (2022) - [i14]Donghoon Chang, Deukjo Hong, Jinkeon Kang, Meltem Sönmez Turan:
Resistance of Ascon Family against Conditional Cube Attacks in Nonce-Misuse Setting. IACR Cryptol. ePrint Arch. 2022: 1456 (2022) - 2021
- [i13]Donghoon Chang, Meltem Sönmez Turan:
Recovering the Key from the Internal State of Grain-128AEAD. IACR Cryptol. ePrint Arch. 2021: 439 (2021) - [i12]Meltem Sönmez Turan, René Peralta:
On the Multiplicative Complexity of Cubic Boolean Functions. IACR Cryptol. ePrint Arch. 2021: 1041 (2021) - 2020
- [j6]Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
Boolean functions with multiplicative complexity 3 and 4. Cryptogr. Commun. 12(5): 935-946 (2020) - [c13]John Kelsey, Dana Dachman-Soled, Sweta Mishra, Meltem Sönmez Turan:
TMPS: Ticket-Mediated Password Strengthening. CT-RSA 2020: 225-253 - [i11]Daniel J. Bernstein, Henri Gilbert, Meltem Sönmez Turan:
Observations on COMET. IACR Cryptol. ePrint Arch. 2020: 1445 (2020)
2010 – 2019
- 2019
- [j5]Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
The multiplicative complexity of 6-variable Boolean functions. Cryptogr. Commun. 11(1): 93-107 (2019) - [j4]Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
Upper bounds on the multiplicative complexity of symmetric Boolean functions. Cryptogr. Commun. 11(6): 1339-1362 (2019) - [i10]John Kelsey, Dana Dachman-Soled, Sweta Mishra, Meltem Sönmez Turan:
TMPS: Ticket-Mediated Password Strengthening. IACR Cryptol. ePrint Arch. 2019: 543 (2019) - [i9]Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions. IACR Cryptol. ePrint Arch. 2019: 708 (2019) - [i8]Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
Boolean Functions with Multiplicative Complexity 3 and 4. IACR Cryptol. ePrint Arch. 2019: 1364 (2019) - 2018
- [i7]Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
The Multiplicative Complexity of 6-variable Boolean Functions. IACR Cryptol. ePrint Arch. 2018: 2 (2018) - 2017
- [j3]Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan:
The number of boolean functions with multiplicative complexity 2. Int. J. Inf. Coding Theory 4(4): 222-236 (2017) - 2015
- [c12]John Kelsey, Kerry A. McKay, Meltem Sönmez Turan:
Predictive Models for Min-entropy Estimation. CHES 2015: 373-392 - [i6]John Kelsey, Kerry A. McKay, Meltem Sönmez Turan:
Predictive Models for Min-Entropy Estimation. IACR Cryptol. ePrint Arch. 2015: 600 (2015) - [i5]Meltem Sönmez Turan, René Peralta:
The Multiplicative Complexity of Boolean Functions on Four and Five Variables. IACR Cryptol. ePrint Arch. 2015: 848 (2015) - [i4]Magnus Gausdal Find, Daniel Smith-Tone, Meltem Sönmez Turan:
The Number of Boolean Functions with Multiplicative Complexity 2. IACR Cryptol. ePrint Arch. 2015: 1041 (2015) - 2014
- [c11]Meltem Sönmez Turan, René Peralta:
The Multiplicative Complexity of Boolean Functions on Four and Five Variables. LightSec 2014: 21-33 - 2013
- [c10]Subhadeep Banik, Subhamoy Maitra, Santanu Sarkar, Meltem Sönmez Turan:
A Chosen IV Related Key Attack on Grain-128a. ACISP 2013: 13-26 - [c9]Meltem Sönmez Turan:
Related-Key Slide Attacks on Block Ciphers with Secret Components. LightSec 2013: 28-42 - 2012
- [j2]Meltem Sönmez Turan:
On the nonlinearity of maximum-length NFSR feedbacks. Cryptogr. Commun. 4(3-4): 233-243 (2012) - [c8]Cristina Alcaraz, Meltem Sönmez Turan:
PDR: A Prevention, Detection and Response Mechanism for Anomalies in Energy Control Systems. CRITIS 2012: 22-33 - [i3]Meltem Sönmez Turan:
On The Nonlinearity of Maximum-length NFSR Feedbacks. IACR Cryptol. ePrint Arch. 2012: 112 (2012) - 2011
- [c7]Meltem Sönmez Turan:
Evolutionary construction of de bruijn sequences. AISec 2011: 81-86 - [i2]Meltem Sönmez Turan:
Evolutionary Construction of de Bruijn Sequences. IACR Cryptol. ePrint Arch. 2011: 711 (2011) - 2010
- [j1]Çagdas Çalik, Meltem Sönmez Turan, Ferruh Özbudak:
On Feedback Functions of Maximum Length Nonlinear Feedback Shift Registers. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(6): 1226-1231 (2010) - [c6]Meltem Sönmez Turan, Erdener Uyan:
Near-Collisions for the Reduced Round Versions of Some Second Round SHA-3 Compression Functions Using Hill Climbing. INDOCRYPT 2010: 131-143 - [c5]Çagdas Çalik, Meltem Sönmez Turan:
Message Recovery and Pseudo-preimage Attacks on the Compression Function of Hamsi-256. LATINCRYPT 2010: 205-221 - [i1]Çagdas Çalik, Meltem Sönmez Turan:
Message Recovery and Pseudo-Preimage Attacks on the Compression Function of Hamsi-256. IACR Cryptol. ePrint Arch. 2010: 57 (2010)
2000 – 2009
- 2009
- [c4]Nicky Mouha, Gautham Sekar, Jean-Philippe Aumasson, Thomas Peyrin, Søren S. Thomsen, Meltem Sönmez Turan, Bart Preneel:
Cryptanalysis of the ESSENCE Family of Hash Functions. Inscrypt 2009: 15-34 - 2008
- [c3]Meltem Sönmez Turan, Ali Doganaksoy, Serdar Boztas:
On Independence and Sensitivity of Statistical Randomness Tests. SETA 2008: 18-29 - [c2]Meltem Sönmez Turan, Çagdas Çalik, Nurdan Buz Saran, Ali Doganaksoy:
New Distinguishers Based on Random Mappings against Stream Ciphers. SETA 2008: 30-41 - 2007
- [c1]Håkan Englund, Thomas Johansson, Meltem Sönmez Turan:
A Framework for Chosen IV Statistical Analysis of Stream Ciphers. INDOCRYPT 2007: 268-281
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
