Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes (Q3452347): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-68697-5_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1580599221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Truncated Integer Variables Satisfying Linear Congruences / 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: Q3210162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Reduced Lattice Bases and Successive Minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757257 / 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: Generating EIGamal Signatures Without Knowing the Secret Key / rank
 
Normal rank

Latest revision as of 01:08, 11 July 2024

scientific article
Language Label Description Also known as
English
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
scientific article

    Statements

    Identifiers