Biometrics is widely used with security systems nowadays; each biometric modality can be useful and has distinctive properties that provide uniqueness and ambiguity for security systems especially in communication and network technologies. This paper is about using biometric features of fingerprint, which is called (minutiae) to cipher a text message and ensure safe arrival of data at receiver end. The classical cryptosystems (Caesar, Vigenère, etc.) became obsolete methods for encryption because of the high-performance machines which focusing on repetition of the key in their attacks to break the cipher. Several Researchers of cryptography give efforts to modify and develop Vigenère cipher by enhancing its weaknesses.

Chaotic systems have been proved to be useful and effective for cryptography. Through this work, a new Feistel cipher depend upon chaos systems and Feistel network structure with dynamic secret key size according to the message size have been proposed. Compared with the classical traditional ciphers like Feistel-based structure ciphers, Data Encryption Standards (DES), is the common example of Feistel-based ciphers, the process of confusion and diffusion, will contains the dynamical permutation choice boxes, dynamical substitution choice boxes, which will be generated once and hence, considered static,

            While using chaotic maps, in the suggested system, called

Cipher security is becoming an important step when transmitting important information through networks. The algorithms of cryptography play major roles in providing security and avoiding hacker attacks. In this work two hybrid cryptosystems have been proposed, that combine a modification of the symmetric cryptosystem Playfair cipher called the modified Playfair cipher and two modifications of the asymmetric cryptosystem RSA called the square of RSA technique and the square RSA with Chinese remainder theorem technique. The proposed hybrid cryptosystems have two layers of encryption and decryption. In the first layer the plaintext is encrypted using modified Playfair to get the cipher text, this cipher text will be encrypted using squared

The goal of this work is to check the presence of PNS (photon number splitting) attack in quantum cryptography system based on BB84 protocol, and to get a maximum secure key length as possible. This was achieved by randomly interleaving decoy states with mean photon numbers of 5.38, 1.588 and 0.48 between the signal states with mean photon numbers of 2.69, 0.794 and 0.24. The average length for a secure key obtained from our system discarding the cases with Eavesdropping was equal to 125 with 20 % decoy states and 82 with 50% decoy states for mean photon number of 0.794 for signal states and 1.588 for decoy states.

<span lang="EN-US">The need for robotics systems has become an urgent necessity in various fields, especially in video surveillance and live broadcasting systems. The main goal of this work is to design and implement a rover robotic monitoring system based on raspberry pi 4 model B to control this overall system and display a live video by using a webcam (USB camera) as well as using you only look once algorithm-version five (YOLOv5) to detect, recognize and display objects in real-time. This deep learning algorithm is highly accurate and fast and is implemented by Python, OpenCV, PyTorch codes and the Context Object Detection Task (COCO) 2020 dataset. This robot can move in all directions and in different places especially in

Reconstruction an object from its Fourier magnitude has taken a great deal in the literature and there is still no obvious solution for the failure of this algorithm. In this paper, the frequent failure of the phase retrieval is discussed in details and it has been shown that when the object is cento-symmetric, the object support is vital element to ensure uniqueness while for asymmetric object; the asymmetric support of the object is not enough to ensure uniqueness but the reconstruction appear to include most of the information of the original object. This is also true for the reconstruction of a complex function.

the research ptesents a proposed method to compare or determine the linear equivalence of the key-stream from linear or nonlinear key-stream

In this paper we deal with the problem of ciphering and useful from group isomorphism for construct public key cipher system, Where construction 1-EL- Gamal Algorithm. 2- key- exchange Algorithm