Cryptography and Network Security

As communication technologies surged recently, the secrecy of shared information between communication parts has gained tremendous attention. Many Cryptographic techniques have been proposed/implemented to secure multimedia data and to allay public fears during communication. This paper expands the scope of audio data security via an enhanced genetic algorithm. Here, each individual (audio sample) is genetically engineered to produce new individuals. The enciphering process of the proposed technology acquires, conditions, and transforms each audio sample into bit strings. Bits fission, switching, mutation, fusion, and deconditioning operations are then applied to yield cipher audio signals. The original audio sample is recovered at the receiver's end through a deciphering process without the loss of any inherent message. The novelty of the proposed technique resides in the integration of fission and fusion into the traditional genetic algorithm operators and the use of a single ...

Abstract - A mobile ad-hoc network (MANET) is collection of portable devices or PDA’s with conjunction with mobile communication, which is designed to communicate to one or more nodes. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure called as infrastructure less and central coordination. Since the MANET is exposed to open world where there is limited or no restrictions to join in the network to the nodes. MANNETs are designed only to provide correct routing and have ability to adjust or self configure to their dynamic changing condition. So MANET is more venerable to threats by its behavior. Security is an important issue for ad hoc networks, especially for those security-sensitive applications. To secure an ad hoc network there must be an efficient cryptographic system. In this paper, we propose a cryptosystem model to provide security between nodes.
Keywords: Ad-hoc Network, Cryptography, Encryption, Decryption, Commutative Key Exchange

File encryption is an easy means of securing personal or business data protection. The RSA and AES representative encryption algorithms are not capable of satisfying the criteria of file encryption reliability and security when used separately. A hybrid encryption algorithm mixing AES and RSA algorithms is suggested in this paper to overcome the above issues in order to solve file encryption performance and security problems. The experimental results suggest that the RSA and AES hybrid encryption algorithm can not only encrypt files, but also provide the benefits of efficiency and protection of the algorithm.

The cryptography is the branch of Cryptology. It is a combination of mathematics and computer Science. It is the study of obscuring information in cyberspace. Cipher is a set of algorithm which comprise of encryption and decryption. The cipher paly important role in modern technology. The technologies involving communication including the Internet, Mobile Phones, Digital Television, and ATM machine rely on cipher in order to maintain security and privacy. Thinking about aforesaid importance of cipher in cryptography, in this article, we have designed a smallest cipher which may be efficient in RFID chips. The smallest cipher has been comprised of five mathematical operation: Exponentiation, Multiplication, Addition, Subtraction and Division based on systematic study of classical cipher. The proposed cipher is a keyless cipher, but it is very efficient in secret information passing.

Wireless network security is advancing consistently. This progress can be easily seeing by recounting the success stories achieved through the years since the modification of its first security protocol, WEP; then the WPA and finally the WPA2. The Wireless Protocol Access Pre-Shared Key (WPA2-PSK) mode is usually adopted by Small Office Home Office (SOHO) environments as it does not require a costly investment on a dedicated authentication system. Nevertheless, despite the fact that this mode was improved consistently, the core part (4-way handshake) still presents several vulnerabilities such as the key reinstallation attack (KRACK) which was discovered by Vanhoef and Piessens in 2016 and published in October, 2017. Here, we proposed an enhanced model which involved a Boolean variable that switches from true to false once the Key is installed; also, we include handshake messages encryption with Pair-wise Master Key as the encryption/decryption key, using Advance Encryption Standard (AES). Results obtained from the simulations of the enhanced model were compared with that of the existing model. The message execution time measured in micro seconds shows that the proposed model is more efficient than the existing four-way handshake model and it prevent the reinstallation of the Pair-wise Master key (PTK) during the handshake process.

The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications .The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.

As communication technologies surged recently, the secrecy of shared information between communication parts has gained tremendous attention. Many Cryptographic techniques have been proposed/implemented to secure multimedia data and to allay public fears during communication. This paper expands the scope of audio data security via an enhanced genetic algorithm. Here, each individual (audio sample) is genetically engineered to produce new individuals. The enciphering process of the proposed technology acquires, conditions, and transforms each audio sample into bit strings. Bits fission, switching, mutation, fusion, and deconditioning operations are then applied to yield cipher audio signals. The original audio sample is recovered at the receiver's end through a deciphering process without the loss of any inherent message. The novelty of the proposed technique resides in the integration of fission and fusion into the traditional genetic algorithm operators and the use of a single ...

In this paper, a C++ class for analising Vector Boolean Functions from a cryptographic perspective is presented. This implementation uses the NTL library from Victor Shoup, replacing some of the general purpose modules of this library by some more specialized and better suited to cryptography, and adding new modules that complement the existing ones. With this class, we can obtain

