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
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Abstract: There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems. This connection to statistical mechanics exposes new information and provides an unfamiliar perspective on traditional optimization problems and methods.
41,772 citations
TL;DR: In this article, a new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented, which requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
Abstract: A new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous space functions is presented. By means of an extensive testbed it is demonstrated that the new method converges faster and with more certainty than many other acclaimed global optimization methods. The new method requires few control variables, is robust, easy to use, and lends itself very well to parallel computation.
24,053 citations
Book•
01 Jan 1995TL;DR: This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition, and is designed as a text, with over 100 exercises, to benefit anyone involved in the fields of neural computation and pattern recognition.
Abstract: From the Publisher:
This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition. After introducing the basic concepts, the book examines techniques for modelling probability density functions and the properties and merits of the multi-layer perceptron and radial basis function network models. Also covered are various forms of error functions, principal algorithms for error function minimalization, learning and generalization in neural networks, and Bayesian techniques and their applications. Designed as a text, with over 100 exercises, this fully up-to-date work will benefit anyone involved in the fields of neural computation and pattern recognition.
19,056 citations
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Abstract: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intented recipient. Only he can decipher the message, since only he knows the corresponding decryption key. (2) A message can be “signed” using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in “electronic mail” and “electronic funds transfer” systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret primer numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d ≡ 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor, n.
14,659 citations
04 Oct 1995
TL;DR: The optimization of nonlinear functions using particle swarm methodology is described and implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm.
Abstract: The optimization of nonlinear functions using particle swarm methodology is described. Implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm. Benchmark testing of both paradigms is described, and applications, including neural network training and robot task learning, are proposed. Relationships between particle swarm optimization and both artificial life and evolutionary computation are reviewed.
14,477 citations