- 更多网络例句与上有限子集相关的网络例句 [注:此内容来源于网络,仅供参考]
-
Let G be a finite group, and S a subset of G not containing theidentity element 1. The Cayley digraph Cay on G with respect to S is definedas a directed graph with vertex set G and edge set {|g∈G, s∈S}. IfS~(-1)=S, then Cay is undirected and in this case, we view two directededges and as an undirected edge {u, v}. Obviously, the right regularrepresentation R of G, the acting group of G by right multiplication, is asubgroup of the full automorphism group AutCay(G, S of Cay.
给定有限群G,设S是G的不含单位元1的子集,群G关于子集S的Cayley有向图Cay是一个以G顶点集合,而以{|g∈G,s∈S}为边集合的有向图,特别地,若S~(-1)=S,则X=Cay是无向的,此时我们把一条无向边{u,v}等同于两条有向边和,易见,群G的右正则表示R,即G在G上的右乘作用,为图Cay的全自同构群AutCay
-
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)讨论椭圆曲线上的线性反馈移位寄存器序列的分布,线性复杂度等性质。
-
Formally: Given a finite subset S N , let mex S be the smallest natural number not in S
形式上:给定一个有限子集 S N ,令mex S为没有出现在S中的最小自然数
-
The definition of fuzzy subset s entropy of fmity collection is proposed according to the definition of fuzzy event and its probability measure.
通过对模糊事件及其概率测度的定义引出有限集上模糊子集熵的概念。
-
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)讨论椭圆曲线上的线性反馈移位寄存器序列的分布,线性复杂度等性质。
- 更多网络解释与上有限子集相关的网络解释 [注:此内容来源于网络,仅供参考]
-
cofinality:共尾性
cofinal subset 共尾子集 | cofinality 共尾性 | cofinite subset 上有限子集
-
cofinite subset:上有限子集
cofinality 共尾性 | cofinite subset 上有限子集 | cofunction 余函数