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

DOI10.3934/amc.2021029zbMath1527.11003OpenAlexW3194293357WikidataQ114022690 ScholiaQ114022690MaRDI QIDQ6167305

Alar Leibak

Publication date: 7 July 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2021029

zbMATH Keywords

probability distributioncyclic group\(t\)-convolutionDiffie-Hellman secret keyfactorization of integer modulo \(N\)

Mathematics Subject Classification ID

Cryptography (94A60) Recurrences (11B37) Congruences; primitive roots; residue systems (11A07) Arithmetic functions; related numbers; inversion formulas (11A25) Factorization; primality (11A51)

Cites Work

• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• Probabilistic and statistical methods in cryptology. An introduction by selected topics.
• Approximate formulas for some functions of prime numbers
• On the Fourier transform of the greatest common divisor
• UNIFORM DISTRIBUTION, EXPONENTIAL SUMS, AND CRYPTOGRAPHY
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of factorizations of \(t\bmod N\) and the probability distribution of Diffie-Hellman secret keys for many users