( en | de | ru )

 

Disambiguation of "Santini, Paolo"

Author of the publication

copydeleteadd this publication to your clipboard
On the Computational Hardness of the Code Equivalence Problem in Cryptography.

, , , and . IACR Cryptol. ePrint Arch., (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Giordano Paolo

Guillaume Santini

Elvira Santini

Marina Santini

Cristian Santini KIT

 

Other publications of authors with the same name

Cryptanalysis of a One-Time Code-Based Digital Signature Scheme., , and . CoRR, (2018)On the Hardness of the Lee Syndrome Decoding Problem., , , , and . CoRR, (2020)Security of generalised Reed-Solomon code-based cryptosystems., , , , and . IET Inf. Secur., 13 (4): 404-410 (2019)A Novel Attack to the Permuted Kernel Problem., , and . ISIT, page 1441-1446. IEEE, (2022)Zero-Knowledge Proofs from the Action Subgraph., , and . IACR Cryptol. ePrint Arch., (2023)On Linear Equivalence, Canonical Forms, and Digital Signatures., , and . IACR Cryptol. ePrint Arch., (2023)Designing a Practical Code-based Signature Scheme from Zero-Knowledge Proofs with Trusted Setup., , and . IACR Cryptol. ePrint Arch., (2021)LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action., , , and . IACR Cryptol. ePrint Arch., (2021)Designing Efficient Dyadic Operations for Cryptographic Applications., , , and . J. Math. Cryptol., 14 (1): 95-109 (2020)LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem., , , and . PQCrypto, volume 12841 of Lecture Notes in Computer Science, page 23-43. Springer, (2021)