Cryptography is an important technology for information security. It mainly includes symmetric and asymmetric cryptographic algorithms and protocols. For the symmetric cryptographic algorithms, it is easy to deduce de...Cryptography is an important technology for information security. It mainly includes symmetric and asymmetric cryptographic algorithms and protocols. For the symmetric cryptographic algorithms, it is easy to deduce decryption keys from the encryption keys and vice versa. Because this algorithm encrypts and decrypts data very quickly, it is applicable in situations where large numbers of data have to be protected. However, for the asymmetric algorithm, extracting the secret key from the public key is computationally infeasible. Although the performance speed of the asymmetric algorithm is much slower than that of the symmetric algorithm, the asymmetric algorithm has key distribution and management advantages over the symmetric one. Moreover, it is a perfect digital signature scheme.展开更多
In this paper, we survey a number of studies in the literature on improving lightweight systems in the Internet of Things (IoT). The paper illustrates recent development of Boolean cryptographic function Application a...In this paper, we survey a number of studies in the literature on improving lightweight systems in the Internet of Things (IoT). The paper illustrates recent development of Boolean cryptographic function Application and how it assists in using hardware such as the internet of things. For a long time there seems to be little progress in applying pure mathematics in providing security since the wide progress made by George Boole and Shannon. We discuss cryptanalysis of Boolean functions to avoid trapdoors and vulnerabilities in the development of block ciphers. It appears that there is significant progress. A comparative analysis of lightweight cryptographic schemes is reported in terms of execution time, code size and throughput. Depending on the schemes and the structure of the algorithms, these parameters change but remain within reasonable values making them suited for Internet of things applications. The driving force of lightweight cryptography (LWC) stems mainly from its direct applications in the real world since it provides solutions to actual problems faced by designers of IoT systems. Broadly speaking, lightweight cryptographic algorithms are designed to achieve two main goals. The first goal of a cryptographic algorithm is to withstand all known cryptanalytic attacks and thus to be secure in the black-box model. The second goal is to build the cryptographic primitive in such a way that its implementations satisfy a clearly specified set of constraints that depend on a case-by-case basis.展开更多
The concept of group construction vector and independent construction vector for visual cryptography is proposed, and the method based on construction vector is presented for con-structing basis matrices. The general ...The concept of group construction vector and independent construction vector for visual cryptography is proposed, and the method based on construction vector is presented for con-structing basis matrices. The general solutions to construction vectors and the general solutions to k out of n visual cryptographic schemes are obtained. Using the construction vectors, everyone can construct visual cryptographic schemes simply and efficaciously according to the formulas. The concept and the general solutions to construction vector present a good idea for researches on visual cryptographic schemes, including structural properties, the bound of pixel expansion and contrast, and optimal construction.展开更多
基金This work is funded by the National BasicResearch Program of China (973 Program) underGrant 2007CB311203.
文摘Cryptography is an important technology for information security. It mainly includes symmetric and asymmetric cryptographic algorithms and protocols. For the symmetric cryptographic algorithms, it is easy to deduce decryption keys from the encryption keys and vice versa. Because this algorithm encrypts and decrypts data very quickly, it is applicable in situations where large numbers of data have to be protected. However, for the asymmetric algorithm, extracting the secret key from the public key is computationally infeasible. Although the performance speed of the asymmetric algorithm is much slower than that of the symmetric algorithm, the asymmetric algorithm has key distribution and management advantages over the symmetric one. Moreover, it is a perfect digital signature scheme.
文摘In this paper, we survey a number of studies in the literature on improving lightweight systems in the Internet of Things (IoT). The paper illustrates recent development of Boolean cryptographic function Application and how it assists in using hardware such as the internet of things. For a long time there seems to be little progress in applying pure mathematics in providing security since the wide progress made by George Boole and Shannon. We discuss cryptanalysis of Boolean functions to avoid trapdoors and vulnerabilities in the development of block ciphers. It appears that there is significant progress. A comparative analysis of lightweight cryptographic schemes is reported in terms of execution time, code size and throughput. Depending on the schemes and the structure of the algorithms, these parameters change but remain within reasonable values making them suited for Internet of things applications. The driving force of lightweight cryptography (LWC) stems mainly from its direct applications in the real world since it provides solutions to actual problems faced by designers of IoT systems. Broadly speaking, lightweight cryptographic algorithms are designed to achieve two main goals. The first goal of a cryptographic algorithm is to withstand all known cryptanalytic attacks and thus to be secure in the black-box model. The second goal is to build the cryptographic primitive in such a way that its implementations satisfy a clearly specified set of constraints that depend on a case-by-case basis.
文摘The concept of group construction vector and independent construction vector for visual cryptography is proposed, and the method based on construction vector is presented for con-structing basis matrices. The general solutions to construction vectors and the general solutions to k out of n visual cryptographic schemes are obtained. Using the construction vectors, everyone can construct visual cryptographic schemes simply and efficaciously according to the formulas. The concept and the general solutions to construction vector present a good idea for researches on visual cryptographic schemes, including structural properties, the bound of pixel expansion and contrast, and optimal construction.
