Introduction of a Triple Prime Symmetric Key Block Cipher

نویسندگان

  • Abhijit Chowdhury
  • Angshu Kumar Sinha
  • Saurabh Dutta
چکیده

This paper proposes to put forward an innovative algorithm for symmetric key block cipher named as “Triple Prime Symmetric Key Block Cipher with Variable Key-Spaces (TPSKBCVK)” that employs triple prime integers as private key-spaces of varying lengths to encrypt data files. Principles of modular arithmetic have been elegantly used in the proposed idea of the cipher. Depending on observations of the results of implementation of the proposed cipher on a set of real data files of several types, all results are registered and analyzed. The strength of the underlying design of the cipher and the liberty of using a long key-space expectedly makes it reasonably non-susceptible against possible cryptanalytic intrusions. As a future scope of the work, it is intended to formulate and employ an improved scheme that will use a carrier media (image or multimedia data file) for a secure transmission of the private keys.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance and Efficiency Analysis of Different Block Cipher Algorithms of Symmetric Key Cryptography

In the era of information technology, security is essential to transmit confidential information (like credit card details, banking transactions etc) over the unsecured network like internet. It is possibility that the information that is being transferred through network of computers or internet being read by other people. For this we need an efficient and secure way to protect our data. Crypt...

متن کامل

Strict key avalanche criterion

A block cipher, such as the DES cipher, is used to encrypt binary plaintext in discrete blocks of length n using a key of length m, to form ciphertext blocks of length n. A block cipher is said to satisfy the strict key avalanche criterion if a one bit change in the key causes on the average one half of the ciphertext bit positions to change. In this paper the importance of the strict key avala...

متن کامل

Lightweight Symmetric-Key Hidden Vector Encryption without Pairings

Hidden vector encryption (HVE), introduced by Boneh and Waters in TCC’07, is an expressive sub-class of predicate encryption, that allows conjunctive, subset, range and comparison queries over encrypted data. All existing HVE constructions in the cryptographic literature use bilinear pairings over either composite order or prime order groups. In this paper, we address the open problem of constr...

متن کامل

Comparative Study on Data Encryption Standard Using Differential Cryptanalysis and Linear Cryptanalysis

This paper presents an approach for the comparative study on Data Encryption Standard (DES) using Differential Cryptanalysis and Linear cryptanalysis. In this paper, cipher text only attack is adopted and varieties of optimum keys are generated based on the cost function values. The goal of this paper is two fold. First we want to make a study about how evolutionary computation techniques can e...

متن کامل

New Fixed Point Attacks on GOST2 Block Cipher

GOST block cipher designed in the 1970s and published in 1989 as the Soviet and Russian standard GOST 28147-89. In order to enhance the security of GOST block cipher after proposing various attacks on it, designers published a modified version of GOST, namely GOST2, in 2015 which has a new key schedule and explicit choice for S-boxes. In this paper, by using three exactly identical portions of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1203.0369  شماره 

صفحات  -

تاریخ انتشار 2012