Public Key Cryptography Using Harmony Search Algorithm
TL;DR: The adaptation of the HSA tries to provide a fast key generation mechanism with a feasible implementation to provide privacy requirement for viability of modern information sharing through cyberspace.
Abstract: Privacy is a very important requirement for viability of modern information sharing through cyberspace and the modern cryptology is ensuring success. Harmony Search Algorithm (HSA) is a new meta-heuristic computation technique inspired from musical improvisation techniques, where searching for a perfect harmony is the objective of this technique. Public Key Cryptography heavily relies on key pairs which are large prime numbers. Our adaptation of the HSA tries to provide a fast key generation mechanism with a feasible implementation. The keys are ranked based on their harmony and the best harmony is selected as the result of the search which in turn is used to generate the key pair of RSA, a Public Key Cryptography technique as a test of effectiveness and success.
Citations
More filters
01 Jan 2020
TL;DR: The main contribution of this article is the proposed use of the theory of interval type-2 fuzzy logic to the dynamic adjustment of parameters for the harmony search algorithm and then its application to the optimal design of interval types of fuzzy logic controller.
Abstract: At the present time there are several types of metaheuristics which have been used to solve various types of problems in the real world. These metaheuristics contain parameters that are usually fixed throughout the iterations. However, various techniques exist to adjust the parameters of an algorithm such as probabilistic, fuzzy logic, among others. This work describes the methodology and equations for building Triangular and Gaussian interval type-2 membership functions, and this methodology was applied to the optimization of a benchmark control problem with an interval type-2 fuzzy logic controller. To validate in the best way the effect of uncertainty we perform experiments using noise (Pulse generator) and without noise. Also, a statistical z-test is presented to verify the effectiveness of the proposed method. The main contribution of this article is the proposed use of the theory of interval type-2 fuzzy logic to the dynamic adjustment of parameters for the harmony search algorithm and then its application to the optimal design of interval type-2 fuzzy logic controller.
13 citations
01 Sep 2021
TL;DR: In this article, the authors proposed a security design based on Elliptic-Curve Cryptography (ECC), the SHA-256 (Secure Hash Algorithm 256) algorithm, and the Artificial Bee Colony (ABC) algorithm to boost the security of IoT-based smart irrigation systems.
Abstract: The Internet of Things (IoT) includes various technologies, including sensing devices, Radio-Frequency Identification (RFID), and Microelectromechanical Systems (MEMS). Despite numerous advantages of IoT, security and privacy are important challenges. IoT infrastructures are frequently attacked by different invaders, including white hat hackers whose mission is to test the system's penetrability. Other attacks are orchestrated by adversaries that misuse system vulnerabilities to seize information for personal benefits. Hence, security is a key factor and fundamental requirement of IoT design. Thus, increased cyberattacks call for an appropriate strategic plan to ensure IoT security. Enhancing data security in IoT has proved to be a major concern, and one solution to mitigate this is to apply suitable encryption techniques when storing data in the IoT. An intruder will be able to control IoT devices without physical access if the network is not secure enough. To overcome this challenge, this paper proposes a security design based on Elliptic-Curve Cryptography (ECC), the SHA-256 (Secure Hash Algorithm 256) algorithm, and the Artificial Bee Colony (ABC) algorithm to boost the security of IoT-based smart irrigation systems. The proposed model applies the ABC algorithm to generate the private key for ECC. The results show that the optimal encoding and decoding times were 100 and 150 iterations, respectively. Moreover, compared to 3DES&ECC&SHA-256 and RC4&ECC&SHA-256, the total throughput of the proposed model was about 50.04% and 55.29% higher in encryption and 51.36% and 58.41% higher in decryption. The evaluation indicates a significant improvement (>50%) in the throughput rate. The performance results obtained indicate the efficiency and effectiveness of the proposed scheme in terms of performance and security.
6 citations
References
More filters
20 Jun 2010
TL;DR: A novel approach for secure and fast key generation of the public key cryptographic algorithm of RSA is described, implemented on a typical SmartCard equipped with a crypto-coprocessor and a true random number generator.
Abstract: RSA based SmartCards have been widely used in security services such as secure data transmission in many applications over the past few years. Generation of a secure key pair which is based on finding a pair of large prime numbers is an indispensable part of creating a secure channel. This paper describes a novel approach for secure and fast key generation of the public key cryptographic algorithm of RSA. This method has been implemented on a typical SmartCard equipped with a crypto-coprocessor and a true random number generator. An efficient method for generating the large random prime numbers is proposed that considerably reduces the total time required for generating a key pair. The key generation process is based on selecting an appropriate public key from a set of pre-defined public keys and computing the private key using the Euclid's extended algorithm. The measurements at a 4MHz main clock frequency have revealed that the mean time for generating 512, 1024 and 2048 bits RSA key pair are 2.85, 6.82 and 44.78 seconds, respectively. That is up to 50% reduction in total generation time compared to the latest reported methods.
25 citations
26 Sep 2013
TL;DR: This paper proposes key generation for PKC by application of ANN using Genetic Algorithm (GA), and makes use of Hebbian learning rule to train the ANN of both sender and receiver machines.
Abstract: By making use of Artificial Intelligence (AI), Human Intelligence can be simulated by a machine, Neural Networks is one such sub field of AI. Artificial Neural Networks (ANN) consists of neurons and weights assigned to inter neuron connections helps in storing the acquired knowledge. This paper makes use of Hebbian learning rule to train the ANN of both sender and receiver machines. In the field of Public Key Cryptography (PKC), Pseudo Random Number Generator (PRNG) are widely used to generate unique keys and random numbers used in ANN which are found to possess many types of possible attacks. It is essential for a key to possess randomness for key strength and security. This paper proposes key generation for PKC by application of ANN using Genetic Algorithm (GA). It was noticed that use of ANN along with GA has not as yet been explored. GA approach is often applied for obtaining optimization and solutions in search problems. GA correlates to the nature to a large extent producing population of numbers where number possessing higher fitness value is replicated more. Thus, making GA a very good contender for PRNGs. Good Fitness function helps in exploring search space of random numbers in more efficient manner. GA PRNGs result samples satisfies frequency test and gap test. Thus the numbers generated after each iteration by GA PRNG are statistically verified to be random and nonrepeating, having no prior relation of next number from the previous ones, acting as an essential initialization parameter for neural algorithm overcomes the problem of acknowledging the random number generated by traditional PRNG. For generating public and private keys, different number of rounds of mixing is used. This ensures that the private key generated cannot be derived from public key. Our algorithm was observed to give fast and improved performance results having practical and feasible implementation.
21 citations
01 Aug 2004
TL;DR: This paper shows how an approach based on combinatorial optimization techniques and the symmetric key part of BAN logic can be further developed to encompass the full BAN Logic without the loss of efficiency and thereby synthesize public key protocols and hybrid protocols.
Abstract: Security protocols play an important role in modern communications. However, security protocol development is a delicate task, and experience shows that computer security protocols are notoriously difficult to get right. Recently, Clark and Jacob provided a framework for automatic protocol generation based on combinatorial optimization techniques and the symmetric key part of BAN logic. This paper shows how such an approach can be further developed to encompass the full BAN logic without the loss of efficiency and thereby synthesize public key protocols and hybrid protocols.
15 citations
TL;DR: Criticism and ideas in evolutionary computation and other alternative approaches to solving Integer Factorization, a vital number theoretic problem frequently finding application in public-key cryptography, and other areas like Fourier transform algorithm are put forth.
9 citations