Numeric Identifier Transmission Algorithm Using Hash Function

Vladyslav Kutsman
{"title":"Numeric Identifier Transmission Algorithm Using Hash Function","authors":"Vladyslav Kutsman","doi":"10.4236/ojapps.2023.139125","DOIUrl":null,"url":null,"abstract":"When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a matter of milliseconds. A relational database consists of tables and records in these tables, each table must have a primary key, in particular, it can be a number of BIGINT type, which is a unique index of a record in the table, which allows to fetch operation with maximum speed and O (1) complexity. After the operation of writing a row to the table of database, the program receives the row identifier ID in the form of a number, and in the future this ID can be used to obtain this record. In the case of a website, this could be the GET method of the http protocol with the entry ID in the request. But very often it happens that the transmission of an identifier in the clear form is not safe, both for business reasons and for security reasons of access to information. And in this case, it is necessary to create additional functionality for checking access rights and come up with a way to encode data in such a way that it would be impossible to determine the record identifier, and this, in turn, leads to the fact that the program code becomes much more complicated and also increases the amount of data, necessary to ensure the operation of the program. This article presents an algorithm that solves these problems “on the fly” without complicating the application logic and does not require resources to store additional information. Also, this algorithm is very reliable since it is based on the use of hash functions and synthesized as a result of many years of work related to writing complex systems that require an increased level of data security and program performance.","PeriodicalId":19671,"journal":{"name":"Open Journal of Applied Sciences","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Open Journal of Applied Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4236/ojapps.2023.139125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a matter of milliseconds. A relational database consists of tables and records in these tables, each table must have a primary key, in particular, it can be a number of BIGINT type, which is a unique index of a record in the table, which allows to fetch operation with maximum speed and O (1) complexity. After the operation of writing a row to the table of database, the program receives the row identifier ID in the form of a number, and in the future this ID can be used to obtain this record. In the case of a website, this could be the GET method of the http protocol with the entry ID in the request. But very often it happens that the transmission of an identifier in the clear form is not safe, both for business reasons and for security reasons of access to information. And in this case, it is necessary to create additional functionality for checking access rights and come up with a way to encode data in such a way that it would be impossible to determine the record identifier, and this, in turn, leads to the fact that the program code becomes much more complicated and also increases the amount of data, necessary to ensure the operation of the program. This article presents an algorithm that solves these problems “on the fly” without complicating the application logic and does not require resources to store additional information. Also, this algorithm is very reliable since it is based on the use of hash functions and synthesized as a result of many years of work related to writing complex systems that require an increased level of data security and program performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用哈希函数的数字标识符传输算法
在开发程序或网站时,使用关系数据库非常方便,它包含强大而方便的工具,可以非常灵活地处理数据,并在几毫秒内获得必要的信息。一个关系数据库由表和这些表中的记录组成,每个表必须有一个主键,特别是,它可以是多个BIGINT类型,这是表中记录的唯一索引,这允许以最快的速度和O(1)的复杂度获取操作。在将一行写入数据库表的操作完成后,程序接收到一个数字形式的行标识ID,以后可以使用这个ID来获取这条记录。在网站的情况下,这可能是http协议的GET方法,请求中包含条目ID。但是,出于业务原因和访问信息的安全原因,以明文形式传输标识符往往是不安全的。在这种情况下,有必要创建额外的功能来检查访问权限,并提出一种方法来编码数据,使其无法确定记录标识符,这反过来又导致程序代码变得更加复杂,也增加了数据量,这是确保程序运行所必需的。本文提供了一种“动态”解决这些问题的算法,不需要使应用程序逻辑复杂化,也不需要资源来存储额外的信息。此外,该算法非常可靠,因为它基于散列函数的使用,并且是多年编写复杂系统的工作的结果,这些系统需要更高级别的数据安全性和程序性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A 5MS/s 12-Bit Successive Approximation Analog-to-Digital Converter Determination of the Electrical Parameters of a Solar Cell in Steady State Thermal Characteristics of Earth Blocks Stabilized by Rice Husks Digital Transformation of Medical Maintenance at PSAFHM A Review of the Application of Process Evaluation in Junior High School English Teaching under “Double Reduction”
×
引用
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