As the wireless sensor networks are easily deployable, the volume of sensor applications has been increased widely in various fields of military and commercial areas. In order to attain security on the data exchanged ...As the wireless sensor networks are easily deployable, the volume of sensor applications has been increased widely in various fields of military and commercial areas. In order to attain security on the data exchanged over the network, a hybrid cryptographic mechanism which includes both symmetric and asymmetric cryptographic functions is used. The public key cryptographic ECC security implementation in this paper performs a matrix mapping of data’s at the points on the elliptical curve, which are further encoded using the private symmetric cipher cryptographic algorithm. This security enhancement with the hybrid mechanism of ECC and symmetric cipher cryptographic scheme achieves efficiency in energy conservation of about 7% and 4% compared to the asymmetric and symmetric cipher security implementations in WSN.展开更多
We propose a framework for designing randomized stream ciphers with enhanced security. The key attribute of this framework is using of nonlinear bijective mappings or keyless hash functions for random coding. We inves...We propose a framework for designing randomized stream ciphers with enhanced security. The key attribute of this framework is using of nonlinear bijective mappings or keyless hash functions for random coding. We investigate the computational security of the proposed ciphers against chosen-plaintext-chosen-initialization-vector attacks and show that it is based on the hardness of solving some systems of random nonlinear Boolean equations. We also provide guidelines for choosing components to design randomizers for specified ciphers.展开更多
Supermarkets and large-scale retail stores are usually subject to huge monetary transactions for certain customers’ purchases. The computerization of these systems is common in supermarkets but the security of these ...Supermarkets and large-scale retail stores are usually subject to huge monetary transactions for certain customers’ purchases. The computerization of these systems is common in supermarkets but the security of these transactions remains a mystery. This article presents an algorithm as an API based on symmetric cryptography that can enable end-to-end encryption of a monetary transaction in a supermarket. This algorithm is the first part of the complete supermarket management system which will be presented in the following article. The Python language and the Flask framework allow us to develop the algorithm as an independent component. Tests have been performed and our algorithm uses 98.49% less memory and 10.18% time saving than the AES algorithm.展开更多
In cipher algorithms,the encryption and decryption are based on the same key.There are some limitations in cipher algorithms,for example in polyalphabetic substitution cipher the key size must be equal to plaintext ot...In cipher algorithms,the encryption and decryption are based on the same key.There are some limitations in cipher algorithms,for example in polyalphabetic substitution cipher the key size must be equal to plaintext otherwise it will be repeated and if the key is known then encryption becomes useless.This paper aims to improve the said limitations by designing of Triple key security algorithm(TKS)in which the key is modified on polyalphabetic substitution cipher to maintain the size of the key and plaintext.Each plaintext character is substituted by an alternative message.The mode of substitution is transformed cyclically which depends on the current position of the modified communication.Three keys are used in the encryption and decryption process on 8 or 16 rounds with the Exclusively-OR(XOR)of the 1st key.This study also identifies a single-key attack on multiple rounds block cipher in mobile communications and applied the proposed technique to prevent the attack.By utilization of the TKS algorithm,the decryption is illustrated,and security is analyzed in detail with mathematical examples.展开更多
Yao’s millionaires’ problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions.Unfortunately, most protocols for ...Yao’s millionaires’ problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions.Unfortunately, most protocols for millionaires’ problem are constructed based on public cryptography, and thus are inefficient.Furthermore, all protocols are designed to solve the basic millionaires’ problem, that is, to privately determine which of two natural numbers is greater.If the numbers are real, existing solutions do not directly work.These features limit the extensive application of the existing protocols.This study introduces and refines the first symmetric cryptographic protocol for the basic millionaires’ problem, and then extends the symmetric cryptographic protocol to privately determining which of two real numbers is greater, which are called the extended millionaires’ problem, and proposes corresponding protocols.We further prove, by a well accepted simulation paradigm, that these protocols are private.Constructed based on symmetric cryptography, these protocols are very efficient.展开更多
文摘As the wireless sensor networks are easily deployable, the volume of sensor applications has been increased widely in various fields of military and commercial areas. In order to attain security on the data exchanged over the network, a hybrid cryptographic mechanism which includes both symmetric and asymmetric cryptographic functions is used. The public key cryptographic ECC security implementation in this paper performs a matrix mapping of data’s at the points on the elliptical curve, which are further encoded using the private symmetric cipher cryptographic algorithm. This security enhancement with the hybrid mechanism of ECC and symmetric cipher cryptographic scheme achieves efficiency in energy conservation of about 7% and 4% compared to the asymmetric and symmetric cipher security implementations in WSN.
文摘We propose a framework for designing randomized stream ciphers with enhanced security. The key attribute of this framework is using of nonlinear bijective mappings or keyless hash functions for random coding. We investigate the computational security of the proposed ciphers against chosen-plaintext-chosen-initialization-vector attacks and show that it is based on the hardness of solving some systems of random nonlinear Boolean equations. We also provide guidelines for choosing components to design randomizers for specified ciphers.
文摘Supermarkets and large-scale retail stores are usually subject to huge monetary transactions for certain customers’ purchases. The computerization of these systems is common in supermarkets but the security of these transactions remains a mystery. This article presents an algorithm as an API based on symmetric cryptography that can enable end-to-end encryption of a monetary transaction in a supermarket. This algorithm is the first part of the complete supermarket management system which will be presented in the following article. The Python language and the Flask framework allow us to develop the algorithm as an independent component. Tests have been performed and our algorithm uses 98.49% less memory and 10.18% time saving than the AES algorithm.
基金This project was funded by the Deanship of Scientific Research(DSR),King Abdul-Aziz University,Jeddah,Saudi Arabia under Grant No.(D-63-611-1442).
文摘In cipher algorithms,the encryption and decryption are based on the same key.There are some limitations in cipher algorithms,for example in polyalphabetic substitution cipher the key size must be equal to plaintext otherwise it will be repeated and if the key is known then encryption becomes useless.This paper aims to improve the said limitations by designing of Triple key security algorithm(TKS)in which the key is modified on polyalphabetic substitution cipher to maintain the size of the key and plaintext.Each plaintext character is substituted by an alternative message.The mode of substitution is transformed cyclically which depends on the current position of the modified communication.Three keys are used in the encryption and decryption process on 8 or 16 rounds with the Exclusively-OR(XOR)of the 1st key.This study also identifies a single-key attack on multiple rounds block cipher in mobile communications and applied the proposed technique to prevent the attack.By utilization of the TKS algorithm,the decryption is illustrated,and security is analyzed in detail with mathematical examples.
基金Supported by the National Natural Science Foundation of China (Grant Nos 60673065, 60873249)
文摘Yao’s millionaires’ problem is a fundamental problem in secure multiparty computation, and its solutions have become building blocks of many secure multiparty computation solutions.Unfortunately, most protocols for millionaires’ problem are constructed based on public cryptography, and thus are inefficient.Furthermore, all protocols are designed to solve the basic millionaires’ problem, that is, to privately determine which of two natural numbers is greater.If the numbers are real, existing solutions do not directly work.These features limit the extensive application of the existing protocols.This study introduces and refines the first symmetric cryptographic protocol for the basic millionaires’ problem, and then extends the symmetric cryptographic protocol to privately determining which of two real numbers is greater, which are called the extended millionaires’ problem, and proposes corresponding protocols.We further prove, by a well accepted simulation paradigm, that these protocols are private.Constructed based on symmetric cryptography, these protocols are very efficient.
