Groups Complexity Cryptology最新文献

筛选
英文 中文
More secure version of a Cayley hash function 更安全的凯利哈希函数版本
Groups Complexity Cryptology Pub Date : 2018-04-13 DOI: 10.1515/gcc-2018-0002
Mohammad Hossein Ghaffari, Z. Mostaghim
{"title":"More secure version of a Cayley hash function","authors":"Mohammad Hossein Ghaffari, Z. Mostaghim","doi":"10.1515/gcc-2018-0002","DOIUrl":"https://doi.org/10.1515/gcc-2018-0002","url":null,"abstract":"Abstract In this paper, we propose a more secure version of a Cayley hash function which is based on the linear functions. It is a practical parallelizable hash function.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"20 1","pages":"29 - 32"},"PeriodicalIF":0.0,"publicationDate":"2018-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83679346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
The word problem of ℤ n is a multiple context-free language n的词问题是一种多上下文无关的语言
Groups Complexity Cryptology Pub Date : 2018-04-11 DOI: 10.1515/gcc-2018-0003
M. Ho
{"title":"The word problem of ℤ n is a multiple context-free language","authors":"M. Ho","doi":"10.1515/gcc-2018-0003","DOIUrl":"https://doi.org/10.1515/gcc-2018-0003","url":null,"abstract":"Abstract The word problem of a group G = 〈 Σ 〉 {G=langleSigmarangle} can be defined as the set of formal words in Σ * {Sigma^{*}} that represent the identity in G. When viewed as formal languages, this gives a strong connection between classes of groups and classes of formal languages. For example, Anīsīmov showed that a group is finite if and only if its word problem is a regular language, and Muller and Schupp showed that a group is virtually-free if and only if its word problem is a context-free language. Recently, Salvati showed that the word problem of ℤ 2 {mathbb{Z}^{2}} is a multiple context-free language, giving the first example of a natural word problem that is multiple context-free, but not context-free. We generalize Salvati’s result to show that the word problem of ℤ n {mathbb{Z}^{n}} is a multiple context-free language for any n.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"108 1","pages":"15 - 9"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73057601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Some applications of arithmetic groups in cryptography 算术群在密码学中的一些应用
Groups Complexity Cryptology Pub Date : 2018-03-30 DOI: 10.1515/gcc-2019-2002
Delaram Kahrobaei, Keivan Mallahi-Karai
{"title":"Some applications of arithmetic groups in cryptography","authors":"Delaram Kahrobaei, Keivan Mallahi-Karai","doi":"10.1515/gcc-2019-2002","DOIUrl":"https://doi.org/10.1515/gcc-2019-2002","url":null,"abstract":"Abstract In this paper, we will offer a new symmetric-key cryptographic scheme which is based on the existence of exponentially distorted subgroups in arithmetic groups. Aside from this, we will also provide new examples of distorted subgroups in SL n ⁢ ( ℤ ⁢ [ x ] ) {mathrm{SL}_{n}(mathbb{Z}[x])} which can be utilized for the same purpose.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"15 1","pages":"25 - 33"},"PeriodicalIF":0.0,"publicationDate":"2018-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73268158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On Types of Elliptic Pseudoprimes 关于椭圆型伪素数的类型
Groups Complexity Cryptology Pub Date : 2017-10-15 DOI: 10.46298/jgcc.2021.13.1.6521
L. Babinkostova, A. Hern'andez-Espiet, H. Kim
{"title":"On Types of Elliptic Pseudoprimes","authors":"L. Babinkostova, A. Hern'andez-Espiet, H. Kim","doi":"10.46298/jgcc.2021.13.1.6521","DOIUrl":"https://doi.org/10.46298/jgcc.2021.13.1.6521","url":null,"abstract":"We generalize the notions of elliptic pseudoprimes and elliptic Carmichael\u0000numbers introduced by Silverman to analogues of Euler-Jacobi and strong\u0000pseudoprimes. We investigate the relationships among Euler Elliptic Carmichael\u0000numbers , strong elliptic Carmichael numbers, products of anomalous primes and\u0000elliptic Korselt numbers of Type I: The former two of these are introduced in\u0000this paper, and the latter two of these were introduced by Mazur (1973) and\u0000Silverman (2012) respectively. In particular, we expand upon a previous work of\u0000Babinkostova et al. by proving a conjecture about the density of certain\u0000elliptic Korselt numbers of Type I that are products of anomalous primes.\u0000Comment: Revised for publication. 33 pages","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75202344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Closure properties in the class of multiple context-free groups 多个上下文无关组的类中的闭包属性
Groups Complexity Cryptology Pub Date : 2017-09-07 DOI: 10.1515/gcc-2019-2004
Robert P. Kropholler, Davide Spriano
{"title":"Closure properties in the class of multiple context-free groups","authors":"Robert P. Kropholler, Davide Spriano","doi":"10.1515/gcc-2019-2004","DOIUrl":"https://doi.org/10.1515/gcc-2019-2004","url":null,"abstract":"Abstract We show that the class of groups with k-multiple context-free word problem is closed under graphs of groups with finite edge groups.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"30 1","pages":"1 - 15"},"PeriodicalIF":0.0,"publicationDate":"2017-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73672381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Cryptography from the tropical Hessian pencil 密码学来自热带黑森铅笔
Groups Complexity Cryptology Pub Date : 2017-05-01 DOI: 10.1515/gcc-2017-0002
J. Chauvet, É. Mahé
{"title":"Cryptography from the tropical Hessian pencil","authors":"J. Chauvet, É. Mahé","doi":"10.1515/gcc-2017-0002","DOIUrl":"https://doi.org/10.1515/gcc-2017-0002","url":null,"abstract":"Abstract Recent work by Grigoriev and Shpilrain [8] suggests looking at the tropical semiring for cryptographic schemes. In this contribution we explore the tropical analogue of the Hessian pencil of plane cubic curves as a source of group-based cryptography. Using elementary tropical geometry on the tropical Hessian curves, we derive the addition and doubling formulas induced from their Jacobian and investigate the discrete logarithm problem in this group. We show that the DLP is solvable when restricted to integral points on the tropical Hesse curve, and hence inadequate for cryptographic applications. Consideration of point duplication, however, provides instances of solvable chaotic maps producing random sequences and thus a source of fast keyed hash functions.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"1 1","pages":"19 - 29"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83634808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Certifying numerical estimates of spectral gaps 验证谱隙的数值估计
Groups Complexity Cryptology Pub Date : 2017-03-28 DOI: 10.1515/gcc-2018-0004
M. Kaluba, P. Nowak
{"title":"Certifying numerical estimates of spectral gaps","authors":"M. Kaluba, P. Nowak","doi":"10.1515/gcc-2018-0004","DOIUrl":"https://doi.org/10.1515/gcc-2018-0004","url":null,"abstract":"Abstract We establish a lower bound on the spectral gap of the Laplace operator on special linear groups using conic optimisation. In particular, this provides a constructive (but computer assisted) proof that these groups have the Kazhdan property (T). Software for such optimisation for other finitely presented groups is provided.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"18 1","pages":"33 - 41"},"PeriodicalIF":0.0,"publicationDate":"2017-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83321213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Free by cyclic groups and linear groups with restricted unipotent elements 由循环群和有限制单幂元的线性群解放
Groups Complexity Cryptology Pub Date : 2017-01-24 DOI: 10.1515/gcc-2017-0009
J. Button
{"title":"Free by cyclic groups and linear groups with restricted unipotent elements","authors":"J. Button","doi":"10.1515/gcc-2017-0009","DOIUrl":"https://doi.org/10.1515/gcc-2017-0009","url":null,"abstract":"Abstract We introduce the class of linear groups that do not contain unipotent elements of infinite order, which includes all linear groups in positive characteristic. We show that groups in this class have good closure properties, in addition to having properties akin to non-positive curvature, which were proved in [6]. We give examples of abstract groups lying in this class, but also show that Gersten’s free by cyclic group does not. This implies that it has no faithful linear representation of any dimension over any field of positive characteristic, nor can it be embedded in any complex unitary group.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"1 1","pages":"137 - 149"},"PeriodicalIF":0.0,"publicationDate":"2017-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76712813","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
An elementary proof of the group law for elliptic curves 椭圆曲线群律的初等证明
Groups Complexity Cryptology Pub Date : 2017-01-24 DOI: 10.1515/gcc-2017-0010
Stefan Friedl
{"title":"An elementary proof of the group law for elliptic curves","authors":"Stefan Friedl","doi":"10.1515/gcc-2017-0010","DOIUrl":"https://doi.org/10.1515/gcc-2017-0010","url":null,"abstract":"Abstract We give an elementary proof of the group law for elliptic curves using explicit formulas.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"8 1","pages":"117 - 123"},"PeriodicalIF":0.0,"publicationDate":"2017-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89539567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Direct products, varieties, and compactness conditions 直接产品、品种、密实条件
Groups Complexity Cryptology Pub Date : 2017-01-17 DOI: 10.1515/gcc-2017-0011
M. Shahryari, A. Shevlyakov
{"title":"Direct products, varieties, and compactness conditions","authors":"M. Shahryari, A. Shevlyakov","doi":"10.1515/gcc-2017-0011","DOIUrl":"https://doi.org/10.1515/gcc-2017-0011","url":null,"abstract":"Abstract We study equationally Noetherian and 𝐪 ω {{mathbf{q}_{omega}}} -compact varieties of groups, rings and monoids. Moreover, we describe equationally Noetherian direct powers for these algebraic structures.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"6 1","pages":"159 - 166"},"PeriodicalIF":0.0,"publicationDate":"2017-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91341413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信