Retina Based Glowworm Swarm Optimization for Random Cryptographic Key Generation

Mazher, Alaa Noori; Waleed, Jumana

doi:10.21123/bsj.2022.19.1.0179

Cited by 8 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Compared to double-scroll oscillators like Lorenz, they offer richer dynamics and a larger maximum Lyapunov exponent 18,19 . This type of system has many practical uses, such as secure communications 20 , encryption 21,22 , random number generating 23 , autonomous mobile robots 24 , and other technical fields. Now, consider the simplest family of systems with 𝑛scroll chaotic attractor 25 .…”

Section: Limit Cycles Of 𝒏-Scroll Chaotic Attractormentioning

confidence: 99%

Limit Cycles of the Three-dimensional Quadratic Differential System via Hopf Bifurcation

Abddulkareem,

Amen,

Hussein

2024

Baghdad Sci.J

View full text Add to dashboard Cite

In this study, the quadratic 3-dimensional differential system is considered, in which the origin of the coordinate becomes the Hopf equilibrium point. The existence and stability of limit cycles that emerge from the Hopf point are being investigated. The Lyapunov coefficients connected to the Hopf point are calculated using the projection method. First, four families of parameter conditions are driven by which the quadratic 3-dimensional differential system can exhibit codimension three of the Hopf bifurcation. The analytical proof of each parameter family of conditions is given by calculating the Lyapunov coefficients, the vanishing of the first, sconed Lyapunov, and the non-zero of the third Lyapunov coefficients. The explicit conditions are presented for the existence and stability of three limit cycles arising from each family of Hopf bifurcations. The output of existence displays a stable (unstable) Hopf point, accompanied by the emergence of two stable (unstable) limit cycles alongside one unstable (stable) limit cycle in the neighborhood of the unstable (stable) origin of the coordinated 3-dimensional quadratic system. In addition, the outcome is utilized for exploring the limit cycles of the n-scroll chaotic attractor system, which has many practical uses, including secure communication, encryption, random number generation, and autonomous mobile robots. The conditions are derived under which the origin point of this system becomes the Hopf point, and three limit cycles can exist around the Hopf point. Finally, the numerical demonstrations show that the system undergoes a supercritical Hopf bifurcation, resulting in two stable and one unstable limit cycle. Furthermore, all results are verified.

show abstract

Section: Limit Cycles Of 𝒏-Scroll Chaotic Attractormentioning

confidence: 99%

Limit Cycles of the Three-dimensional Quadratic Differential System via Hopf Bifurcation

Abddulkareem,

Amen,

Hussein

2024

Baghdad Sci.J

View full text Add to dashboard Cite

show abstract

“…The process of calculating the vicinity space is done through the addition or subtraction of a value of one from one bit of the solution S that is selected randomly, where this process is done for each solution S 25,26 . In addition to that, there is an adaptive value (Adp) which is used to specify if the mathematical operation is plus or minus that is applied to the targeted bit as we can see in algorithm 3.…”

Section: The Vicinity Spacementioning

confidence: 99%

خوارزمية فصيلة ميركات المعدلة لتعدين القواعد الرابطة

Saleh,

Sadiq

2024

Baghdad Sci.J

View full text Add to dashboard Cite

Association Rules Mining (ARM) forms one of the important data mining techniques. The classical methods that were previously worked on by researchers have become ineffective to deal with the steady growth of databases, which prompted us to use the mining process for association rules based on metahuristic, and in our work all the correct rules will extracted, and mining is not limited to high-quality rules. Swarm intelligence based is one of these methods. In this paper, Modified Meerkat Clan for Association Rules Mining (MCC-ARM) has been proposed. Basically, the proposed algorithm depends on Meerkat Clan Algorithm (MCA). The greatest benefit is the diversity of candidate solutions in MCA. In our work the rules will represented using two methods which are borrowed from the genetic algorithm; in the first one each group of rules refers to object in society which is called Pittsburgh; while the second one each rule refers to an object in society which is called Michigan. The proposed algorithm aims to inspect for the maximum possible number of correct association rules. The so-called algorithm follows the approach of defining the effective search area, which depends on a main random mechanism to lead the algorithm in extracting alternative rules and avoiding total solutions from being guided by the same rule, and this led to a great deal of diversity. In addition, the MCC-ARM uses condensation method in the adjacency search process to prevent the algorithm from falling into the local mode. In order to prove their efficiency, it should be applied on four reliable datasets (i.e. Zoo, German Credit, Primary Tumor and Chess). The enhancement brought about by the proposed algorithm has obtained two crucial factors, namely on the number of correct rules and quality fitness value.

show abstract

“…In biometrics, the face, retina, and fingerprints are not the same in another person. Therefore, they can be used to generate random keys in cryptographic applications [22]. The original retina color image of any format or size is read as a matrix, and then it is converted to a grayscale form, generally from 0 (black) to 255 (white).…”

Section: Preprocessingmentioning

confidence: 99%

“…Feature extraction is an important stage in image processing, computer vision, data mining and image retrieval [23]. The retina is one of the wellsprings of biometric systems which [24] has inherent robustness [22] and give an efficient and reliable method for authentication [24], [25]. The feature extraction of the retina vessels is computing feature vectors to get a compact representation of the original retina [12], [26], [27].…”

Section: Feature Extractionmentioning

confidence: 99%

Cryptography based on retina information

Alrifaee

Ismaeel

2022

IJEECS

View full text Add to dashboard Cite

The security of message information has drawn more attention nowadays, so; cryptography has been used extensively. This research aims to generate secured cipher keys from retina information to increase the level of security. The proposed technique utilizes cryptography based on retina information. The main contribution is the original procedure used to generate three types of keys in one system from the retina vessel's end position and improve the technique of three systems, each with one key. The distances between the center of the diagonals of the retina image and the retina vessel's end (diagonal center-end (DCE)) represent the first key. The distances between the center of the radius of the retina and the retina vessel's end (radius center-end (RCE)) represent the second key. While the diagonal-radius center and the retina vessel's end (diagonal-radius center-end (DRCE)) represent the third key. The results illustrate the process's validity and applicability. Also, improve the time required to decrypt the cipher-text by a brute force attack (BFA) from (4.358e+139) year in the compared technique to (1.3074e+140) year for retina3. The BFA time will increase with increasing the number of retina vessels, as in retina1, 2, and 3, which have 24, 53, and 103 retina vessels.

show abstract

Retina Based Glowworm Swarm Optimization for Random Cryptographic Key Generation

Cited by 8 publications

References 15 publications

Limit Cycles of the Three-dimensional Quadratic Differential System via Hopf Bifurcation

Limit Cycles of the Three-dimensional Quadratic Differential System via Hopf Bifurcation

خوارزمية فصيلة ميركات المعدلة لتعدين القواعد الرابطة

Cryptography based on retina information

Contact Info

Product

Resources

About