{"title":"QHF: A quaternion based a Multidimensional Hash function","authors":"R. Koide, T. Nagase, T. Araki","doi":"10.1109/ISPACS.2007.4446016","DOIUrl":null,"url":null,"abstract":"This paper proposes a new method for constructing a multidimensional hash function based on quaternion presentation called QUATERNION hash function QHF. The input data is divided into a sequence of blocks and each block is split into four parts which are mathematically formed as quaternion's parameters. A series of data and quaternion multiplication's processing are implemented to compose a hash function kernel. Each step of data-quaternion processing is carefully scrutinized data's block to maneuver a succession of zeros which might case a possible attack. Computer based simulation is conducted to compute hash values from input quaternion data. Quaternion has non-commutative feature among its multiplication's parameters, therefore, QHF is capable to resist hash collision. Furthermore, numerical examples are given to comprehend the proposed QHF.data- quaternion processing","PeriodicalId":220276,"journal":{"name":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","volume":"175 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Intelligent Signal Processing and Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPACS.2007.4446016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper proposes a new method for constructing a multidimensional hash function based on quaternion presentation called QUATERNION hash function QHF. The input data is divided into a sequence of blocks and each block is split into four parts which are mathematically formed as quaternion's parameters. A series of data and quaternion multiplication's processing are implemented to compose a hash function kernel. Each step of data-quaternion processing is carefully scrutinized data's block to maneuver a succession of zeros which might case a possible attack. Computer based simulation is conducted to compute hash values from input quaternion data. Quaternion has non-commutative feature among its multiplication's parameters, therefore, QHF is capable to resist hash collision. Furthermore, numerical examples are given to comprehend the proposed QHF.data- quaternion processing