Groups Complexity Cryptology最新文献

筛选
英文 中文
A class of hash functions based on the algebraic eraser™ 一类基于代数橡皮擦的哈希函数
Groups Complexity Cryptology Pub Date : 2016-01-01 DOI: 10.1515/gcc-2016-0004
Iris Anshel, Derek Atkins, D. Goldfeld, P. Gunnells
{"title":"A class of hash functions based on the algebraic eraser™","authors":"Iris Anshel, Derek Atkins, D. Goldfeld, P. Gunnells","doi":"10.1515/gcc-2016-0004","DOIUrl":"https://doi.org/10.1515/gcc-2016-0004","url":null,"abstract":"Abstract This paper introduces a novel braid based cryptographic hash function candidate which is suitable for use in low resource environments. It is shown that the new hash function performed extremely well on a range of cryptographic test suites.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"33 1","pages":"1 - 7"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83643975","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}
引用次数: 9
A nonlinear decomposition attack 非线性分解攻击
Groups Complexity Cryptology Pub Date : 2016-01-01 DOI: 10.1515/gcc-2016-0017
V. Roman’kov
{"title":"A nonlinear decomposition attack","authors":"V. Roman’kov","doi":"10.1515/gcc-2016-0017","DOIUrl":"https://doi.org/10.1515/gcc-2016-0017","url":null,"abstract":"Abstract This paper introduces a new type of attack, termed a nonlinear decomposition attack, against two known group-based key agreement protocols, namely, protocol based on extensions of (semi)groups by endomorphisms introduced by Kahrobaei, Shpilrain et al., and the noncommutative Diffie–Hellman protocol introduced by Ko, Lee et al. This attack works efficiently in the case when finitely generated nilpotent (more generally, polycyclic) groups are used as platforms. This attack is based on a deterministic algorithm that finds the secret shared key from the public data in both the protocols under consideration. Furthermore, we show that in this case one can break the schemes without solving the algorithmic problems on which the assumptions are based. The efficacy of the attack depends on the platform group, so it requires a more thorough analysis in each particular case.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"34 1","pages":"197 - 207"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79876598","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}
引用次数: 31
Key agreement under tropical parallels 热带地区的关键协议
Groups Complexity Cryptology Pub Date : 2015-11-01 DOI: 10.1515/gcc-2015-0013
J. Chauvet, É. Mahé
{"title":"Key agreement under tropical parallels","authors":"J. Chauvet, É. Mahé","doi":"10.1515/gcc-2015-0013","DOIUrl":"https://doi.org/10.1515/gcc-2015-0013","url":null,"abstract":"Abstract A semiring is an algebraic structure satisfying the usual axioms for a not necessarily commutative ring, but without the requirement that addition be invertible. Aside from rings, well-studied instances in cryptographic applications include the Boolean semiring and the tropical semiring. The latter, in particular, behaves to a large extent like a field and exhibits interesting properties in the cryptographic context. This short note explores a GPU-based highly parallel implementation of a protocol recently proposed by Grigoriev and Shpilrain [Comm. Algebra 42 (2014), 2624–2632], in the context of Diffie–Hellman key agreements.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"20 1","pages":"195 - 198"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87915976","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
Public-key cryptosystem based on invariants of diagonalizable groups 基于可对角群不变量的公钥密码系统
Groups Complexity Cryptology Pub Date : 2015-07-28 DOI: 10.1515/gcc-2017-0003
M. Jurás, F. Marko, A. Zubkov
{"title":"Public-key cryptosystem based on invariants of diagonalizable groups","authors":"M. Jurás, F. Marko, A. Zubkov","doi":"10.1515/gcc-2017-0003","DOIUrl":"https://doi.org/10.1515/gcc-2017-0003","url":null,"abstract":"Abstract We develop a public-key cryptosystem based on invariants of diagonalizable groups and investigate properties of such a cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on the Euclidean algorithm).","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"151 1","pages":"31 - 54"},"PeriodicalIF":0.0,"publicationDate":"2015-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88872899","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
Hydra group doubles are not residually finite 九头蛇群双精度不是剩余有限的
Groups Complexity Cryptology Pub Date : 2015-07-09 DOI: 10.1515/gcc-2016-0015
K. Pueschel
{"title":"Hydra group doubles are not residually finite","authors":"K. Pueschel","doi":"10.1515/gcc-2016-0015","DOIUrl":"https://doi.org/10.1515/gcc-2016-0015","url":null,"abstract":"Abstract In 2013, Kharlampovich, Myasnikov, and Sapir constructed the first examples of finitely presented residually finite groups with large Dehn functions. Given any recursive function f, they produce a finitely presented residually finite group with Dehn function dominating f. There are no known elementary examples of finitely presented residually finite groups with super-exponential Dehn function. Dison and Riley’s hydra groups can be used to construct a sequence of groups for which the Dehn function of the kth group is equivalent to the kth Ackermann function. Kharlampovich, Myasnikov, and Sapir asked whether or not these groups are residually finite. We show that these constructions do not produce residually finite groups.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"87 1","pages":"163 - 170"},"PeriodicalIF":0.0,"publicationDate":"2015-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86728200","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
An application of elementary real analysis to a metabelian group admitting integral polynomial exponents 初等实数分析在含整多项式指数的亚元群中的应用
Groups Complexity Cryptology Pub Date : 2015-05-01 DOI: 10.1515/gcc-2015-0004
A. Gaglione, S. Lipschutz, D. Spellman
{"title":"An application of elementary real analysis to a metabelian group admitting integral polynomial exponents","authors":"A. Gaglione, S. Lipschutz, D. Spellman","doi":"10.1515/gcc-2015-0004","DOIUrl":"https://doi.org/10.1515/gcc-2015-0004","url":null,"abstract":"Abstract Let G be a free metabelian group of rank r = 2. We introduce a faithful 2×2 real matrix representation of G and extend this to a group G ℤ[θ] $G^{mathbb {Z}[theta ]}$ of 2×2 matrices admitting exponents from the integral polynomial ring ℤ[θ]$mathbb {Z}[theta ]$ . Identifying G with its matrix representation, we show that given γ(θ)∈G ℤ[θ] $gamma (theta )in G^{mathbb {Z}[theta ]}$ and n∈ℤ$nin mathbb {Z}$ , one has that lim θ→n γ(θ)$lim _{theta rightarrow n}gamma (theta )$ exists and lies in G. Furthermore, the maps γ(θ)↦lim θ→n γ(θ)$gamma (theta )mapsto lim _{theta rightarrow n}gamma (theta )$ form a discriminating family of group retractions G ℤ[θ] →G$G^{mathbb {Z}[theta ]}rightarrow G$ as n varies over ℤ. Although not explicitly carried out in this manuscript, it is clear that similar results hold for any countable rank r.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"13 1","pages":"59 - 68"},"PeriodicalIF":0.0,"publicationDate":"2015-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84531997","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}
引用次数: 0
On convex hulls and the quasiconvex subgroups of Fm×ℤn 关于fmx的凸包和拟凸子群
Groups Complexity Cryptology Pub Date : 2015-05-01 DOI: 10.1515/gcc-2015-0006
Jordan Sahattchieve
{"title":"On convex hulls and the quasiconvex subgroups of Fm×ℤn","authors":"Jordan Sahattchieve","doi":"10.1515/gcc-2015-0006","DOIUrl":"https://doi.org/10.1515/gcc-2015-0006","url":null,"abstract":"Abstract In this paper, we explore a method for forming the convex hull of a subset in a uniquely geodesic metric space due to Brunn and use it to show that with respect to the usual action of Fm×ℤn on Tree ×ℝ n ${mathrm {Tree}times mathbb {R}^n}$ , every quasiconvex subgroup of Fm×ℤn is convex. Further, we show that the Cartan–Hadamard theorem can be used to show that locally convex subsets of complete and connected CAT(0) spaces are convex. Finally, we show that the quasiconvex subgroups of Fm×ℤn are precisely those of the form A×B, where A≤F m ${Ale F_m}$ is finitely generated, and B≤ℤ n ${Ble mathbb {Z}^n}$ .","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"17 1","pages":"69 - 80"},"PeriodicalIF":0.0,"publicationDate":"2015-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82313848","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
Symmetries of finite graphs and homology 有限图的对称性与同调
Groups Complexity Cryptology Pub Date : 2015-05-01 DOI: 10.1515/gcc-2015-0003
Benjamin Atchison, E. Turner
{"title":"Symmetries of finite graphs and homology","authors":"Benjamin Atchison, E. Turner","doi":"10.1515/gcc-2015-0003","DOIUrl":"https://doi.org/10.1515/gcc-2015-0003","url":null,"abstract":"Abstract A finite symmetric graph Γ is a pair (Γ,f)$(Gamma ,f)$ , where Γ is a finite graph and f:Γ→Γ$f:Gamma rightarrow Gamma $ is a graph self equivalence or automorphism. We develop several tools for studying such symmetries. In particular, we describe in detail all symmetries with a single edge orbit, we prove that each symmetric graph has a maximal forest that meets each edge orbit in a sequential set of edges – a sequential maximal forest – and we calculate the characteristic polynomial χ f (t)$chi _f(t)$ and the minimal polynomial μ f (t)$mu _f(t)$ of the linear map H 1 (f):H 1 (Γ,ℤ)→H 1 (Γ,ℤ)$H_1(f):H_1(Gamma ,mathbb {Z})rightarrow H_1(Gamma ,mathbb {Z})$ . The calculation is in terms of the quotient graph Γ ¯$overline{Gamma }$ .","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"102 1","pages":"11 - 30"},"PeriodicalIF":0.0,"publicationDate":"2015-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78174503","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}
引用次数: 0
Algorithmic recognition of quasipositive 4-braids of algebraic length three 代数长度为3的拟正4辫的算法识别
Groups Complexity Cryptology Pub Date : 2015-04-24 DOI: 10.1515/gcc-2015-0012
S. Orevkov
{"title":"Algorithmic recognition of quasipositive 4-braids of algebraic length three","authors":"S. Orevkov","doi":"10.1515/gcc-2015-0012","DOIUrl":"https://doi.org/10.1515/gcc-2015-0012","url":null,"abstract":"Abstract We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We give also a polynomial algorithm to decide if a given braid with any number of strings is a product of two factors which are conjugates of given powers of the standard generators (in my previous paper this problem was solved without polynomial estimates).","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"26 1","pages":"157 - 173"},"PeriodicalIF":0.0,"publicationDate":"2015-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89752754","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
Thompson's group F is 1-counter graph automatic 汤普森的F组是1计数器自动图
Groups Complexity Cryptology Pub Date : 2015-01-18 DOI: 10.1515/gcc-2016-0001
M. Elder, J. Taback
{"title":"Thompson's group F is 1-counter graph automatic","authors":"M. Elder, J. Taback","doi":"10.1515/gcc-2016-0001","DOIUrl":"https://doi.org/10.1515/gcc-2016-0001","url":null,"abstract":"Abstract It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to 𝒞-graph automatic by the authors, a compelling question is whether F is graph automatic or 𝒞-graph automatic for an appropriate language class 𝒞. The extended definitions allow the use of a symbol alphabet for the normal form language, replacing the dependence on generating set. In this paper we construct a 1-counter graph automatic structure for F based on the standard infinite normal form for group elements.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"113 1","pages":"21 - 33"},"PeriodicalIF":0.0,"publicationDate":"2015-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73940623","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}
引用次数: 7
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学术官方微信