Biometric and Data Secure Application for Eye Iris’s Recognition Using Hopfield Discrete Algorithm and Rivest Shamir Adleman Algorithm

Artificial neural network (ANN) was used to identify the characteristics of the input iris is represented by the binary value. Input from these characteristics trained by discrete Hopfield neural network algorithm for the "recognized" or NOT. Eye’s iris can be used as an alternative to overcome the problems of privacy and data security because of the unique characteristics present in the iris itself. Texture of it, are unique to each person having a texture pattern is stable throughout life, even it left and right eyes of someone else having the same texture. Call was recognized if the output produced in accordance with the trend of network or proximity input pattern to a target pattern. Rivest Shamir Adleman (RSA) implements a public-key cryptosystem, as well as digital signatures. RSA is motivated by the published works of Diffie and Hellman from several years before, who described the idea of such an algorithm, but never truly developed it. Results from this study is that the system can recognize the characteristics of it in identify more precise and good degree of accuracy, and can distinguish the iris with each other.

[1]  Zsolt Tuza,et al.  Maximum cuts and largest bipartite subgraphs , 1993, Combinatorial Optimization.

[2]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[3]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[4]  Gene Tsudik,et al.  New multiparty authentication services and key agreement protocols , 2000, IEEE Journal on Selected Areas in Communications.

[5]  Sasikanth Avancha,et al.  Security for Sensor Networks , 2004 .

[6]  Xiang-Sun Zhang,et al.  A Neural Network Model for Quadratic Programming with Simple Upper and Lower Bounds and its Application to Linear Programming , 1994, ISAAC.

[7]  Youshen Xia.  A new neural network for solving linear programming problems and its application , 1996, IEEE Trans. Neural Networks.

[8]  Z Xinjian.  Hopfield-type Neural Network For Solving "Four-Coloring Map Problems , 1999 .

[9]  Franz Rendl,et al.  A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..

[10]  Abdesselam Bouzerdoum,et al.  Neural network for quadratic optimization with bound constraints , 1993, IEEE Trans. Neural Networks.

[11]  Daniel M. Gordon,et al.  A Survey of Fast Exponentiation Methods , 1998, J. Algorithms.

[12]  John J. Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities , 1999 .

[13]  Yinyu Ye,et al.  Solving Sparse Semidefinite Programs Using the Dual Scaling Algorithm with an Iterative Solver , 2000 .

[14]  Leon O. Chua,et al.  Neural networks for nonlinear programming , 1988 .

[15]  X. Xu,et al.  Effective neural algorithms for the traveling salesman problem , 1991, Neural Networks.

[16]  Arun Jagota,et al.  Approximating maximum clique with a Hopfield network , 1995, IEEE Trans. Neural Networks.

[17]  Yoshiyasu Takefuji,et al.  A Neural Network Model for Finding a Near-Maximum Clique , 1992, J. Parallel Distributed Comput..

[18]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[19]  Xiong Zhang,et al.  Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..

[20]  Jacques Stern,et al.  Security Proofs for Signature Schemes , 1996, EUROCRYPT.

[21]  Jacques Stern,et al.  RSA-OAEP Is Secure under the RSA Assumption , 2001, Journal of Cryptology.

[22]  Mahesan Niranjan,et al.  A theoretical investigation into the performance of the Hopfield model , 1990, IEEE Trans. Neural Networks.

[23]  Kate Smith-Miles,et al.  Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research , 1999, INFORMS J. Comput..

[24]  Andrzej Cichocki,et al.  Neural networks for optimization and signal processing , 1993 .

[25]  Nobuo Funabiki,et al.  A binary neural network approach for max cut problems , 1996 .

[26]  Xiang-Sun Zhang,et al.  Neural networks in optimization , 2000 .

[27]  Aart Joppe,et al.  A neural network for solving the travelling salesman problem on the basis of city adjacency in the tour , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[28]  Jun Wang.  Analysis and design of a recurrent neural network for linear programming , 1993 .

[29]  Yin Zhang,et al.  Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs , 2002, SIAM J. Optim..