In this paper, we proposed our new symmetric key encryption algorithm with reduced space complexity (AM Encryption algorithm-AMEA). According to disk encryption theory an encryption technique should use less than or e...
详细信息
ISBN:
(纸本)9781467369114
In this paper, we proposed our new symmetric key encryption algorithm with reduced space complexity (AM Encryption algorithm-AMEA). According to disk encryption theory an encryption technique should use less than or equal to the size of the original file size. There are two most important parameters or characteristics of algorithm time and space. An algorithm should require minimum time to perform their function and should have minimum space complexity (space complexity in terms of storage space after the encryption or the storage space required to store ciphertext). Different types of algorithm has been designed some of them provides better security but the space complexity of all existing algorithm is high. So, we proposed a new cryptographic algorithm based on symmetric key stream cipher that provides better security with minimum space complexity. This algorithm is not same as previous stream cipher algorithm (the most commonly used RC4) it has some new features such as Random Key Selection with transposition that provides better security.
Elliptic Curve Cryptosystem (ECC) is a well-known cryptosystem for securing the communications. The most important operation in ECC is scalar multiplication. The integer representation plays an important role in the p...
详细信息
Elliptic Curve Cryptosystem (ECC) is a well-known cryptosystem for securing the communications. The most important operation in ECC is scalar multiplication. The integer representation plays an important role in the performance of this operation. This paper presents and evaluates a novel recoding technique which reduces the average Hamming weight of integers. The Left-to-Right (L2R) scalar multiplication is modified to utilize this new integer representation. Our analysis shows that the computation cost (the number of required point addition/subtraction operation) in the proposed L2R scalar multiplication algorithm is effectively reduced in comparison with other modified L2R binary scalar multiplication algorithms.
The occurrence of multi-core processors has made parallel techniques popular. OpenCL, enabling access to the computing power of multi-platforms, taking advantage of the parallel feature of computing devices, gradually...
详细信息
ISBN:
(纸本)9781479957330
The occurrence of multi-core processors has made parallel techniques popular. OpenCL, enabling access to the computing power of multi-platforms, taking advantage of the parallel feature of computing devices, gradually obtains researchers' favor. However, when using parallel techniques, which computation granularity and memory allocation strategies to choose bother developers the most. To solve this problem, many researchers had implemented experiments on Nvidia GPUs and found out the best solution for using CUDA. When it comes to use OpenCL on AMD GPU, to the best of our knowledge, less solutions have been proposed in the literature. Therefore, we conduct several experiments to demonstrate the relation between computation granularity and memory allocation methods of the input data when using OpenCL on AES encoding. In granularity of 16 bytes/thread, the encryption throughput of our experiment can achieve 5 Gbps. Compared with previous works, the ratio between the price of GPU and performance from our experiment is promising.
Resource constraints make it considerably difficult to implement and optimize cryptography algorithms on sensor nodes. In order to provide guidelines for design, it is necessary to predict overheads of these algorithm...
详细信息
ISBN:
(纸本)9788955191387
Resource constraints make it considerably difficult to implement and optimize cryptography algorithms on sensor nodes. In order to provide guidelines for design, it is necessary to predict overheads of these algorithms without final implementations and optimizations. In this paper, a mathematical model based on overheads of basic operations frequently used in cryptography algorithms is presented for predicting overheads of these algorithms. Simulation results of practical implementations of several popular algorithms verify that this model is very accurate. Because these basic operations cannot be ignored when implementing cryptography algorithms, the prediction results can be used as lower bounds of overheads. More importantly, as these basic operations are also elements of other applications such as data processing, their overheads can also be used to predict overheads of those applications using the same method.
In Wireless Sensor Networks (WSNs), it is necessary to predict computational overheads of security mechanisms without final implementations to provide guidelines for system design. This paper presents an accurate and ...
详细信息
In Wireless Sensor Networks (WSNs), it is necessary to predict computational overheads of security mechanisms without final implementations to provide guidelines for system design. This paper presents an accurate and flexible model to predict overheads of these mechanisms. This model is based on overheads of basic operations frequently used in cryptography algorithms, which are essential elements of security mechanisms. Several popular cryptography algorithms and security mechanisms are evaluated using this model. According to simulation results, relative prediction errors are less than 7% for most cryptography algorithms and security mechanisms.
Ad hoc and wireless sensor networks have recently emerged as successful technologies in a number of application domains. The need to build security services into them remains however a considerable challenge as the ha...
详细信息
ISBN:
(纸本)0769524222
Ad hoc and wireless sensor networks have recently emerged as successful technologies in a number of application domains. The need to build security services into them remains however a considerable challenge as the hardware used often shows serious processing and energy limitations. This work evaluates the impact of a number of security mechanisms on sensor nodes and the network as a whole. Hence a number of actual measurements were undertaken in a real sensor platform in order to accurately establish energy consumption for various encryption algorithms as well the baseline scenario obtained when none of these is used. Measurements have shown that integrity code length added to application messages using some cryptography algorithms and MAC (Message Authentication Code) is acceptable for a sensor node with 128 KB of ROM memory and 4 KB of RAM (MICA2). We also were able to check that power consumption of the encryption process does not in itself cause representative impact, since it is in the micro-joules range.
Power analysis attacks could be used to analysis the key information according to leakage information depending on the operation of cryptography algorithm and its hardware. And they are high effectiveness with low cos...
详细信息
ISBN:
(纸本)078037889X
Power analysis attacks could be used to analysis the key information according to leakage information depending on the operation of cryptography algorithm and its hardware. And they are high effectiveness with low cost. In this paper, an improved RSA algorithm against power analysis was proposed based on its basic theory. DPA attack for RSA specially, is discussed in details. In order to maximize the capability/cost, Mask technique and removing intermediate value method are introduced into RSA system, which only cost more than 33.4% timing to realizing secure RSA algorithm, and its security was better greatly with a little cost, which would be meaningful for the security of a common crypto-system.
暂无评论