( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups.

, и . INDOCRYPT, том 3348 из Lecture Notes in Computer Science, стр. 275-289. Springer, (2004)

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.

Françoise Rat

Françoise Dorison

Françoise Rampelberg

Françoise Cartwright

Françoise Krüger

 

Другие публикации лиц с тем же именем

Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems., и . INDOCRYPT, том 2904 из Lecture Notes in Computer Science, стр. 235-251. Springer, (2003)Interactivity in Constructive Cryptography : Modeling and Applications to Updatable Encryption and Private Information Retrieval., и . CoRR, (2022)Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups., и . INDOCRYPT, том 3348 из Lecture Notes in Computer Science, стр. 275-289. Springer, (2004)Security analysis of word problem-based cryptosystems., и . Des. Codes Cryptogr., 54 (1): 29-41 (2010)On Self-Dual Affine-Invariant Codes., и . J. Comb. Theory, Ser. A, 67 (2): 223-244 (1994)Generic constructions of PoRs from codes and instantiations., и . J. Math. Cryptol., 13 (2): 81-106 (2019)Cryptanalysis of MinRank., , и . CRYPTO, том 5157 из Lecture Notes in Computer Science, стр. 280-296. Springer, (2008)More on the covering radius of BCH codes., и . IEEE Trans. Inf. Theory, 42 (3): 1023-1028 (1996)New proofs of retrievability using locally decodable codes., и . ISIT, стр. 1809-1813. IEEE, (2016)A Framework for the Design of Secure and Efficient Proofs of Retrievability., и . IACR Cryptol. ePrint Arch., (2022)