幂

This paper studies QinJiuShao algorithm for fast computation of high-rank polynomial,analyses fast algorithm of modular exponentiation in RSA,and gives its implementation.

介绍了用于快速计算高次多项式值的"秦九韶算法"，并用类似思路分析了RSA算法中方幂模快速实现算法，最后给出了该算法的具体实现。

Modular exponentiation of large operands is the kernel operation in many public-key cryptosystems.It is also the bottleneck of the computing efficiency.

大数模幂乘运算是许多公钥密码体制的核心运算，也是运算效率提高的瓶颈。

However, most computers have circuits for performing arithmetic operations, such as: addition, subtraction, division, multiplication and exponentiation.

电脑有许多显著的功能，然而，许多电脑都有用来进行算术运算的电路，如加、减、乘、除、求幂。

Is also a function of extreme value theory, and many other mathematical theory of power series basis.

也是函数的极值、幂级数理论等众多数学理论的基础。

Then the coefficients of entrance region effect and the relations between them, and the flowbehaviour index n can be obtained by solving the energy integral equation. Under the assumption of the velocity distribution within boundary layer: f = 1-(1-η)n+1/n for example, co...

以边界层内幂律流体层流速度分布假设f=(1一η)~(n+1/n为特例，所求出的结果与文献[4]中的理论值和实验值比较表明，本文的计算是既简便又可靠的。

This dissertation investigates the construction of pseudo-random sequences (pseudo-random numbers) from elliptic curves and mainly analyzes their cryptographic properties by using exponential sums over rational points along elliptic curves. The main results are as follows:(1) The uniform distribution of the elliptic curve linear congruential generator is discussed and the lower bound of its nonlinear complexity is given.(2) Two large families of binary sequences are constructed from elliptic curves. The well distribution measure and the correlation measure of order k of the resulting sequences are studied. The results indicate that they are "good" binary sequences which give a positive answer to a conjecture proposed by Goubin et al.(3) A kind of binary sequences from an elliptic curve and its twisted curves over a prime field F_p. The length of the sequences is 4p. The "1" and "0" occur almost the same times. The linear complexity is at least one-fourth the period.(4) The exponential sums over rational points along elliptic curves over ring Z_ are estimated and are used to estimate the well distribution measure and the correlation measure of order k of a family of binary sequences from elliptic curves over ring Z_.(5) The correlation of the elliptic curve power number generator is given. It is proved that the sequences produced by the elliptic curve quadratic generator are asymptotically uniformly distributed.(6) The uniform distribution of the elliptic curve subset sum generator is considered.(7) We apply the linear feedback shift register over elliptic curves to produce sequences with long periods. The distribution and the linear complexity of the resulting sequences are also considered.

本文研究利用椭圆曲线构造的伪随机序列，主要利用有限域上椭圆曲线有理点群的指数和估计讨论椭圆曲线序列的密码性质——分布、相关性、线性复杂度等，得到如下主要结果：(1)系统讨论椭圆曲线-线性同余序列的一致分布性质，即该类序列是渐近一致分布的，并给出了它的非线性复杂度下界；(2)讨论两类由椭圆曲线构造的二元序列的"良性"分布与高阶相关性(correlation of order κ)，这两类序列具有"优"的密码性质，也正面回答了Goubin等提出的公开问题；(3)利用椭圆曲线及其挠曲线构造一类二元序列，其周期为4p(其中椭圆曲线定义在有限域F_p上)，0-1分布基本平衡，线性复杂度至少为周期的四分之一；(4)讨论了剩余类环Z_上的椭圆曲线的有理点的分布估计，并用于分析一类由剩余类环Z_上椭圆曲线构造的二元序列的伪随机性；(5)讨论椭圆曲线-幂生成器序列的相关性及椭圆曲线-二次生成器序列的一致分布；(6)讨论椭圆曲线-子集和序列的一致分布；(7)讨论椭圆曲线上的线性反馈移位寄存器序列的分布，线性复杂度等性质。

In 2000, F. LUCA proved that Fermat number are anti-sociable numbers, and in 2005, M. H. LE proved all powers of 2 are anti-sociable numbers. We have used the method of M. H. LE to obtain some new results of the anti-sociable numbers. For every integer n containing prime divisors that are 1 mod 4, let p mod 4 be an arbitrary prime divisor of n. There is at least one anti-sociable number in n^2, p^2n^2, p^4n^2, and p^6n^2. Therefore we can prove that anti-sociable numbers have positive density in perfect square numbers. We also give a method to find the exact anti-sociable numbers.

LUCA证明了Fermat数都是孤立数；2005年，乐茂华教授证明了2的方幂都是孤立数，用乐茂华教授的方法给出孤立数的一些新的结果：对于任意含有4w+1型素因子的正整数n，设p为n的任意一个4w+1型素因子，则在n^2，p^2n^2，p^4n^2，p^6n^2里至少有一个是孤立数，因此可以证明孤立数在完全平方数里有正密度，另外也给出求解确定孤立数的方法。

Based on the spherical harmonic functions expansion and finite difference for discretization of transport equation, an inverse power scheme is presented for calculation of the k-eigenvalue problem.

基于球谐函数展开和有限差分离散，给出了中子输运方程的源项反演逼近的反幂算法，该方法的优势是在适当的初值条件下可以显著提高计算速度。

And they got somecodes with better parameters, In [12], San Ling, Harald Niederreiter and Chaoping Xing have constructed a kind of linear codes using elements from any finite extension F_q~s(s≥3) of F_q. The rational functions are linearly combinations of the product ofsymmetric polynomial power.

San Ling，Harald Niederreiter以及Chaoping Xing在[12]中利用F_(s≥3)中元来构造一类线性码，有理函数取对称多项式的幂的乘积的线性组合，这就使码的长度可以任意大。

Let H be a normal subgorup of a finite group G such that G/H is nilpotent.

2假设H是有限群G的一个正规子群使得G/H是幂零群。

Breath, muscle contraction of the buttocks; arch body, as far as possible to hold his head, right leg straight towards the ceiling (peg-leg knee in order to avoid muscle tension).

呼气，收缩臀部肌肉；拱起身体，尽量抬起头来，右腿伸直朝向天花板（膝微屈，以避免肌肉紧张）。

The cost of moving grain food products was unchanged from May, but year over year are up 8%.

粮食产品的运输费用与5月份相比没有变化，但却比去年同期高8％。