An Ordeal Random Data Encryption Scheme (ORDES) (original) (raw)

AN ORDEAL RANDOMIZED SECURE DATA ENCRYPTION SCHEME (ORSDES)

Abstract: In this paper, we present a new Data encryption scheme named as Ordeal Randomized Secure Data Encryption Scheme (ORSDES). The theoretical security measures are also discussed and ORSDES advocates its competency. Through this paper, we encourage and motivate the user to use DES as ORSDES with more efficiency and security. Mainly we emphasis on secrecy of key because all knows, In cryptography key always have important role.

An Innovative Approach to Enhance the Security of Data Encryption Scheme

International Journal of …, 2010

In this paper, we proposed a new scheme to enhance the security of data Encryption scheme. With cascading of data encryption standard in three times, we become able to counter the famous meet in middle attack in double and triple data encryption standard. We show how the random key stream can be used to create lifetime supply of keys for one time pads. Here we provided the practical approach that we can use to set up our own one-time pad encryption. For simplicity let's study how randomized key can be achieved. Random key generation can simply be obtained via use of permutation. Permutation technique can be used in conjunction with other technique includes substitution, encryption function etc. for effective performance. The goal of this article to show how the one-time pad encryption technique can be achieved by the suitable combination of these techniques.

A New Approach for Data Cryptography

IJCSMC, 2019

Due to the large number of different computer applications transactions on the internet, cryptography is a vital key in ensuring the security of the transactions. Cryptography is an important way of achieving data confidentiality, data integrity, user authentication and non-repudiation. In this paper we will introduce a new approach of message encryption-decryption, this approach will be implemented, and the experimental results will compared with the results of DES method of data cryptography. The following features of the proposed approach will be proved:-Simplicity, Efficiency, High security level, Flexibility.

IJERT-Data Encryption Technique Using Random Number and Salective Encryption Algorithem

International Journal of Engineering Research and Technology (IJERT), 2014

https://www.ijert.org/data-encryption-technique-using-random-number-and-salective-encryption-algorithem https://www.ijert.org/research/data-encryption-technique-using-random-number-and-salective-encryption-algorithem-IJERTV3IS042413.pdf Symmetric key algorithms are a typically critical and useful cryptosystem, therefore it has critical applications in lots of field. Encryption will be the primary strategy to provide security towards the data, which is travelling over a communication link between any set of nodes, but Not bothered encryption is really a technique to save lots of computational energy, overhead, pace, time also to provide rapid security by only encrypting some sort of selected portion In wireless ad hoc network with restraint resources, this cryptosystem dependent on symmetric key algorithms is quite prefer a great nimble as well as dynamic natural environment, along with different protection strategies. In this paper, we introduce the concept of selective encryption into your design involving message security strategies. First, we provide the theory of selective encryption as well as propose some symmetric selective encryption algorithm dependant on symmetric key. A communication having uncertainty transmitted through sender for you to receiver, so that only authorized recipient can decrypt this cipher text. other unauthorized nodes don't have any knowledge with the transmitted messages generally speaking. We likewise employ other security ways of enhance this security involving proposed system. For implementing this method we conduct an extensive set of experiments dependant on matlab, and they also improve this efficiency involving message encryption.

An Exquisite Cryptographic Algorithm for Lesser Amount of Data

IJCA Proceedings on National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011, 2011

Once an application steps out of the bounds of a single-computer box, its external communication is immediately exposed to a multitude of outside observers with various intentions, good or bad. In order to protect sensitive data while these are en route, applications invoke different methods. In today's world, most of the means of secure data and code storage and distribution rely on using cryptographic schemes, such as certificates or encryption keys. Thus, cryptography mechanisms form a foundation upon which many important aspects of a solid security system are built. Cryptography is the science of writing in secret code and is an ancient art. Some experts argue that cryptography appeared spontaneously sometime after writing was invented, with applications ranging from diplomatic missives to wartime battle plans. It is no surprise, then; those new forms of cryptography came soon after the widespread development of computer communications. There are two basic types of cryptography: Symmetric Key and Asymmetric Key. Symmetric key algorithms are the quickest and most commonly used type of encryption. Here, a single key is used for both encryption and decryption. There are few well-known symmetric key algorithms i.e. DES, RC2, RC4, IDEA etc. This paper describes cryptography and its types and then proposes a new symmetric key algorithm X-S cryptosystem based on stream cipher. Algorithms for both encryption and decryption are provided here. The advantages of this new algorithm over the others are also explained.

Randomized Text Encryption: a New Dimension in Cryptography

Cryptography refers to protecting transmitted information from unauthorized interception or tampering, while cryptanalysis is art of breaking such secret ciphers and reading information, or perhaps replacing it with different information. The research highlights a new encryption technique called randomized text encryption. The algorithm proposed increases the complexity of cryptanalyst to decrypt the ciphertext and restricts them to break the security of encoded file. The proposed technique uses random numbers added to plaintext along with encryption key. After applying encryption technique, each time same plaintext will be converted to different ciphertext provided that encryption key is same or different. Two different characters are generated against single character of plaintext that doubles the size of encrypted text. Decryption process doesn’t require random numbers but only needs encryption key to decipher the encrypted text. Consequently, the proposed technique is safe to different cryptanalytic attacks like Frequency analysis, Brute-Force, Linear and Differential Cryptanalysis. Copyright © 2014 Praise Worthy Prize S.r.l. - All rights reserved.

Simple, Efficient, Highly Secure, and Multiple Purposed Method on Data Cryptography

Traitement du Signal

Some digital data circulated through various social media, regardless of its nature, requires high-level protection and security for various reasons. In this research, a multipurpose method will be presented to be used in encrypting SMS messages, text files regardless of their size, digital images of all kinds and sizes, and audio files of all kinds and sizes. The proposed method will be examined to prove its efficiency, and the practical results will be compared with the implementation results of other internationally approved methods to show the extent to which the method improves efficiency indicators. It will be shown how to use digital color image to generate a highly secure private key which will make the process of hacking impossible. The Quality of the encrypted and decrypted images will be examined to justify the use of the proposed method.

Message Based Random Variable Length Key Encryption Algorithm

Journal of Computer Science, 2009

Problem statement: A block ciphers provides confidentiality in cryptography but cryptanalysis of the classical block ciphers demonstrated some old weaknesses grabbing a partial key in any stage of encryption procedure leads to reconstructing the whole key. Exhaustive key search shows that key generation should be indeterminist and random for each round. Matching cipher-text attack shows that larger size of block is more secure. In order to overcome analysis mentioned above a new algorithm is designed that is based on random numbers and also can defeat time and memory constraints. Approach: Dynamic and message dependent key generator was created by producing a random number and it was selected as the size of first chunk. Residual value of second chunk divided by first chunk concatenating with first chunk forms the first cipher as an input for SP-boxes. These processes repeated until whole mesaage get involved into the last cipher. Encrypted messages are not equal under different run. Value of random number should be greater than 35 bits and plaintext must be at least 7 bits. A padding algorithm was used for small size messages or big random numbers. Results: Attack on the key generation process was prevented because of random key generation and its dependency to input message. Encryption and decryption times measured between 5 and 27 m sec in 2 GHz Pentium and java platform so time variant and fast enough key generation had been kept collision and timing attacks away due to small seized storage. Long and variable key length made key exhaustive search and differential attack impossible. None fixed size key caused avoidance of replaying and other attacks that can happen on fixed sized key algorithms. Conclusion: Random process employed in this block cipher increased confidentiality of the message and dynamic length substitution in proposed algorithm may lead to maximum cryptographic confusion and consequently makes it difficult for cryptanalysis.