Çağdaş Çalık
Çağdaş Çalık
Bestätigte E-Mail-Adresse bei nist.gov
Titel
Zitiert von
Zitiert von
Jahr
Improved cryptanalysis of Skein
JP Aumasson, Ç Çalık, W Meier, O Özen, RCW Phan, K Varıcı
International Conference on the Theory and Application of Cryptology and …, 2009
472009
Statistical analysis of synchronous stream ciphers
MS Turan, A Doganaksoy, C Calik
Workshop on Stream Ciphers Revisited (SASC2006), 2006
422006
New randomness tests using random walk
A Doganaksoy, C Calık, F Sulak, MS Turan
National Cryptology Symposium II, 2006
172006
New distinguishers based on random mappings against stream ciphers
MS Turan, Ç Çalık, NB Saran, A Doğanaksoy
International Conference on Sequences and Their Applications, 30-41, 2008
162008
On feedback functions of maximum length nonlinear feedback shift registers
Ç ÇALIK, MS TURAN, F Özbudak
IEICE transactions on fundamentals of electronics, communications and …, 2010
142010
Message recovery and pseudo-preimage attacks on the compression function of hamsi-256
Ç Çalık, MS Turan
International Conference on Cryptology and Information Security in Latin …, 2010
132010
The multiplicative complexity of 6-variable Boolean functions
Ç Çalık, MS Turan, R Peralta
Cryptography and Communications, 1-15, 2018
122018
Status report on the first round of the NIST lightweight cryptography standardization process
MS Turan, KA McKay, Ç Çalık, D Chang, L Bassham
National Institute of Standards and Technology, Gaithersburg, MD, NIST …, 2019
92019
Computing the weight of a boolean function from its algebraic normal form
Ç Çalık, A Doğanaksoy
International Conference on Sequences and Their Applications, 89-100, 2012
82012
Computing cryptographic properties of boolean functions from the algebraic normal form representation
Ç Çalık
Ph. D. thesis, Middle East Technical University, 2013
62013
Counting Boolean functions with specified values in their Walsh spectrum
E Uyan, Ç Çalık, A Doğanaksoy
Journal of Computational and Applied Mathematics 259, 522-528, 2014
52014
Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions
LTAN Brandão, Ç Çalık, MS Turan, R Peralta
12019
Profiles for the Lightweight Cryptography Standardization Process
L Bassham, Ç Çalık, K McKay, N Mouha, MS Turan
NIST draft, 2017
12017
Searching for best Karatsuba recurrences
Ç Çalık, M Dworkin, N Dykas, R Peralta
International Symposium on Experimental Algorithms, 332-342, 2019
2019
Boolean Functions with Multiplicative Complexity 3 and 4
C Calık, MS Turan, R Peralta
2019
Profiles for the Lightweight Cryptography Standardization Process (Retired Draft)
L Bassham, Ç Çalık, K McKay, N Mouha, M Sönmez Turan
National Institute of Standards and Technology, 2017
2017
Efficient Modular Exponentiation Methods for RSA
HK Güner, M Cenk, C Calık
International Conference on Information Security and Cryptology, 2015
2015
Nonlinearity Computation for Sparse Boolean Functions
Ç Çalık
arXiv preprint arXiv:1305.0860, 2013
2013
RSA Kriptosistemi Parametreleri için Güvenlik Testi Yazılımı
E Akyıldız, Ç Çalık, M Özarar, Z Tok, O Yayla
International Conference on Information Security and Cryptology, 2013
2013
An Efficient Software Implementation of Fugue
Ç Çalık
Second SHA-3 Candidate Conference, Santa Barbara, California, USA, 23-24, 2010
2010
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20