Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Rusydi H. Makarim"'
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2023, Iss 2 (2023)
In this paper, we present an improved differential-linear cryptanalysis of the ChaCha stream cipher. Our main contributions are new differential-linear distinguishers that we were able to build thanks to the following improvements: a) we considered a
Externí odkaz:
https://doaj.org/article/10c4b21bf2e84678aa734362f76e6f37
Autor:
Rusydi H. Makarim, Raghvendra Rohit
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2022, Iss 3 (2022)
Being one of the winners of the CAESAR competition and a finalist of the ongoing NIST lightweight cryptography competition, the authenticated encryption with associated data algorithm Ascon has withstood extensive security evaluation. Despite the sub
Externí odkaz:
https://doaj.org/article/34e3d7e1ca534200bb11b5e10a2059d2
Autor:
Rusydi H. Makarim, Emanuele Bellini, Carlos Aguilar-Melchor, Nicolas Aragon, Chiara Marcolla, Florian Caullery
Publikováno v:
SN Computer Science. 2
In this work, we propose different techniques that can be used to implement the rank-based key encapsulation methods and public key encryption schemes of the ROLLO, and partially RQC, family of algorithms in a standalone, efficient and constant time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35647b34bcca12fce5a3ee56e40f897f
https://doi.org/10.1007/s42979-021-00761-y
https://doi.org/10.1007/s42979-021-00761-y
Autor:
Rusydi H. Makarim, Victor Mateu, Emanuele Bellini, Chiara Marcolla, Florian Caullery, Marc Manzano
Publikováno v:
ICCD
Recent works on reducing the size of Error Correcting Codes have investigated the usage of rank metric instead of Hamming metric. Numerous proposals for the NIST Post-Quantum Cryptography competition, including four second round candidates, rely on t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92bda034655520668f982f786ba544b6
https://doi.org/10.1109/iccd46524.2019.00051
https://doi.org/10.1109/iccd46524.2019.00051
Autor:
Rusydi H. Makarim, Putranto Hadi Utomo
Publikováno v:
Mathematics in Computer Science, 11(3-4). Birkhäuser Verlag
Mathematics in Computer Science, 11(3-4), 515-526
Mathematics in Computer Science, 11(3-4), 515-526
A Binary puzzle is a Sudoku-like puzzle with values in each cell taken from the set $$\{ 0, 1\}$$ . Let $$n \ge 4$$ be an even integer, a solved binary puzzle is an $$n \times n$$ binary array that satisfies the following conditions: (1) no three con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85be119ec82b9fb49909d9b4aa18217d
https://doi.org/10.1007/s11786-017-0322-4
https://doi.org/10.1007/s11786-017-0322-4
Autor:
Cihangir Tezcan, Rusydi H. Makarim
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319163628
LightSec
LightSec
Recently it was observed that for a particular nonzero input difference to an S-Box, some bits in all the corresponding output differences may remain invariant. These specific invariant bits are called undisturbed bits. Undisturbed bits can also be s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f4edb23819df432a1803de75bfcdba3
https://doi.org/10.1007/978-3-319-16363-5_7
https://doi.org/10.1007/978-3-319-16363-5_7
Publikováno v:
UKSim
Distributing digital document through insecure channel leads to the question of the integrity and the ownership of the file on the receiver's side. Employing hash function and digital signature algorithms solves the difficulties of the receiver to pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0c4b5d44abf361b7472199e25853dc0
https://doi.org/10.1109/uksim.2012.81
https://doi.org/10.1109/uksim.2012.81