{"title":"更安全的凯利哈希函数版本","authors":"Mohammad Hossein Ghaffari, Z. Mostaghim","doi":"10.1515/gcc-2018-0002","DOIUrl":null,"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.1000,"publicationDate":"2018-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"More secure version of a Cayley hash function\",\"authors\":\"Mohammad Hossein Ghaffari, Z. Mostaghim\",\"doi\":\"10.1515/gcc-2018-0002\",\"DOIUrl\":null,\"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.1000,\"publicationDate\":\"2018-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complexity Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2018-0002\",\"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-2018-0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
