Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials.

Ted Chinburg, Brett Hemenway, Nadia Heninger, Zachary Scherr

Type: Preprint

Publication Date: 2016-01-01

Citations: 0

Locations

IACR Cryptology ePrint Archive - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials	2016	Ted Chinburg Brett Hemenway Nadia Heninger Zachary Scherr
+	Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials	2016	Ted Chinburg Brett Hemenway Nadia Heninger Zachary Scherr
+	Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials	2016	Ted Chinburg Brett Hemenway Nadia Heninger Zachary Scherr
+	Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness	2016	Fabrice Benhamouda Céline Chevalier Adrian Thillard Damien Vergnaud
+	Coppersmith's lattices and "focus groups": an attack on small-exponent RSA	2017	Stephen D. Miller Bhargav Narayanan Ramarathnam Venkatesan
+	Coppersmith's lattices and "focus groups": an attack on small-exponent RSA	2017	Stephen D. Miller Bhargav Narayanan Ramarathnam Venkatesan
+	Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding	2010	Henry Cohn Nadia Heninger
+	Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding	2010	Henry Cohn Nadia Heninger
+	A note on the Bateman-Horn conjecture	2019	Weixiong Li
+	Differences between perfect powers : prime power gaps	2021	Michael A. Bennett Samir Siksek
+ PDF Chat	Computing Hilbert class polynomials with the Chinese remainder theorem	2010	Andrew V. Sutherland
+	The Hidden Lattice Problem	2021	Luca Notarnicola Gabor Wiese
+	The Hidden Lattice Problem	2021	Luca Notarnicola Gabor Wiese
+	A complexity chasm for solving univariate sparse polynomial equations over $p$-adic fields	2020	J. Maurice Rojas Yuyu Zhu
+ PDF Chat	The Ring-LWE Problem in Lattice-Based Cryptography: The Case of Twisted Embeddings	2021	Jheyne N. Ortiz Robson Ricardo de Araujo Diego F. Aranha Sueli I. R. Costa Ricardo Dahab
+	Generalized Hash Functions based on Multivariate Ideal Lattices.	2014	Maria Francis Ambedkar Dukkipati
+ PDF Chat	Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts	2016	Claude-Pierre Jeannerod Vincent Neiger Éric Schost Gilles Villard
+	Polynomial Interpolation and Identity Testing from High Powers over Finite Fields	2015	Gábor Ivanyos Marek Karpiński Miklós Sántha Nitin Saxena Igor E. Shparlinski
+ PDF Chat	A Complexity Chasm for Solving Univariate Sparse Polynomial Equations Over p-adic Fields	2021	J. Maurice Rojas Yuyu Zhu
+ PDF Chat	Root repulsion and faster solving for very sparse polynomials over p-adic fields	2022	J. Maurice Rojas Yuyu Zhu

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors