Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Cheikh Thiecoumba Gueye"'
Publikováno v:
Journal of Advances in Mathematics and Computer Science. :37-46
One family of the cryptographic primitives is random Number Generators (RNG) which have several applications in cryptography such that password generation, nonce generation, Initialisation vector for Stream Cipher, keystream. Recently they are also u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7b863714f9971dea3278a39e5886a9b
https://doi.org/10.9734/jamcs/2021/v36i130328
https://doi.org/10.9734/jamcs/2021/v36i130328
Autor:
Thierry P. Berger, Anta Niane Gueye, Cheikh Thiecoumba Gueye, M. Anwarul Hasan, Jean Belo Klamti, Edoardo Persichetti, Tovohery H. Randrianarisoa, Olivier Ruatta
Publikováno v:
Code-Based Cryptography ISBN: 9783030983642
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc7fee88f3a6cad43bd25573fc160696
https://doi.org/10.1007/978-3-030-98365-9_3
https://doi.org/10.1007/978-3-030-98365-9_3
Publikováno v:
IEEE Transactions on Information Theory. 65:4641-4657
Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode method, whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e74b88e86f66014d06e709b2ec41250
https://doi.org/10.1109/tit.2019.2909872
https://doi.org/10.1109/tit.2019.2909872
This proceedings book gathers selected, peer-reviewed papers presented at the Fifth Scientific Days of the Doctoral School of Mathematics and Computer Sciences - S2DSMCS, held from December 20–22, 2023, at Cheikh Anta Diop University in Dakar, Sene
Autor:
Edoardo Persichetti, Pierre-Louis Cayrel, Junaid Ahmad Khan, Cheikh Thiecoumba Gueye, Jean Belo Klamti
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030409203
ICISC
ICISC
The security of McEliece’s cryptosystem relies heavily on the hardness of decoding a random linear code. The best known generic decoding algorithms are derived from the Information-Set Decoding (ISD) algorithm. This was first proposed in 1962 by Pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79c8e7ec85f512ec37162e04e05c133c
https://doi.org/10.1007/978-3-030-40921-0_12
https://doi.org/10.1007/978-3-030-40921-0_12
Publikováno v:
Algebra, Codes and Cryptology
Algebra, Codes and Cryptology, pp.97-113, 2019, ⟨10.1007/978-3-030-36237-9_6⟩
Algebra, Codes and Cryptology ISBN: 9783030362362
Algebra, Codes and Cryptology, pp.97-113, 2019, ⟨10.1007/978-3-030-36237-9_6⟩
Algebra, Codes and Cryptology ISBN: 9783030362362
In this paper we introduce a code-based cryptosystem using quasi-cyclic generalized subspace subcodes of Generalized Reed-Solomon codes in order to reduce the public key size. In our scheme the underlying Generalized Reed-Solomon code is not secret,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::773752415df34ab50e07762d8d174f2b
https://hal.archives-ouvertes.fr/hal-02474891
https://hal.archives-ouvertes.fr/hal-02474891
This book presents refereed proceedings of the First International Conference on Algebra, Codes and Cryptology, A2C 2019, held in Dakar, Senegal, in December 2019.The 14 full papers were carefully reviewed and selected from 35 submissions. The paper
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030362362
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9463299da1c16f72c9b9a90aadf4efdf
https://doi.org/10.1007/978-3-030-36237-9
https://doi.org/10.1007/978-3-030-36237-9
Publikováno v:
Codes, Cryptology and Information Security ISBN: 9783030164577
C2SI
C2SI
Zero-knowledge identification schemes allow a prover to convince a verifier that a certain fact is true, while not revealing any additional information.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8a9d8def482a9e6df818923b2e6fc3d
https://doi.org/10.1007/978-3-030-16458-4_18
https://doi.org/10.1007/978-3-030-16458-4_18
Autor:
Ousmane Ndiaye, Adrien Facon, Jean-Luc Danger, Alexander Schaub, Sylvain Guilley, Sylvie Herbel, Edoardo Persichetti, Youssef El Housni, Cheikh Thiecoumba Gueye
Publikováno v:
Cryptography
Volume 2
Issue 3
Cryptography, 2018, ⟨10.3390/cryptography2030025⟩
Cryptography, Vol 2, Iss 3, p 25 (2018)
Volume 2
Issue 3
Cryptography, 2018, ⟨10.3390/cryptography2030025⟩
Cryptography, Vol 2, Iss 3, p 25 (2018)
Multiplications in G F ( 2 N ) can be securely optimized for cryptographic applications when the integer N is small and does not match machine words (i.e., N <
32 ). In this paper, we present a set of optimizations applied to DAGS, a code-base
32 ). In this paper, we present a set of optimizations applied to DAGS, a code-base
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f415658e5a9b1a7f1cc9d8e9ab25d18