On the number of factorizations of \(t\bmod N\) and the probability distribution of Diffie-Hellman secret keys for many users (Q6167305): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: UNIFORM DISTRIBUTION, EXPONENTIAL SUMS, AND CRYPTOGRAPHY / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fourier transform of the greatest common divisor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic and statistical methods in cryptology. An introduction by selected topics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341719 / rank
 
Normal rank

Latest revision as of 15:30, 1 August 2024

scientific article; zbMATH DE number 7709042
Language Label Description Also known as
English
On the number of factorizations of \(t\bmod N\) and the probability distribution of Diffie-Hellman secret keys for many users
scientific article; zbMATH DE number 7709042

    Statements

    On the number of factorizations of \(t\bmod N\) and the probability distribution of Diffie-Hellman secret keys for many users (English)
    0 references
    0 references
    7 July 2023
    0 references
    factorization of integer modulo \(N\)
    0 references
    cyclic group
    0 references
    \(t\)-convolution
    0 references
    Diffie-Hellman secret key
    0 references
    probability distribution
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references