As communication technologies surged recently, the secrecy of shared information between communication parts has gained tremendous attention. Many Cryptographic techniques have been proposed/implemented to secure multimedia data and to allay public fears during communication. This paper expands the scope of audio data security via an enhanced genetic algorithm. Here, each individual (audio sample) is genetically engineered to produce new individuals. The enciphering process of the proposed technology acquires, conditions, and transforms each audio sample into bit strings. Bits fission, switching, mutation, fusion, and deconditioning operations are then applied to yield cipher audio signals. The original audio sample is recovered at the receiver's end through a deciphering process without the loss of any inherent message. The novelty of the proposed technique resides in the integration of fission and fusion into the traditional genetic algorithm operators and the use of a single ...

In this paper, a C++ class for analising Vector Boolean Functions from a cryptographic perspective is presented. This implementation uses the NTL library from Victor Shoup, replacing some of the general purpose modules of this library by some more specialized and better suited to cryptography, and adding new modules that complement the existing ones. With this class, we can obtain the classical representation of Vector Boolean Function such as its Truth Table and Algebraic Normal Form (ANF). It is possible to calculate mathematical structures such as the Walsh Spectrum, Linear Profile, Differential Profile and Autocorrelation Spectrum. Cryptographic criteria such as nonlinearity, linearity distance, order of correlation immunity, bal-ancedness, algebraic degree and propagation criterion can be obtained with this class. It permits to find out some interesting cryptologic parameters such as linear structures, linear potential, differential potential and the maximum possible nonlineari...

The current implementation of TLS involves your browser displaying a padlock, and a green bar, after successfully verifying the digital signature on the TLS certificate. Proposed is a solution where your browser's response to successful verification of a TLS certificate is to display a login window. That login window displays the identity credentials from the TLS certificate, to allow the user to authenticate Bob. It also displays a 'user-browser' shared secret i.e. a specific picture from your hard disk. This is not SiteKey, the image is shared between the computer user and their browser. It is never transmitted over the internet. Since sandboxed websites cannot access your hard disk this image cannot be counterfeited by phishing websites. Basically if you view the installed software component of your browser as an actor in the cryptography protocol, then the solution to phishing attacks is classic cryptography, as documented in any cryptography textbook.

File encryption is an easy means of securing personal or business data protection. The RSA and AES representative encryption algorithms are not capable of satisfying the criteria of file encryption reliability and security when used separately. A hybrid encryption algorithm mixing AES and RSA algorithms is suggested in this paper to overcome the above issues in order to solve file encryption performance and security problems. The experimental results suggest that the RSA and AES hybrid encryption algorithm can not only encrypt files, but also provide the benefits of efficiency and protection of the algorithm.

In this paper, we present a new tweakable narrow-block mode of operation, the Substitution Cipher Chaining mode (SCC), that can be efficiently deployed in disk encryption applications. SCC is characterized by its high throughout compared to the current solutions and it can be parallelized. We used this mode to modify Windows Vista’s disk encryption algorithm, to offer some parallelism in its original implementation and to improve its diffusion properties.

RSA is the most widely used and tested public-key cryptosystem. In this paper, we have discussed the RSA algorithm, its complexity and security, the use of sieve function for the key generation process and its variant multi prime RSA which uses more than two prime numbers for the encryption process. It is based on a simple number theory idea; therefore it has been able to resist most cryptanalytic attacks. The idea makes use of a very clever fact that, while it is easy to multiply two large primes, it is extremely difficult to factorize their product. Thus, we have used the concept of multi prime RSA which is further more secure because it is difficult to factorize the key into more than two numbers. The primes themselves cannot be recovered from the product and are used for decryption. Two points need to be borne in mind however, while dealing with the RSA system: there is no formal proof whatsoever that factorization is intractable or is intractable in the special case needed for RSA, and that factorization is needed for the cryptanalysis of the RSA.

