( en | de | ru )

 

Disambiguation of "Bouillaguet, Charles"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Lattice-Based Encryption: Stretching Spring.

, , , and . PQCrypto, volume 10346 of Lecture Notes in Computer Science, page 125-142. Springer, (2017)

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.

Charles Horowitz

Charles Grard

Charles Zschau

Charles Delagardelle

Charles Agwu

 

Other publications of authors with the same name

Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract)., , and . ASIACRYPT (1), volume 8873 of Lecture Notes in Computer Science, page 63-84. Springer, (2014)We are on the Same Side. Alternative Sieving Strategies for the Number Field Sieve., , , and . ASIACRYPT (4), volume 14441 of Lecture Notes in Computer Science, page 138-166. Springer, (2023)A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over F2., , and . SOSA, page 285-296. SIAM, (2022)Fast Lattice-Based Encryption: Stretching Spring., , , and . PQCrypto, volume 10346 of Lecture Notes in Computer Science, page 125-142. Springer, (2017)Attacks on Hash Functions Based on Generalized Feistel: Application to Reduced-Round Lesamnta and SHAvite-3512., , , and . Selected Areas in Cryptography, volume 6544 of Lecture Notes in Computer Science, page 18-35. Springer, (2010)Sparse Gaussian Elimination Modulo p: An Update., and . CASC, volume 9890 of Lecture Notes in Computer Science, page 101-116. Springer, (2016)Fast Exhaustive Search for Polynomial Systems in F2., , , , , and . IACR Cryptology ePrint Archive, (2010)Algorithms for some hard problems and cryptographic attacks against specific cryptographic primitives. (Études d'hypothèses algorithmiques et attaques de primitives cryptographiques).. Paris Diderot University, France, (2011)Les attaques cryptographiques sont-elles toujours meilleures que la force brute ?. (2022)Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques., and . Selected Areas in Cryptography, volume 5381 of Lecture Notes in Computer Science, page 245-261. Springer, (2008)