RSA and Elliptic Curve Least Significant Bit Security (Q2946472): 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.1007/978-3-319-16295-9_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W939065709 / 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: A Simple Unpredictable Pseudo-Random Number Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic VLSI Arrays for Polynomial GCD Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Randomness Extraction from a Diffie-Hellman Element / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / 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: Practical Chosen Ciphertext Secure Encryption from Factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting cryptographic key sizes / 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: On the bit security of the weak Diffie-Hellman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational problems associated with Racah algebra / rank
 
Normal rank

Latest revision as of 18:27, 10 July 2024

scientific article
Language Label Description Also known as
English
RSA and Elliptic Curve Least Significant Bit Security
scientific article

    Statements

    RSA and Elliptic Curve Least Significant Bit Security (English)
    0 references
    0 references
    0 references
    17 September 2015
    0 references
    RSA
    0 references
    elliptic curve
    0 references
    Diffie-Hellman
    0 references
    least significant bit
    0 references
    oracle
    0 references
    integer factorization
    0 references
    discrete log problem
    0 references

    Identifiers