Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Meltem Sönmez Turan"'
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:
Topics in Cryptology – CT-RSA 2020 ISBN: 9783030401856
CT-RSA
CT-RSA
We introduce the notion of TMPS: Ticket-Mediated Password Strengthening, a technique for allowing users to derive keys from passwords while imposing a strict limit on the number of guesses of their password any attacker can make, and strongly protect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::725b781b785fecf9e6564ad7240d6c4e
https://doi.org/10.1007/978-3-030-40186-3_11
https://doi.org/10.1007/978-3-030-40186-3_11
Publikováno v:
IEEE Access, Vol 11, Pp 4501-4516 (2023)
Ascon family is one of the finalists of the National Institute of Standards and Technology (NIST) lightweight cryptography standardization process. The family includes three Authenticated Encryption with Associated Data (AEAD) schemes: Ascon-128 (pri
Externí odkaz:
https://doaj.org/article/4f1c7f3d2ce74ec196975315f767a4c3
Autor:
Meltem Sönmez Turan
Publikováno v:
Cryptography and Communications. 4:233-243
Linear Feedback Shift Registers (LFSRs) are the main building block of many classical stream ciphers; however due to their inherent linearity, most of the LFSR-based designs do not offer the desired security levels. In the last decade, using Nonlinea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f396b38c1b8cf8fda994c5e9cd7e1c34
https://doi.org/10.1007/s12095-012-0067-5
https://doi.org/10.1007/s12095-012-0067-5
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662483237
CHES
CHES
Random numbers are essential for cryptography. In most real-world systems, these values come from a cryptographic pseudorandom number generator (PRNG), which in turn is seeded by an entropy source. The security of the entire cryptographic system then
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c838598579361b8606fc9df5e50f06b
https://doi.org/10.1007/978-3-662-48324-4_19
https://doi.org/10.1007/978-3-662-48324-4_19
Autor:
René Peralta, Meltem Sönmez Turan
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319163628
LightSec
LightSec
A generic way to design lightweight cryptographic primitives is to construct simple rounds using small nonlinear components such as 4\(\,\times \,\)4 S-boxes and use these iteratively (e.g., PRESENT [1] and SPONGENT [2]). In order to efficiently impl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56db45ea4d2718a2e09d8a7512b3c88c
https://doi.org/10.1007/978-3-319-16363-5_2
https://doi.org/10.1007/978-3-319-16363-5_2
Publikováno v:
International Journal of Information and Coding Theory. 4:222
Multiplicative complexity is a complexity measure defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT). Implementations of cyphers with a small number of AND gates are preferre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25e3b4ceffc61f4bb42757e36e2f9d75
https://doi.org/10.1504/ijicot.2017.10005826
https://doi.org/10.1504/ijicot.2017.10005826