Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Çağdaş Çalık"'
Publikováno v:
Cryptogr Commun
Multiplicative complexity (MC) is defined as the minimum number of AND gates required to implement a function with a circuit over the basis (AND, XOR, NOT). Boolean functions with MC 1 and 2 have been characterized in Fisher and Peralta (2002), and F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d067c051f871b10e273228b06258142
https://europepmc.org/articles/PMC7918276/
https://europepmc.org/articles/PMC7918276/
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030340285
SEA²
SEA²
Efficient circuits for multiplication of binary polynomials use what are known as Karatsuba recurrences. These methods divide the polynomials of size (i.e. number of terms) \(k \cdot n\) into k pieces of size n. Multiplication is performed by treatin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::936c6955917b75982af0570a7b63dbbd
https://doi.org/10.1007/978-3-030-34029-2_22
https://doi.org/10.1007/978-3-030-34029-2_22
Publikováno v:
Journal of Computational and Applied Mathematics. 259:522-528
The problem of counting Boolean functions with specified number s of Walsh coefficients @w in their Walsh spectrum is discussed in this paper. Strategies to solve this problem shall help solving many more problems related to desired cryptographic fea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3f5b6114bafc7bde7264add28e67e70
https://doi.org/10.1016/j.cam.2013.06.035
https://doi.org/10.1016/j.cam.2013.06.035
Autor:
Ali Doğanaksoy, Çağdaş Çalık
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642306143
SETA
SETA
We present an algorithm that computes the weight of a Boolean function from its Algebraic Normal Form (ANF). For functions acting on high number of variables (n>30) and having low number of monomials in its ANF, the algorithm is advantageous over the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cef82cce6aac99991c681e6c40fec24
https://doi.org/10.1007/978-3-642-30615-0_8
https://doi.org/10.1007/978-3-642-30615-0_8
Feedback shift registers are basic building blocks for many cryptographic primitives. Due to the insecurities of Linear Feedback Shift Register (LFSR) based systems, the use of Nonlinear Feedback Shift Registers (NFSRs) became more popular. In this w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7455e819bdb9298c20c740af7b359123
https://aperta.ulakbim.gov.tr/record/25299
https://aperta.ulakbim.gov.tr/record/25299
Autor:
Çağdaş Çalık, Meltem Sönmez Turan
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642147111
LATINCRYPT
LATINCRYPT
Hamsi is one of the second round candidates of the SHA-3 competition. In this study, we present non-random differential properties for the compression function of Hamsi-256. Based on these properties, we first demonstrate a distinguishing attack that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2334fedeb71065c84fa8baf4b52f4ddc
https://doi.org/10.1007/978-3-642-14712-8_13
https://doi.org/10.1007/978-3-642-14712-8_13
Autor:
Çağdaş Çalık, Willi Meier, Raphael C.-W. Phan, Kerem Varici, Jean-Philippe Aumasson, Onur Özen
Publikováno v:
Advances in Cryptology – ASIACRYPT 2009 ISBN: 9783642103650
ASIACRYPT
ASIACRYPT
The hash function Skein is the submission of Ferguson et al. to the NIST Hash Competition, and is arguably a serious candidate for selection as SHA-3. This paper presents the first third-party analysis of Skein, with an extensive study of its main co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb2422bdb7b210f61a5a887e8825e7fa
https://infoscience.epfl.ch/record/173023
https://infoscience.epfl.ch/record/173023