14 th International Conference on Networks & Communications (NeCoM 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Computer Networks & Data Communications. The conference looks for significant contributions to the Computer Networks & Communications for wired and wireless networks in theoretical and practical aspects. Original papers are invited on computer Networks, Network Protocols and Wireless Networks, Data communication Technologies, and Network Security. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field. Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to.

International Journal on Cryptography and Information Security ( IJCIS) is an open access peer reviewed journal that focuses on cutting-edge results in applied cryptography and Information security. It aims to bring together scientists, researchers and students to exchange novel ideas and results in all aspects of cryptography, coding and Information security.

Cryptography has specific role to protect secret file from
unauthorized access. Cryptography algorithms are classified in to
two types, Symmetric-key producing and Public-key producing
algorithms. In this paper, suggested a new cryptography
algorithm to increase security in the Symmetric-key producing
algorithm. The main features of cryptography algorithm defined
in this article are Changing the physical structure of the secret
file, no limitation for the number of keys, The ability to encrypt
the secret file in successive stages, Creating five keys at each
stage of cryptography, storing a part of secret file at one of the
keys at each stage of cryptography, Interdependence of all keys
in all stages of encrypting and decrypting, To make the keys
interdependent and to encrypt the secret file by each of them,
there are 3 independent algorithms to select the type of algorithm
needed to make the keys interdependent by the user, bigger
changes in the physical structure of the encrypted file In case of
wrong decryption and to make the resulting keys and encrypted
file unique after the cryptography process.

A Mobile Ad hoc Network (MANET) is a collection of mobile stations with wireless interfaces which form a temporary network without using any central administration. MANETs are more vulnerable to attacks because they have some specific characteristics as complexity of wireless communication and lack of infrastructure. Hence security is an important requirement in mobile ad hoc networks. One of the attacks against network integrity in MANETs is the Black Hole Attack. In this type of attack all data packets are absorbed by malicious node, hence data loss occurs. In this paper we investigated the impacts of Black Hole attacks on the network performance. We have simulated black hole attacks using Network Simulator 2 (NS-2) and have measured the packet loss in the network without and with a black hole attacks. Also, we measured the packet loss when the number of black hole attacks increases.

As communication technologies surged recently, the secrecy of shared information between communication parts has gained tremendous attention. Many Cryptographic techniques have been  proposed/implemented to secure multimedia data and to allay public fears during communication. This paper expands the scope of audio data security via an enhanced genetic algorithm. Here, each individual (audio sample) is genetically engineered to produce new individuals. The enciphering process of the proposed technology acquires, conditions, and transforms each audio sample into bit strings. Bits fission, switching, mutation, fusion, and deconditioning operations are then applied to yield cipher audio signals. The original audio sample is recovered at the receiver's end through a deciphering process without the loss of any inherent message. The novelty of the proposed technique resides in the integration of fission and fusion into the traditional genetic algorithm operators and the use of a single (rather than two)  individual(s) for reproduction. The effectiveness of the proposed  cryptosystem is demonstrated through simulations and performance analyses.

Abstract: The main aim of this paper is to strengthen secured communication by introducing a new cipher, Rbits Cipher (Random Bits Cipher). We can treat this cipher as new approach or an enhancement to One-Time Pad (OTP) encryption scheme, which itself is mathematically unbreakable 0 and more complex in nature of attacker view. The goal of this paper is to develop the One-Time Pad encryption without any secret key overhead while transmission(since key is along as message) by using two algorithms, a Key Exchanging Algorithm and a Random Bit Generation algorithm. Hence forth the new cipher with the above said characteristics called as Rbits Cipher. Keywords: Cryptography, Rbits Cipher, One-Time Pad, Key Exchange, Random Bits, RSA, BBS, Encryption, Decryption

"The Yahalom protocol is one of those analyzed by Burrows et al. [5]. Based upon their analysis, they have proposed modifications to make the protocol easier to understand and to analyze. Both versions of Yahalom have now been analyzed using Isabelle/HOL. Modified Yahalom satisfies strong security goals, and the original version is adequate. The mathematical reasoning behind these machine proofs is presented informally. An Appendix gives extracts from a formal proof.

Yahalom presents special difficulties because the compromise of one session key compromises other secrets. The proofs show that the resulting losses are limited. They rely on a new proof technique, which involves reasoning about the relationship between keys and the secrets encrypted by them. This technique is applicable to other difficult protocols, such as Kerberos IV [2].

The new proofs do not rely on a belief logic. They use a fundamentally different formal model: the inductive method. They confirm the BAN analysis and the advantages of the proposed modifications. The new proof methods detect more flaws than BAN and analyze protocols in finer detail, while remaining broadly consistent with the BAN principles. In particular, the proofs confirm the explicitness principle of Abadi and Needham [1]. The proofs also suggest that any realistic model of security must admit that secrets can become compromised over time."

Abstract: This paper exploits the existence of the redundant Arabic extension character, i.e. Kashida. We propose to use pointed letters in Arabic text with a Kashida to hold the secret bit ‘one ’ and the un-pointed letters with a Kashida to hold ‘zero’. The method can be classified under secrecy feature coding methods where it hides secret information bits within the letters benefiting from their inherited points. This watermarking technique is found attractive too to other languages having similar texts to Arabic such as Persian and Urdu. 1