Bit Security of the CDH Problems over Finite Fields (Q2807226): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ming-Qiang Wang / rank
Normal rank
 
Property / author
 
Property / author: Ming-Qiang Wang / rank
 
Normal rank
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/978-3-319-31301-6_25 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2408139740 / 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: 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: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves / 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: Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multivariate Hidden Number Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Security of All Bits Using List Decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Bits in ax + b mod p are Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security of polynomial transformations of the Diffie-Hellman key. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2746302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4950050 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:17, 12 July 2024

scientific article
Language Label Description Also known as
English
Bit Security of the CDH Problems over Finite Fields
scientific article

    Statements

    Bit Security of the CDH Problems over Finite Fields (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2016
    0 references
    0 references
    CDH
    0 references
    computational Diffie-Hellman problem
    0 references
    \(d\)-th CDH problem
    0 references
    finite fields
    0 references
    hard-core bits
    0 references
    List decoding
    0 references
    multiplication code
    0 references
    noisy oracle
    0 references
    partial-CDH problem
    0 references
    0 references