兴奋过度
发表于 2025-3-25 06:11:38
Polynomials and Recurrence SequencesHere we collect some lemmas we will need later.
诽谤
发表于 2025-3-25 07:49:50
Exponential SumsAbstract.We need some bounds of exponential sums as well.
甜瓜
发表于 2025-3-25 14:11:40
Distribution and DiscrepancyHere we collect some results about the distribution properties of various sequences. Some of them are quite generic, while the others are rather specialised and tailored to our applications.
TRACE
发表于 2025-3-25 18:28:40
Arithmetic FunctionsWe use the well-know estimates.see Theorem 5.1 and Theorem 5.2 of Chapter 1 of . Also, from the inequality v(m)!≤m, we derive.The above bounds are tight. Thus although sometimes the values of Τ(m) are rather big, “on average”, much stronger bounds hold. Namely, for any X≥2.see Theorems 5.3 and 5.4 of Chapter 1 of .
mechanical
发表于 2025-3-25 20:47:07
http://reply.papertrans.cn/25/2406/240535/240535_25.png
remission
发表于 2025-3-26 02:45:12
http://reply.papertrans.cn/25/2406/240535/240535_26.png
典型
发表于 2025-3-26 06:32:05
http://reply.papertrans.cn/25/2406/240535/240535_27.png
Platelet
发表于 2025-3-26 11:53:08
Approximation of the Discrete Logarithm by Real PolynomialsHere we consider some questions about approximation of the discrete logarithm by real and even complex polynomials. Unfortunately our results are weaker than those in our previous settings.
heterodox
发表于 2025-3-26 12:39:17
http://reply.papertrans.cn/25/2406/240535/240535_29.png
下垂
发表于 2025-3-26 19:49:36
Polynomial Approximation and Arithmetic Complexity of the Diffie-Hellman Secret Keyol, is based on the still unproved assumption that recovering the value of the Diffie-Hellman secret key . from the known values of g.and g.is essentially equivalent to the discrete logarithm problem and therefore is hard. Here we show that even computation of . from g.cannot be realized by a polynomial of low degree.