Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Optimality of Lattices for the Coppersmith Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: RSA and Rabin Functions: Certain Parts are as Hard as the Whole / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5550483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an extension of the definition of transfinite diameter and some applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3984268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite morphisms to projective space and capacity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small solutions to polynomial equations, and low exponent RSA vulnerabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Factoring Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On algebraic equations with integral coefficients whose roots belong to a given point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger security proofs for RSA and Rabin bits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The security of all RSA and discrete log bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using LLL-Reduction for Solving RSA and Factorization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of the sectional capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity theory on algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5745831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Provable Security of an Efficient RSA-Based Pseudorandom Generator / rank
 
Normal rank

Latest revision as of 09:23, 13 July 2024

scientific article
Language Label Description Also known as
English
Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials
scientific article

    Statements

    Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 2017
    0 references
    0 references
    Coppersmith's method
    0 references
    lattices
    0 references
    polynomial congruences
    0 references
    capacity theory
    0 references
    RSA
    0 references
    0 references
    0 references