Zobrazeno 1 - 7
of 7
pro vyhledávání: '"El Housni, Youssef"'
Autor:
El Housni, Youssef
Publikováno v:
ACNS2023-21st International Conference on Applied Cryptography and Network Security
ACNS2023-21st International Conference on Applied Cryptography and Network Security, Jun 2023, Kyoto, Japan
ACNS2023-21st International Conference on Applied Cryptography and Network Security, Jun 2023, Kyoto, Japan
International audience; Bilinear pairings have been used in different cryptographic applications and demonstrated to be a key building block for a plethora of constructions. In particular, some Succinct Non-interactive ARguments of Knowledge (SNARKs)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5c5ad0fa19558c20ad8962259bc1c9d9
https://hal.science/hal-03777499
https://hal.science/hal-03777499
Autor:
Botrel, Gautam, El Housni, Youssef
The bottleneck in the proving algorithm of most of elliptic-curve-based SNARK proof systems is the Multi-Scalar-Multiplication (MSM) algorithm. In this paper we give an overview of a variant of the Pippenger MSM algorithm together with a set of optim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bfd1f8d1146c4b4aa86204326ec40625
https://hal.science/hal-03922635/document
https://hal.science/hal-03922635/document
Publikováno v:
Designs, Codes & Cryptography; Nov2023, Vol. 91 Issue 11, p3333-3378, 46p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
El Housni, Youssef
Publikováno v:
Other [cs.OH]. Institut Polytechnique de Paris, 2022. English. ⟨NNT : 2022IPPAX104⟩
A proof system is a protocol where one party (called the prover) tries to convince another party (called the verifier) that a given state ment is true. In the class of non-interactive proof systems, a particularly interesting concept for proving the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7d17c654fce9f9b7b0d6ca585bc02c87
https://hal.science/tel-03922488
https://hal.science/tel-03922488
Autor:
El Housni, Youssef
The history of cryptography can be split into two eras: the classical era and the modern era. The turning point between the two occurred when asymmetric cryptography was introduced. Elliptic curves are one of the most interesting tools used in this a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::0d2b49faaa8345bc45579b0c3a1cf8a5
https://hal.archives-ouvertes.fr/hal-01914807
https://hal.archives-ouvertes.fr/hal-01914807