素数

词组短语

prime number

与素数相关的网络例句 [注：此内容来源于网络，仅供参考]

In additive prime number theory,a classical result of Hua states that,every suffi-ciently large odd number N can be represented as 〓,where 〓 is aninteger and 〓 are primes,which can be regarded as an extension of Goldbach-Vinogradov Theorem.

堆垒素数论中一个经典的结果是华罗庚教授证明的：任一个充分大的奇数N都可以表为N=〓+〓+〓，其中λ是一正整数，p1，p2，p3是素数，这一结果可以看作著名的Goldbach-Vinogradov定理的推广。

This method is an improvement of existing methods to construct nearly order elliptic curves using complex multiplication. To get elliptic curves with nearly prime orders, the time complexity of this method is O , but to get elliptic curves with prime orders, the time complexity arises to O .

该算法是现有利用复乘构造近乎素数阶椭圆曲线方法的改进，利用该算法构造近乎素数阶椭圆曲线的时间复杂性为O，同时，该算法可用于构造素数阶椭圆曲线，但时间复杂性上升为O。

In this paper, we introduce the algorithm of Schoof-Elkies-Atkin to compute the order of elliptic curves over finite fields. We give out a fast algorithm to compute the division polynomial f〓 and a primitive point of order 2〓. This paper also gives an improved algorithm in computing elliptic curve scalar multiplication. Using the method of complex multiplication, we find good elliptic curves for use in cryptosystems, and implemented ElGamal public-key scheme based on elliptic curves. As a co-product, we also realized the algorithm to determine primes using Goldwasser-Kilian's theorem. Lastly, the elliptic curve method of integer factorization is discussed. By making some improvement and through properly selected parameters, we successfully factored an integer of 55 digits, which is the product of two 28-digit primes.

本文介绍了计算有限域上椭圆曲线群的阶的Schoof-Elkies-Atkin算法，在具体处理算法过程中，我们给出了计算除多项式f〓的快速算法和寻找2〓阶本原点的快速算法；标量乘法是有关椭圆曲线算法中的最基本运算，本文对[Koe96]中的椭圆曲线标量乘法作了改进，提高了其运算速度；椭圆曲线的参数的选择直接影向到椭圆曲线密码体的安全性，文中利用复乘方法构造了具有良好密码特性的椭圆曲线，并实现了椭圆曲线上ElGamal公钥体制；文中还给出了利用Goldwasser-Kilian定理和椭圆曲线的复乘方法进行素数的确定判别算法；最后讨论了利用椭圆曲线分解整数的方法并进行了某些改进，在PC机上分解了两个28位素数之积的55位整数。

Or for short: A prime number is a natural number with exactly two natural divisors. A natural number that is greater than one and is not a prime is called a composite number.

用通俗的话说，就是大偶数=素数+素数*素数或大偶数=素数+素数（注：组成大偶数的素数不可能是偶素数，只能是奇素数。

Prime number ; distribution of prime ; divide exacdy ; sifting algorism of Eratosthenes ; algorism ; dynamic sifting algorism ; static sift algorism

素数；素数分布；整除； Eratosthenes筛法；算法；动态筛法；静态筛法

This paper analyzes the property of FNT, the characteristics of Kernel Matrixes and the relationship between Kernel Matrixes of two-dimensional Fermat number transform whose modulus are odd prime and image data, and presents and proves the deduction of the theorem which demonstrates the relationship among different transform matrixes corresponding to different roots of unity under the same odd prime modulus of FNT, and reveals the essence of FNT whose modulus are odd prime.

分析二维Fermat数变换性质、正反变换核的特点、二维模为奇素数的二维Fermat数变换正反变换核以及与图像数据的关系，提出了不同单位根对应变换矩阵间的关系定理的推论，证明了该推论中模为奇素数的二维Fermat数变换的不同单位根对应的变换矩阵之间的关系，揭示了模为奇素数的二维Fermat数变换的本质，在构造离散图象数据Fermat数变换时为单位根的选择奠定了理论基础。

The prime number theorem of Gauss and Legendre approximates the number of primes less than x.

素数定理高斯和勒接近若干素数不到十。

The author mainly realized the method of generating the large random numbers and judging the prime number using Lehmann means,then three pairs of secure key with different lengths (256 bits,512 bits,1024 bits) was generated to meet the demand of different security grade. In encryption module,modular multiplication arithmetic of large number was realized adopting addition chaining. In decryption module,extended Euclid was used to get inverse,and the Chinese remainder theorem was used to realize decryption,which increased the speed of decryption greatly.

