Security of the most significant bits of the Shamir message passing scheme (Q2759102): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Q2708625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DISTRIBUTION OF DIGITS IN PERIODIC FRACTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Monte Carlo methods and pseudo-random numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3248054 / 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: Q5830713 / rank
 
Normal rank

Revision as of 20:45, 3 June 2024

scientific article
Language Label Description Also known as
English
Security of the most significant bits of the Shamir message passing scheme
scientific article

    Statements

    Security of the most significant bits of the Shamir message passing scheme (English)
    0 references
    10 December 2001
    0 references
    Shamir message passing scheme
    0 references
    bit security
    0 references
    exponential sums
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references