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 ma...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.展开更多
针对能耗等资源受限环境对密码算法的需求,基于Sponge迭代结构,采用基于新加密结构(命名为MS结构)的CLEFIA-128*(轻量级分组密码国际标准的修订算法)作为压缩函数,设计了一个轻量级Hash函数CHF。效率测试和分析表明CHF算法的软件效率高...针对能耗等资源受限环境对密码算法的需求,基于Sponge迭代结构,采用基于新加密结构(命名为MS结构)的CLEFIA-128*(轻量级分组密码国际标准的修订算法)作为压缩函数,设计了一个轻量级Hash函数CHF。效率测试和分析表明CHF算法的软件效率高于常见轻量级Hash函数,并兼顾了硬件效率,既能满足射频识别(Radio frequency identification,RFID)等资源极端受限环境对硬件的使用需求,也可以满足其他一些诸如嵌入式系统和单片机等环境对软件实现的需求,适用范围更广。依赖性测试和安全分析表明,该算法能够满足轻量级Hash函数的安全需求,也从侧面论证了MS结构的安全性。展开更多
文摘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.
文摘针对能耗等资源受限环境对密码算法的需求,基于Sponge迭代结构,采用基于新加密结构(命名为MS结构)的CLEFIA-128*(轻量级分组密码国际标准的修订算法)作为压缩函数,设计了一个轻量级Hash函数CHF。效率测试和分析表明CHF算法的软件效率高于常见轻量级Hash函数,并兼顾了硬件效率,既能满足射频识别(Radio frequency identification,RFID)等资源极端受限环境对硬件的使用需求,也可以满足其他一些诸如嵌入式系统和单片机等环境对软件实现的需求,适用范围更广。依赖性测试和安全分析表明,该算法能够满足轻量级Hash函数的安全需求,也从侧面论证了MS结构的安全性。