作者主要实现了大随机数的生成、采用整除小素数和勒曼测试法判定素数，可以生成三种不同长度的密钥对(256位、512位、1024位)来满足不同的加密安全等级的需求；加密模块中，选用了二进制序列的乘法方法，实现了大数模幂乘运算；解密模块中，引用了扩展的欧几里德法求逆元，并采用中国剩余定理实现解密过程，大大提高了解密速度。

This paper first analyses and summarizes the ststus quo and evolution trend of encryption, some common used cryptograph are introduced, including the algorithms used in symmetric cryptosystem and asymmetirc cryptosystem. We describe the theory of each algorithms and compare the elliptic curve cryptosystem with the other two asymmetric cryptosystems to show the advantages of this algorithm. Second, the principle of ECC is discussed, including the math foundation of ECC, basic conception of elliptic curves, constructiong idea of ECC, operation on the elliptic curve and so on. Third, the current attacks of ECC were analyzed deeply, and an algorithm based on limited prime number field was constructed. We analyzed its realizability in theory, and implement it by using certain function of MIRACL software package. Latter half in this paper, the implementation model of a simple elliptic curve encryption system which based on GF has been introduced. The paper also put a deep analysis on the algorithm of point addition and point multiplication.

本文首先对密码技术的发展现状及其发展趋势进行了分析和综述，详细的介绍了私钥密码系统和公钥密码系统的发展，说明各种算法的原理和优缺点，并给出了一些典型的密码体制的简要分析，重点将椭圆曲线算法与其它几种公钥密码算法比较，说明椭圆曲线算法的优势；其次，探讨了椭圆曲线密码体制的原理，包括椭圆曲线密码的数学基础、基本概念、椭圆曲线密码体制的构造思想等问题；第三作者对椭圆曲线的攻击现状作了详细的分析，针对所使用的大素数域F_p，设计了素数域上安全椭圆曲线产生的算法，从理论上做了可实施性分析，从软件上做了具体实现；在本文的后半部分，提出了一个简单的基于有限素数域上的椭圆曲线加密方按算实现模型，并对SECES中设计的点加和点乘运算进行了深入分析。

In prime number distributed research process,and through established one kind of new sieve method and the stair theory,this article obtained about three group of prime number distribution recurrence formula: The 1st is not bigger than x the prime number integer recurrence formula;The 2nd is not bigger than x the twin prime integer recurrence formula;The(3rd Recurrence) formula.

在研究素数分布过程中，通过创立一种新的筛法与台阶理论，得到关于素数分布的三组递推公式：不大于x的素数个数与孪生素数对数量的递推公式；不大于x的孪生素数个数的递推公式；任意偶数x≥6表为两个奇素数之和与孪生素数对数量对数的递推公式。

与素数相关的网络解释 [注：此内容来源于网络，仅供参考]

cardinal number：基数, 元素数, 元组数, 集合势 基数

■ card-board drain (用于降水)纸带排水孔 カードボードドレーン | ■ cardinal number 基数, 元素数, 元组数, 集合势 基数 | ■ cardinal point 基本方位, 方位基准点 基本方位, 主方向

complex number：複素数

complex modulus 複素弾性係数 | complex number 複素数 | complex number plane 複素平面

conjugate complex number：共役複素数

conjugate 共役 | conjugate complex number 共役複素数 | conjugate gradient method 共役勾配法

prime number problem：素数问题

prime number 素数 | prime number problem 素数问题 | prime number theorem 素数定理

Prime number：素数;质数

素数(质数) (prime number)即是除了1和本身之外,不能被其他数整除. 例如:2,3,5,7,11,13,17,19,23...而奇素数即是单数的质数 (其实所有质数都是单数,除了2之外)

prime number, prime：素数

素模型|prime model | 素数|prime number, prime | 素数定理|prime number theorem

prime pair：素数对

prime number theorem 素数定理 | prime pair 素数对 | prime polynomial 素多项式

Prime：素数

通过用多种方法解决一个问题,学会比较不同策略的方法,以及如何选取最佳的策略. 判断一个策略是否为算法,要看这个策略是否满足 1)定义明确,无二义性 2)有效性,即它的步骤都是可行的 3)有限性 X.1测试素数 素数(prime)问题是

twin primes：孪生素数

twin prime constant 孪生素数常数,0.66016118158468695739278121100145... | twin primes 孪生素数 | twin pulley block 双滑轮组

twin primes：孪生素数

twin prime constant ==> 孪生素数常数,0.66016118158468695739278121100145... | twin primes ==> 孪生素数 | twin pulley block ==> 双滑轮组