一类基于代数橡皮擦的哈希函数

IF 0.1 Q4 MATHEMATICS Groups Complexity Cryptology Pub Date : 2016-01-01 DOI:10.1515/gcc-2016-0004
Iris Anshel, Derek Atkins, D. Goldfeld, P. Gunnells
{"title":"一类基于代数橡皮擦的哈希函数","authors":"Iris Anshel, Derek Atkins, D. Goldfeld, P. Gunnells","doi":"10.1515/gcc-2016-0004","DOIUrl":null,"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.1000,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"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\":null,\"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.1000,\"publicationDate\":\"2016-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complexity Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2016-0004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complexity Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2016-0004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 9

摘要

摘要本文介绍了一种适合于低资源环境下使用的基于辫状结构的候选密码散列函数。结果表明,新的哈希函数在一系列加密测试套件上执行得非常好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A class of hash functions based on the algebraic eraser™
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.10
自引率
0.00%
发文量
0
期刊最新文献
Amenability problem for Thompson's group $F$: state of the art Bounding conjugacy depth functions for wreath products of finitely generated abelian groups An axiomatization for the universal theory of the Heisenberg group Geodesic Growth of Numbered Graph Products The Axiomatics of Free Group Rings
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1