首页> 外文学位 >On the Minimal Logarithmic Signature Conjecture.
【24h】

On the Minimal Logarithmic Signature Conjecture.

机译:关于最小对数签名猜想。

获取原文
获取原文并翻译 | 示例

摘要

The minimal logarithmic signature conjecture states that in any finite simple group there are subsets Ai, 1 ≤ i ≤ s such that the size ∣Ai∣ of each Ai is a prime or 4 and each element of the group has a unique expression as a product i=1sai of elements ai ∈ Ai. Logarithmic signatures have been used in the construction of several cryptographic primitives since the late 1970's [3, 15, 17, 19, 16]. The conjecture is shown to be true for various families of simple groups including cyclic groups, A n, PSLn(q) when gcd(n, q -- 1) is 1, 4 or a prime and several sporadic groups [10, 9, 12, 14, 18]. This dissertation is devoted to proving that the conjecture is true for a large class of simple groups of Lie type called classical groups. The methods developed use the structure of these groups as isometry groups of bilinear or quadratic forms. A large part of the construction is also based on the Bruhat and Levi decompositions of parabolic subgroups of these groups.;In this dissertation the conjecture is shown to be true for the following families of simple groups: the projective special linear groups PSL n(q), the projective symplectic groups PSp2n(q) for all n and q a prime power, and the projective orthogonal groups of positive type W+2n (q) for all n and q an even prime power. During the process, the existence of minimal logarithmic signatures (MLS's) is also proven for the linear groups: GLn (q), PGLn( q), SLn(q), the symplectic groups: Sp2n( q) for all n and q a prime power, and for the orthogonal groups of plus type O+2n (q) for all n and q an even prime power. The constructions in most of these cases provide cyclic MLS's. Using the relationship between finite groups of Lie type and groups with a split BN-pair, it is also shown that every finite group of Lie type can be expressed as a disjoint union of sets, each of which has an MLS.
机译:最小对数签名猜想指出,在任何有限的简单组中,都存在子集Ai,1≤i≤s,使得大小∣ Ai∣每个Ai的素数是素数或4,并且组中的每个元素都有一个唯一的表达式作为元素ai∈Ai的乘积i = 1sai。自1970年代后期以来[3,15,17,17,19,16],对数签名已用于构建多种密码原语。事实证明,该猜想对于各种简单的族群都是正确的,包括环族,当gcd(n,q-1)为1、4或一个素数和几个零星的族群时,A n,PSLn(q)[10,9, 12、14、18]。本文致力于证明该猜想对于一类称为经典群的李型简单群是正确的。开发的方法使用这些组的结构作为双线性或二次形式的等距组。构造的很大一部分也基于这些群的抛物线子群的Bruhat和Levi分解。在本文中,对于以下简单群族,该猜想是正确的:射影特殊线性群PSL n(q ),所有n和qa素数幂的射影辛群PSp2n(q),以及所有n和q偶素数幂的正型W + 2n(q)的射影正交群。在此过程中,还证明了以下线性组的最小对数签名(MLS):GLn(q),PGLn(q),SLn(q),辛基:Sp2n(q)对于所有n和qa素数对于所有n和q而言,对于正数为O + 2n(q)的正交组,其偶数为素数。在大多数情况下,这些结构都提供了循环MLS。利用Lie类型的有限群和具有分裂BN对的群之间的关系,还表明,Lie类型的每个有限群都可以表示为集合的不交集并集,每个集合都具有MLS。

著录项

  • 作者

    Singhi, Nidhi.;

  • 作者单位

    Florida Atlantic University.;

  • 授予单位 Florida Atlantic University.;
  • 学科 Mathematics.
  • 学位 Ph.D.
  • 年度 2011
  • 页码 65 p.
  • 总页数 65
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号