default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÇagdas Çalik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j5]Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
Boolean functions with multiplicative complexity 3 and 4. Cryptogr. Commun. 12(5): 935-946 (2020)
2010 – 2019
- 2019
- [j4]Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
The multiplicative complexity of 6-variable Boolean functions. Cryptogr. Commun. 11(1): 93-107 (2019) - [j3]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) - [c5]Çagdas Çalik, Morris Dworkin, Nathan Dykas, René Peralta:
Searching for Best Karatsuba Recurrences. SEA² 2019: 332-342 - [i6]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) - [i5]Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
Boolean Functions with Multiplicative Complexity 3 and 4. IACR Cryptol. ePrint Arch. 2019: 1364 (2019) - 2018
- [i4]Çagdas Çalik, Meltem Sönmez Turan, René Peralta:
The Multiplicative Complexity of 6-variable Boolean Functions. IACR Cryptol. ePrint Arch. 2018: 2 (2018) - 2014
- [j2]Erdener Uyan, Çagdas Çalik, Ali Doganaksoy:
Counting Boolean functions with specified values in their Walsh spectrum. J. Comput. Appl. Math. 259: 522-528 (2014) - 2013
- [i3]Çagdas Çalik:
Nonlinearity Computation for Sparse Boolean Functions. CoRR abs/1305.0860 (2013) - 2012
- [c4]Çagdas Çalik, Ali Doganaksoy:
Computing the Weight of a Boolean Function from Its Algebraic Normal Form. SETA 2012: 89-100 - 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) - [c3]Çagdas Çalik, Meltem Sönmez Turan:
Message Recovery and Pseudo-preimage Attacks on the Compression Function of Hamsi-256. LATINCRYPT 2010: 205-221 - [i2]Ç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
- [c2]Jean-Philippe Aumasson, Çagdas Çalik, Willi Meier, Onur Özen, Raphael C.-W. Phan, Kerem Varici:
Improved Cryptanalysis of Skein. ASIACRYPT 2009: 542-559 - [i1]Jean-Philippe Aumasson, Çagdas Çalik, Willi Meier, Onur Özen, Raphael C.-W. Phan, Kerem Varici:
Improved Cryptanalysis of Skein. IACR Cryptol. ePrint Arch. 2009: 438 (2009) - 2008
- [c1]Meltem Sönmez Turan, Çagdas Çalik, Nurdan Buz Saran, Ali Doganaksoy:
New Distinguishers Based on Random Mappings against Stream Ciphers. SETA 2008: 30-41
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 2025-01-20 23:58 CET 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:
