An improved novel Hill cipher using RCLT Title of the article

2018 ◽  
Vol 7 (3.3) ◽  
pp. 209
Author(s):  
V Hema ◽  
Dr M. Ganaga Durga
Keyword(s):  
Number Theory ◽  
Galois Field ◽  
New Method ◽  
Key Generation ◽  
Security Issues ◽  
Remote Server ◽  
Integrity Checking ◽  
Hill Cipher ◽  
Cryptographic Scheme

Security is the only buoyant to the frailest link. In this communication world, the implementation of sturdy cryptographic and integrity checking algorithms is the smart solution to the frailest link. So, the proposed paper provides the new-fangled pattern of cryptographic scheme in concert with Number Theory which safeguard the integrity and confidentiality of intricate data and communications. By using this system, client’s burden of security issues associated with the data hosting in the untrusted remote server is abridged. By manipulating some features of the Galois Field, a new method of key generation is proposed. The proposed system is resilient against the various attacks and cannot be understood by the intruders. It is simple yet robust and will surely improve the overall security with higher efficiency. 

scholarly journals Key Generation based on Henon map and Lorenz system

2020 ◽  
Vol 31 (1) ◽  
pp. 41
Author(s):  
Ansam Sabah Bader ◽  
Shaymaa Hameed ◽  
Maisa’a Abid Ali K.
Keyword(s):  
Lorenz System ◽  
New Method ◽  
Key Generation ◽  
Hénon Map ◽  
Henon Map ◽  
Data Authentication ◽  
Secure Information ◽  
Data Store ◽  
Significant Process ◽  
Encryption Algorithms

Securing information has been the most significant process for communication and data store. Orderly to secure information such as data authentication,  data integrity, and confidentiality must be verified based on algorithms of cryptography. Where, the most important part of any encryption algorithms is the key which specifies if the system is strong enough or not. The proposal of this paper is a new method to generate keys based on two kinds of chaos theory in order to improve the security of cryptographic algorithms. The base of this proposal is to investigate a new method for generating random numbers by using the 3D Lorenz system and 2D Henon map. The newly generated keys have successfully passed the National Institute of Standards and Technology (NIST) statistical test suite

scholarly journals High Security Mechanism: Fragmentation and Replication in the Cloud with Auto Update in the System.

2020 ◽  
Vol 5 (2) ◽  
pp. 54-59
Author(s):  
Shrutika Khobragade ◽  
Rohini Bhosale ◽  
Rahul Jiwahe
Keyword(s):  
Cloud Computing ◽  
Low Cost ◽  
Vital Role ◽  
Third Party ◽  
Key Generation ◽  
Huge Amount ◽  
Security Issues ◽  
Hash Key ◽  
Use Of Internet ◽  
High Quality Service

Cloud Computing makes immense use of internet to store a huge amount of data. Cloud computing provides high quality service with low cost and scalability with less requirement of hardware and software management. Security plays a vital role in cloud as data is handled by third party hence security is the biggest concern to matter. This proposed mechanism focuses on the security issues on the cloud. As the file is stored at a particular location which might get affected due to attack and will lost the data. So, in this proposed work instead of storing a complete file at a particular location, the file is divided into fragments and each fragment is stored at various locations. Fragments are more secured by providing the hash key to each fragment. This mechanism will not reveal all the information regarding a particular file even after successful attack. Here, the replication of fragments is also generated with strong authentication process using key generation. The auto update of a fragment or any file is also done here. The concept of auto update of filles is done where a file or a fragment can be updated online. Instead of downloading the whole file, a fragment can be downloaded to update. More time is saved using this methodology.

Message Security Using a Combination of Hill Cipher and RSA Algorithms

2021 ◽  
Vol 1 (1) ◽  
pp. 20-28
Author(s):  
Yogi Suryo Santoso
Keyword(s):  
Information Security ◽  
Data Confidentiality ◽  
Validity Data ◽  
Security Issues ◽  
Data Authentication ◽  
Hill Cipher ◽  
Data Validity ◽  
Mathematical Techniques ◽  
Cryptographic Techniques ◽  
Rsa Cryptography

The process of exchanging digital messages is increasingly being used due to its easy and practical use. But the process of exchanging digital messages is vulnerable to being tapped by unauthorized people. Cryptography is the study of mathematical techniques related to aspects of information security, such as data confidentiality, data validity, data integrity, and data authentication. With cryptography, the process of exchanging messages between two people can be done securely. Thus, cryptographic techniques are used to overcome security issues when exchanging messages. The methods used in this study are hybrid hill cipher and RSA cryptography. In this study it was shown that hybrid hill cipher cryptography with a 3x3 matrix key and RSA with a 512 bit key can overcome security issues when exchanging data so that messages sent cannot be read by unauthorized people.

TAKE-IoT

2020 ◽  
Vol 11 (3) ◽  
pp. 1-21
Author(s):  
Roumaissa Khelf ◽  
Nacira Ghoualmi-Zine ◽  
Marwa Ahmim
Keyword(s):  
Key Exchange ◽  
Internet Security ◽  
Security Requirements ◽  
Wireless Sensor ◽  
Key Generation ◽  
Authenticated Key Exchange ◽  
Key Exchange Protocol ◽  
Security Issues ◽  
Ipsec Protocol ◽  
The Internet Of Things

The goal of this work is to develop a key exchange solution for IPsec protocol, adapted to the restricted nature of the Internet of Things (IoT) components. With the emergence of IP-enabled wireless sensor networks (WSNs), the landscape of IoT is rapidly changing. Nevertheless, this technology has exacerbated the conventional security issues in WSNs, such as the key exchange problem. Therefore, Tiny Authenticated Key Exchange Protocol for IoT (TAKE-IoT) is proposed to solve this problem. The proposed TAKE-IoT is a secure, yet efficient, protocol that responds to several security requirements and withstands various types of known attacks. Moreover, TAKE-IoT aims to reduce computation costs using lightweight operations for the key generation. The proposed protocol is validated using the automated validation of internet security protocols and applications (AVISPA) tool. Hence, results show that TAKE-IoT can reach a proper level of security without sacrificing its efficiency in the context of IoT.

A finite arithmetic

1973 ◽  
Vol 38 (2) ◽  
pp. 232-248 ◽  
Author(s):  
Philip T. Shepard
Keyword(s):  
Number Theory ◽  
Natural Number ◽  
Singular Term ◽  
New Method ◽  
Axiomatic System ◽  
Natural Numbers ◽  
Substantial Loss ◽  
First Order ◽  
Finite Arithmetic

In this paper I shall argue that the presumption of infinitude may be excised from the area of mathematics known as natural number theory with no substantial loss. Except for a few concluding remarks, I shall restrict my concern in here arguing the thesis to the business of constructing and developing a first-order axiomatic system for arithmetic (called ‘FA’ for finite arithmetic) that contains no theorem to the effect that there are infinitely many numbers.The paper will consist of five parts. Part I characterizes the underlying logic of FA. In part II ordering of natural numbers is developed from a restricted set of axioms, induction schemata are proved and a way of expressing finitude presented. A full set of axioms are used in part III to prove working theorems on comparison of size. In part IV an ordinal expression is defined and characteristic theorems proved. Theorems for addition and multiplication are derived in part V from definitions in terms of the ordinal expression of part IV. The crucial final constructions of part V present a new method of replacing recursive characterizations by strict definitions.In view of our resolution not to assume that there are infinitely many numbers, we shall have to deal with the situation where singular arithmetic terms of FA may fail to refer. For I know of no acceptable and systematic way of avoiding such situations. As a further result, singular-term instances of universal generalizations of FA are not to be inferred directly from the generalizations themselves. Nevertheless, (i) (x)(y)(x + y = y + x), for example, and all its instances are provable in FA.

scholarly journals Error correction by Reed–Solomon codes using its automorphisms

2021 ◽  
Vol 66 (1) ◽  
pp. 110-116
Author(s):  
V. A. Lipnitsky ◽  
S. I. Semyonov
Keyword(s):  
Error Correction ◽  
Galois Field ◽  
Correction Method ◽  
New Method ◽  
Group Of Automorphisms ◽  
Rs Codes ◽  
Reed Solomon Codes ◽  
Rs Code ◽  
Error Correction Method ◽  
Joint Group

The article explores the syndrome invariants of АГ-group of automorphisms of Reed–Solomon codes (RS-codes) that are a joint group of affine and cyclic permutations. The found real invariants are a set of norms of N Г-orbits that make up one or another АГ-orbit. The norms of Г-orbits are vectors with 2 1 Cδ− coordinates from the Galois field, that are determined by all kinds of pairs of components of the error syndromes. In this form, the invariants of the АГ-orbits were cumbersome and difficult to use. Therefore, their replacement by conditional partial invariants is proposed. These quasi-invariants are called norm-projections. Norm-projection uniquely identifies its АГ-orbit and therefore serves as an adequate way for formulating the error correction method by RS-codes based on АГ-orbits. The power of the АГ-orbits is estimated by the value of N2, equal to the square of the length of the RS-code. The search for error vectors in transmitted messages by a new method is reduced to parsing the АГ‑orbits, but actually their norm-projections, with the subsequent search for these errors within a particular АГ-orbit. Therefore, the proposed method works almost N2 times faster than traditional syndrome methods, operating on the basic of the “syndrome – error” principle, that boils down to parsing the entire set of error vectors until a specific vector is found.

scholarly journals Enhancement in data security and integrity using minhash technique

2021 ◽  
Vol 21 (3) ◽  
pp. 1739
Author(s):  
Sa'ed Abed ◽  
Lamis Waleed ◽  
Ghadeer Aldamkhi ◽  
Khaled Hadi
Keyword(s):  
Data Integrity ◽  
Large Set ◽  
Key Generation ◽  
Sensitive Data ◽  
The Public ◽  
Original Algorithm ◽  
Large Sets ◽  
Integrity Checking ◽  
Encryption Decryption ◽  
Memory Utilization

Data <span>encryption process and key generation techniques protect sensitive data against any various attacks. This paper focuses on generating secured cipher keys to raise the level of security and the speed of the data integrity checking by using the MinHash function. The methodology is based on applying the cryptographic algorithms rivest-shamir-adleman (RSA) and advanced encryption standard (AES) to generate the cipher keys. These keys are used in the encryption/decryption process by utilizing the Pearson Hash and the MinHash techniques. The data is divided into shingles that are used in the Hash function to generate integers and in the MinHash function to generate the public and the private keys. MinHash technique is used to check the data integrity by comparing the sender’s and the receiver’s encrypted digest. The experimental results show that the RSA and AES algorithms based on the MinHash function have less encryption time compared to the normal hash functions by 17.35% and 43.93%, respectively. The data integrity between two large sets is improved by 100% against the original algorithm in terms of completion time, and 77% for small/medium data and 100% for large set data in terms of memory utilization.</span>

Sign in / Sign up

Export Citation Format

Share Document