標(biāo)題: Titlebook: Algorithmic Number Theory; Third International Joe P. Buhler Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 1998 Analysis.P [打印本頁(yè)] 作者: EFFCT 時(shí)間: 2025-3-21 18:37
書(shū)目名稱(chēng)Algorithmic Number Theory影響因子(影響力)
書(shū)目名稱(chēng)Algorithmic Number Theory影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Number Theory網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Algorithmic Number Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Number Theory被引頻次
書(shū)目名稱(chēng)Algorithmic Number Theory被引頻次學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Number Theory年度引用
書(shū)目名稱(chēng)Algorithmic Number Theory年度引用學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Number Theory讀者反饋
書(shū)目名稱(chēng)Algorithmic Number Theory讀者反饋學(xué)科排名
作者: 巫婆 時(shí)間: 2025-3-21 22:52 作者: 船員 時(shí)間: 2025-3-22 02:51
On the performance of signature schemes based on elliptic curves,ractical sizes of fields and moduli, GF(.) is roughly twice as fast as GF(2.). Furthermore, the speed of ECDSA over GF(.) is similar to the speed of DSA; it is approximately 7 times faster than RSA for signing, and 40 times slower than RSA for verification (with public exponent 3).作者: Terminal 時(shí)間: 2025-3-22 07:52
Shimura curve computations,se methods by working out several examples in varying degrees of detail. For instance, we compute coordinates for all the rational CM points on the curves . .(1) associated with the quaternion algebras over . ramified at {2,3}, {2,5}, {2,7}, and {3,5}. We conclude with a list of open questions that 作者: 違法事實(shí) 時(shí)間: 2025-3-22 09:43
,Parallel implementation of Sch?nhage’s integer GCD algorithm,d GCD algorithm..Experiments on sequential architectures show that Sch?nhage‘s algorithm overcomes other GCD algorithms implemented in two well known multiple-precision packages for input sizes larger than about 50000 bytes. In the extended case this threshold drops to 10000 bytes. In these input ra作者: Carcinogen 時(shí)間: 2025-3-22 15:55 作者: thwart 時(shí)間: 2025-3-22 18:11 作者: 暗指 時(shí)間: 2025-3-22 22:10
Primality proving using elliptic curves: An update,oldwasser and Kilian on the one hand, and Atkin on the other. The latter algorithm uses the theory of complex multiplication. The algorithm, now called ECPP, has been used for nearly ten years. The purpose of this paper is to give an account of the recent theoretical and practical improvements of EC作者: bromide 時(shí)間: 2025-3-23 02:57 作者: absolve 時(shí)間: 2025-3-23 07:24
A Montgomery-like square root for the Number Field Sieve,orm. Then the method was adapted for general numbers, and recently applied to the RSA-130 number [6], setting a new world record in factorization. The NFS has undergone several modifications since its appearance. One of these modifications concerns the last stage: the computation of the square root 作者: 我說(shuō)不重要 時(shí)間: 2025-3-23 13:09 作者: dapper 時(shí)間: 2025-3-23 17:06
New experimental results concerning the Goldbach conjecture, paper, new experiments on a Cray C916 supercomputer and on an SGI compute server with 18 R10000 CPUs are described, which extend this bound to 10.. Two consequences are that (1) under the assumption of the Generalized Riemann hypothesis, every odd number ≥7 can be written as a sum of three prime nu作者: Assault 時(shí)間: 2025-3-23 19:09
Dense admissible sets, the size of the largest admissible set in [1, .]. The Prime .-tuples Conjecture states that any for any admissible set, there are infinitely many . such that .+. .,... .+. ., .+. . are simultaneously prime. In 1974, Hensley and Richards [3] showed that . .(.)>π(.) for . sufficiently large, which sh作者: 蠟燭 時(shí)間: 2025-3-23 22:56 作者: 憤怒歷史 時(shí)間: 2025-3-24 05:39 作者: 蜿蜒而流 時(shí)間: 2025-3-24 08:19 作者: amphibian 時(shí)間: 2025-3-24 13:24 作者: 咽下 時(shí)間: 2025-3-24 15:13
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153003.jpg作者: Abutment 時(shí)間: 2025-3-24 22:31
https://doi.org/10.1007/BFb0054849Analysis; Prime; Prime number; Public Key; algorithm; algorithms; communication; cryptography; finite field; 作者: Glutinous 時(shí)間: 2025-3-25 01:26 作者: interlude 時(shí)間: 2025-3-25 03:51
Die Finanzierung der Unternehmung,se methods by working out several examples in varying degrees of detail. For instance, we compute coordinates for all the rational CM points on the curves . .(1) associated with the quaternion algebras over . ramified at {2,3}, {2,5}, {2,7}, and {3,5}. We conclude with a list of open questions that 作者: recession 時(shí)間: 2025-3-25 09:09 作者: TIA742 時(shí)間: 2025-3-25 15:19 作者: 多山 時(shí)間: 2025-3-25 19:02 作者: uveitis 時(shí)間: 2025-3-25 20:36 作者: BUOY 時(shí)間: 2025-3-26 00:29 作者: Flatus 時(shí)間: 2025-3-26 07:21 作者: Kindle 時(shí)間: 2025-3-26 12:09
Der Capability Approach in der Empirieace complexity bounds for certain ranges of running times. In particular, we give a linear time sieve that uses only .(√./(log log .).) bits of space, an ..(./ log log .) time sieve that uses .(./((log .). log log .)) bits of space, where .>1 is constant, and two super-linear time sieves that use ve作者: 神化怪物 時(shí)間: 2025-3-26 14:12
https://doi.org/10.1007/978-3-531-92749-7 paper, new experiments on a Cray C916 supercomputer and on an SGI compute server with 18 R10000 CPUs are described, which extend this bound to 10.. Two consequences are that (1) under the assumption of the Generalized Riemann hypothesis, every odd number ≥7 can be written as a sum of three prime nu作者: EXUDE 時(shí)間: 2025-3-26 18:51 作者: FIS 時(shí)間: 2025-3-26 23:15
https://doi.org/10.1007/978-3-476-04170-8licability of the Dickman function as an approximation for the number of smooth polynomials, which provides precise estimates for the discrete logarithm problem. In addition, we characterize the distribution of the two largest degrees of irreducible factors, a problem relevant to polynomial factoriz作者: Leisureliness 時(shí)間: 2025-3-27 01:18
https://doi.org/10.1007/978-3-476-04170-8. is publicly known, but neither party knows the factorization of .. Our protocols require the design of a new type of distributed primality test for testing that a given number is a product of three primes. We explain the cryptographic motivation and origin of this problem.作者: 思鄉(xiāng)病 時(shí)間: 2025-3-27 07:08 作者: OVERT 時(shí)間: 2025-3-27 09:25 作者: 和諧 時(shí)間: 2025-3-27 14:10
Die Finanzierung der Unternehmung,The Decision Diffie-Hellman assumption (.) is a gold mine. It enables one to construct efficient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems in this area.作者: 談判 時(shí)間: 2025-3-27 17:53 作者: 無(wú)法治愈 時(shí)間: 2025-3-27 23:58
Ursula M. Costa M. A. (OT), PhD.This paper describes a sieving algorithm which in a cached memory environment may be superior to familiar “cross out bits” versions of the sieve of Eratosthenes. The algorithm also seems to show some advantages over “classical” versions of the sieve of Eratosthenes when adapted to the problem of factoring numbers in an interval.作者: 放氣 時(shí)間: 2025-3-28 04:43
The Decision Diffie-Hellman problem,The Decision Diffie-Hellman assumption (.) is a gold mine. It enables one to construct efficient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems in this area.作者: catagen 時(shí)間: 2025-3-28 06:58 作者: 最小 時(shí)間: 2025-3-28 13:17 作者: Expurgate 時(shí)間: 2025-3-28 17:57 作者: idiopathic 時(shí)間: 2025-3-28 20:27
Der Capability Approach in der Empirieace complexity bounds for certain ranges of running times. In particular, we give a linear time sieve that uses only .(√./(log log .).) bits of space, an ..(./ log log .) time sieve that uses .(./((log .). log log .)) bits of space, where .>1 is constant, and two super-linear time sieves that use very little space.作者: covert 時(shí)間: 2025-3-29 01:41
https://doi.org/10.1007/978-3-476-04170-8. is publicly known, but neither party knows the factorization of .. Our protocols require the design of a new type of distributed primality test for testing that a given number is a product of three primes. We explain the cryptographic motivation and origin of this problem.作者: 有花 時(shí)間: 2025-3-29 05:46
Emil Lehnartz,Günther Lehmann,Heinrich Krautcryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory. The security of the NTRU cryptosystem comes from the interaction of the polynomial mixing system with the independence of reduction modulo two relatively prime integers . and ..作者: nerve-sparing 時(shí)間: 2025-3-29 07:29 作者: HEPA-filter 時(shí)間: 2025-3-29 12:19
Generating a product of three primes with an unknown factorization,. is publicly known, but neither party knows the factorization of .. Our protocols require the design of a new type of distributed primality test for testing that a given number is a product of three primes. We explain the cryptographic motivation and origin of this problem.作者: 來(lái)自于 時(shí)間: 2025-3-29 16:44
NTRU: A ring-based public key cryptosystem,cryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory. The security of the NTRU cryptosystem comes from the interaction of the polynomial mixing system with the independence of reduction modulo two relatively prime integers . and ..作者: meretricious 時(shí)間: 2025-3-29 23:12 作者: 搖晃 時(shí)間: 2025-3-30 03:04 作者: depreciate 時(shí)間: 2025-3-30 04:43 作者: erythema 時(shí)間: 2025-3-30 10:49 作者: 接合 時(shí)間: 2025-3-30 12:53 作者: COM 時(shí)間: 2025-3-30 20:05
,Parallel implementation of Sch?nhage’s integer GCD algorithm,s implemented in ., a computer algebra library for parallel symbolic computation we have developed..Sch?nhage‘s parallel algorithm is analyzed by using a message-passing model of computation. Experimental results on distributed memory architectures, such as the Intel Paragon, confirm the analysis.作者: 半圓鑿 時(shí)間: 2025-3-30 23:24
The complete analysis of the binary Euclidean algorithm,l analysis of the number of steps, based on a heuristic model and some unproven conjecture. Our methods are quite different, not relying on heuristic hypothesis or conjecture, and more general, since they allow us to study all the parameters of the binary continued fraction expansion.作者: 軍械庫(kù) 時(shí)間: 2025-3-31 03:31
,Cyclotomy primality proving — Recent developments, an overview of cyclotomy from the perspective of the recent research and implementation. We also discuss the drawbacks of the algorithm — the overpolynomial run time and lack of certificates — and mention some open problems which may lead to future improvements.作者: Nostalgia 時(shí)間: 2025-3-31 07:21 作者: cancellous-bone 時(shí)間: 2025-3-31 11:33
0302-9743 , Oregon, USA, in June 1998..The volume presents 46 revised full papers together with two invited surveys. The papers are organized in chapters on gcd algorithms, primality, factoring, sieving, analytic number theory, cryptography, linear algebra and lattices, series and sums, algebraic number field作者: 巨碩 時(shí)間: 2025-3-31 14:30 作者: hidebound 時(shí)間: 2025-3-31 19:22 作者: Notorious 時(shí)間: 2025-4-1 01:26 作者: Resistance 時(shí)間: 2025-4-1 02:23
Shimura curve computations,rves . .(1) associated with the quaternion algebras over . ramified at {2,3}, {2,5}, {2,7}, and {3,5}. We conclude with a list of open questions that may point the way to further computational investigation of these curves.作者: 性別 時(shí)間: 2025-4-1 09:30
Primality proving using elliptic curves: An update,d ECPP, has been used for nearly ten years. The purpose of this paper is to give an account of the recent theoretical and practical improvements of ECPP, as well as new benchmarks for integers of various sizes and a new primality record.作者: MAIZE 時(shí)間: 2025-4-1 12:14
An analytic approach to smooth polynomials over finite fields,hm problem. In addition, we characterize the distribution of the two largest degrees of irreducible factors, a problem relevant to polynomial factorization. As opposed to most earlier treatments, our methods are based on a combination of exact descriptions by generating functions and a specific complex asymptotic method.作者: Deject 時(shí)間: 2025-4-1 14:39
https://doi.org/10.1007/978-3-663-16164-6t sieving close to real roots. Estimates of the effect of the second property show that it may effect yield by as much as a factor of two. We present sieving experiments demonstrating the effect to that extent. Finally, we suggest a preliminary model to approximate the behaviour of these polynomials across the sieving region.作者: 厚顏無(wú)恥 時(shí)間: 2025-4-1 19:25
Der Capability Approach und seine Anwendungof an algorithm by Peter Montgomery. Unfortunately, Montgomery only published a preliminary version of his algorithm [15], while a description of his own implementation can be found in [7]. In this paper, we present a variant of the algorithm, compare it with the original algorithm, and discuss its complexity.作者: 中子 時(shí)間: 2025-4-1 22:59 作者: Bronchial-Tubes 時(shí)間: 2025-4-2 04:37 作者: critic 時(shí)間: 2025-4-2 11:00
Conference proceedings 1998USA, in June 1998..The volume presents 46 revised full papers together with two invited surveys. The papers are organized in chapters on gcd algorithms, primality, factoring, sieving, analytic number theory, cryptography, linear algebra and lattices, series and sums, algebraic number fields, class g作者: MOAT 時(shí)間: 2025-4-2 14:54
