Factoring multi-power RSA moduli with primes sharing least or most significant bits (Q285897): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/gcc-2016-0002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2322455926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941863 / 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: Cryptanalysis of RSA with small prime difference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics of Public Key Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Secret Key Attack on a Variant of RSA (Due to Takagi) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The development of the number field sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring integers with elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3516443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography – PKC 2004 / 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: Q4249647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4046106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A monte carlo method for factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small secret exponent attack on RSA variant with modulus \(N=p^rq\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of RSA with primes sharing least-significant bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249341 / rank
 
Normal rank

Revision as of 00:13, 12 July 2024

scientific article
Language Label Description Also known as
English
Factoring multi-power RSA moduli with primes sharing least or most significant bits
scientific article

    Statements

    Factoring multi-power RSA moduli with primes sharing least or most significant bits (English)
    0 references
    0 references
    0 references
    19 May 2016
    0 references
    integer factorization problem
    0 references
    multi-power RSA
    0 references
    Coppersmith's theorem
    0 references
    public key cryptography
    0 references

    Identifiers