( en | de | ru )

 

Disambiguation of "Herold, Gottfried"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations.

, , , , and . CRYPTO (1), volume 8616 of Lecture Notes in Computer Science, page 261-279. Springer, (2014)

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.

Gottfried Herold

Eugen Herold

Gerhard Herold

Max Herold

Walter Herold

 

Other publications of authors with the same name

Polly Cracker, Revisited., , , , and . Electron. Colloquium Comput. Complex., (2012)An Algebraic Framework for Diffie-Hellman Assumptions., , , , and . CRYPTO (2), volume 8043 of Lecture Notes in Computer Science, page 129-147. Springer, (2013)The General Sieve Kernel and New Records in Lattice Reduction., , , , , and . EUROCRYPT (2), volume 11477 of Lecture Notes in Computer Science, page 717-746. Springer, (2019)Improved Algorithms for the Approximate k-List Problem in Euclidean Norm., and . Public Key Cryptography (1), volume 10174 of Lecture Notes in Computer Science, page 16-40. Springer, (2017)Polly Cracker, revisited., , , , and . Des. Codes Cryptogr., 79 (2): 261-302 (2016)Speed-Ups and Time-Memory Trade-Offs for Tuple Lattice Sieving., , and . Public Key Cryptography (1), volume 10769 of Lecture Notes in Computer Science, page 407-436. Springer, (2018)Speed-ups and time-memory trade-offs for tuple lattice sieving., , and . IACR Cryptology ePrint Archive, (2017)Polly Cracker, Revisited, Revisited.. Public Key Cryptography, volume 7293 of Lecture Notes in Computer Science, page 17-33. Springer, (2012)On the asymptotic complexity of solving LWE., , and . Des. Codes Cryptogr., 86 (1): 55-83 (2018)New Attacks for Knapsack Based Cryptosystems., and . SCN, volume 7485 of Lecture Notes in Computer Science, page 326-342. Springer, (2012)