研究和改进哈希算法 md5 三角系数的计算算法

A. Horpenyuk, N. Luzhetska, M. Horpenyuk
{"title":"研究和改进哈希算法 md5 三角系数的计算算法","authors":"A. Horpenyuk, N. Luzhetska, M. Horpenyuk","doi":"10.23939/csn2024.01.026","DOIUrl":null,"url":null,"abstract":"The paper examines the problems of ensuring the authenticity of messages as well as analyzes the modern requirements for hash functions and the problems of designing algorithms for calculating hash functions. The common MD5 hashing algorithm was investigated. These days its level of security is considered insufficient for protecting high-level data confidentiality. However it is an effective and fast algorithm for hashing messages and is successfully used to protect commercial information. The paper examines the main computational transformations of the MD5 hashing algorithm. It is shown that variable constants are used in the MD5 algorithm to improve stability. A sweep of the sine function is used to calculate these variable constants. The paper examines the feasibility of using number-pulse computing structures for the calculation of variable trigonometric constants of the MD5 hashing algorithm. It is shown that the use of classical number-pulse computing structures is impractical due to the insufficient range of reproduction of the necessary trigonometric functions. Advanced wide-band digital-pulse structures provide the necessary conversion function range and accuracy. However the speed of such calculators is critically insufficient to calculate all the trigonometric coefficients of the MD5 hashing algorithm. The paper developed a mathematical and software model of the structure of the sine function expansion for the MD5 algorithm. The mathematical model is based on the relations for the sine and cosine of the sum of the arguments which are adapted for the MD5 hashing algorithm. The use of the developed differential computing structure allows saving memory when implementing the algorithm on devices with limited memory resources. Key words: cryptography message authenticity hash function.","PeriodicalId":504130,"journal":{"name":"Computer systems and network","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"RESEARCH AND IMPROVEMENT OF COMPUTING ALGORITHMS FOR CALCULATING THE TRIGONOMETRICAL COEFFICIENTS OF THE HASHING ALGORITHM MD5\",\"authors\":\"A. Horpenyuk, N. Luzhetska, M. Horpenyuk\",\"doi\":\"10.23939/csn2024.01.026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper examines the problems of ensuring the authenticity of messages as well as analyzes the modern requirements for hash functions and the problems of designing algorithms for calculating hash functions. The common MD5 hashing algorithm was investigated. These days its level of security is considered insufficient for protecting high-level data confidentiality. However it is an effective and fast algorithm for hashing messages and is successfully used to protect commercial information. The paper examines the main computational transformations of the MD5 hashing algorithm. It is shown that variable constants are used in the MD5 algorithm to improve stability. A sweep of the sine function is used to calculate these variable constants. The paper examines the feasibility of using number-pulse computing structures for the calculation of variable trigonometric constants of the MD5 hashing algorithm. It is shown that the use of classical number-pulse computing structures is impractical due to the insufficient range of reproduction of the necessary trigonometric functions. Advanced wide-band digital-pulse structures provide the necessary conversion function range and accuracy. However the speed of such calculators is critically insufficient to calculate all the trigonometric coefficients of the MD5 hashing algorithm. The paper developed a mathematical and software model of the structure of the sine function expansion for the MD5 algorithm. The mathematical model is based on the relations for the sine and cosine of the sum of the arguments which are adapted for the MD5 hashing algorithm. The use of the developed differential computing structure allows saving memory when implementing the algorithm on devices with limited memory resources. Key words: cryptography message authenticity hash function.\",\"PeriodicalId\":504130,\"journal\":{\"name\":\"Computer systems and network\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer systems and network\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23939/csn2024.01.026\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer systems and network","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23939/csn2024.01.026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文探讨了确保信息真实性的问题,并分析了散列函数的现代要求以及设计散列函数计算算法的问题。本文研究了常用的 MD5 哈希算法。如今,人们认为它的安全级别不足以保护高级数据的机密性。不过,它是一种有效、快速的信息散列算法,并成功地用于保护商业信息。本文研究了 MD5 哈希算法的主要计算转换。研究表明,MD5 算法中使用了可变常数来提高稳定性。正弦函数的扫频用于计算这些可变常数。论文研究了使用数脉冲计算结构计算 MD5 哈希算法的可变三角常数的可行性。结果表明,由于必要三角函数的再现范围不足,使用经典数字脉冲计算结构是不切实际的。先进的宽带数字脉冲结构提供了必要的转换函数范围和精度。然而,这种计算器的速度远远不足以计算 MD5 哈希算法的所有三角函数系数。本文开发了 MD5 算法正弦函数展开结构的数学和软件模型。该数学模型基于参数之和的正弦和余弦关系,适用于 MD5 哈希算法。在内存资源有限的设备上实施该算法时,使用所开发的差分计算结构可以节省内存。关键词:密码学信息真实性散列函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
RESEARCH AND IMPROVEMENT OF COMPUTING ALGORITHMS FOR CALCULATING THE TRIGONOMETRICAL COEFFICIENTS OF THE HASHING ALGORITHM MD5
The paper examines the problems of ensuring the authenticity of messages as well as analyzes the modern requirements for hash functions and the problems of designing algorithms for calculating hash functions. The common MD5 hashing algorithm was investigated. These days its level of security is considered insufficient for protecting high-level data confidentiality. However it is an effective and fast algorithm for hashing messages and is successfully used to protect commercial information. The paper examines the main computational transformations of the MD5 hashing algorithm. It is shown that variable constants are used in the MD5 algorithm to improve stability. A sweep of the sine function is used to calculate these variable constants. The paper examines the feasibility of using number-pulse computing structures for the calculation of variable trigonometric constants of the MD5 hashing algorithm. It is shown that the use of classical number-pulse computing structures is impractical due to the insufficient range of reproduction of the necessary trigonometric functions. Advanced wide-band digital-pulse structures provide the necessary conversion function range and accuracy. However the speed of such calculators is critically insufficient to calculate all the trigonometric coefficients of the MD5 hashing algorithm. The paper developed a mathematical and software model of the structure of the sine function expansion for the MD5 algorithm. The mathematical model is based on the relations for the sine and cosine of the sum of the arguments which are adapted for the MD5 hashing algorithm. The use of the developed differential computing structure allows saving memory when implementing the algorithm on devices with limited memory resources. Key words: cryptography message authenticity hash function.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信