scholarly journals An efficient cryptographic scheme for text message protection

2018 ◽  
Vol 7 (1.7) ◽  
pp. 152
Author(s):  
Manikandan N K ◽  
Manivannan D ◽  
Antony Kumar K
Keyword(s):  
Text Message ◽  
Secure Messaging ◽  
Unauthorized Access ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Is Security ◽  
Original Message ◽  
Encryption Decryption ◽  
Primary Focus ◽  
Cryptographic Scheme

Interchange of information is increasing very rapidly. Transferring any information on internet arises with the biggest issue that is security. Cryptography plays an important role in achieving security. For any type of business our primary focus is mainly on the security of information for that we require a robust and unbreakable process that provides great safety. This project is concerned with the development of a secure messaging system based on cryptographic algorithm that is which is more faster, better immune to attacks, more complex, easy to encrypt. This is well featured and provides encryption/decryption that can protect message from unauthorized access. we proposed an algorithm, which uses triple keys for encryption and decryption of text to secure the information. This application is well featured and provides security that can protect message from unauthorized access. To send a message, a sender types and encrypts a text message using Three Keys algorithm with a key selected from keylist .The encrypted message is stored in database and receiver’s inbox serial number of key .The receiver, after logging into account ,selects key value and then decrypts with key to see the original message

scholarly journals Implementasi Algoritma Kriptografi RSA untuk Enkripsi dan Dekripsi Email

2015 ◽  
Vol 3 (2) ◽  
pp. 253
Author(s):  
Albert Ginting ◽  
R. Rizal Isnanto ◽  
Ike Pertiwi Windasari
Keyword(s):  
Data Transmission ◽  
Initial Step ◽  
Second Step ◽  
Java Programming ◽  
Rsa Algorithm ◽  
Decimal Number ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Original Message ◽  
Client Program

In the world of Internet nothing is really safe. There's always a gap in any application made. Likewise in email delivery. To minimize attacks on the data transmission is usually applied cryptography. One fairly popular cryptographic algorithms are RSA algorithm. In this study will discuss the implementation of a cryptographic algorithm RSA encryption and decryption process email. To test created a java-based email client program with message encryption and decryption features messages. This application uses the Java programming language and Netbeans 7.4 as editor. Mail servers used is Google Mail. The initial step of this study was to download email from the Google server and encrypt the message. The second step is decrypt the message to verify whether the message is still the same as the original message before it is encrypted . Results from this study is the application that can encrypt and decrypt messages using RSA cryptographic algorithm. With this application is expected to mail delivery is much safer. Because encrypted email will generate a random decimal number of unknown value .

scholarly journals A Chaos based image Encryption Scheme using one Dimensional Exponential Logistic Map.

2019 ◽  
Vol 1 ◽  
pp. 223-237
Author(s):  
Terlumun Gbaden
Keyword(s):  
Correlation Coefficient ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Scheme ◽  
One Dimensional ◽  
Encryption And Decryption ◽  
Secret Keys ◽  
Encryption Decryption ◽  
Logistic Chaotic Map ◽  
Encrypted Images

The widespread use of images in various sectors of life makes its protection increasingly necessary and important. An improvement over encryption and decryption algorithm using exponential logistic chaotic map was proposed. In this work, we adopt an encryption/decryption strategy for colour images using the exponential logistic chaotic map. The proposed encryption/decryption algorithms are implemented in MATLAB for computer simulation. The experimental results indicate that the proposed algorithms can be used successfully to encrypt/decrypt images with secret keys. The performance analysis using histogram uniformity analysis and correlation coefficient show that the algorithms give larger space, quick speed and easy to realize. The encrypted images have good encryption effect and low correlation coefficient rendering it a good candidate for confidential and secure means of transmitting image information in untrusted networks.

scholarly journals Study A Public Key in RSA Algorithm

2020 ◽  
Vol 5 (4) ◽  
pp. 395-398
Author(s):  
Taleb Samad Obaid
Keyword(s):  
Private Information ◽  
Original Data ◽  
Prime Numbers ◽  
Public Key ◽  
The Internet ◽  
Sensitive Information ◽  
Rsa Algorithm ◽  
Encryption And Decryption ◽  
Main Disadvantage ◽  
Encryption Decryption

To transmit sensitive information over the unsafe communication network like the internet network, the security is precarious tasks to protect this information. Always, we have much doubt that there are more chances to uncover the information that is being sent through network terminals or the internet by professional/amateur parasitical persons. To protect our information we may need a secure way to safeguard our transferred information. So, encryption/decryption, stenographic and vital cryptography may be adapted to care for the required important information. In system cryptography, the information transferred between both sides sender/receiver in the network must be scrambled using the encryption algorithm. The second side (receiver) should be outlook the original data using the decryption algorithms. Some encryption techniques applied the only one key in the cooperation of encryption and decryption algorithms. When the similar key used in both proceeds is called symmetric algorithm. Other techniques may use two different keys in encryption/decryption in transferring information which is known as the asymmetric key.  In general, the algorithms that implicated asymmetric keys are much more secure than others using one key.   RSA algorithm used asymmetric keys; one of them for encryption the message, and is known as a public key and another used to decrypt the encrypted message and is called a private key. The main disadvantage of the RSA algorithm is that extra time is taken to perform the encryption process. In this study, the MATLAB library functions are implemented to achieve the work. The software helps us to hold very big prime numbers to generate the required keys which enhanced the security of transmitted information and we expected to be difficult for a hacker to interfere with the private information. The algorithms are implemented successfully on different sizes of messages files.

scholarly journals From chaos to stability in soliton mode-locked fibre laser system

2021 ◽  
Vol 67 (6 Nov-Dec) ◽  
Author(s):  
Morteza A. Sharif ◽  
K. Ashabi
Keyword(s):  
Laser System ◽  
Control Process ◽  
Stable State ◽  
Chaotic Regime ◽  
Fibre Laser ◽  
Control Parameters ◽  
Single Side ◽  
Encryption And Decryption ◽  
Encryption Decryption ◽  
Unstable States

Intracavity energy rate in a soliton mode-locked fibre laser is derived by solving the Haus master equation. The influence of net gain, absorber response, saturation energy, nonlinearity and absorption are investigated on stable/unstable states. Intracavity modes include the zeroth, first and higher order solitons. Accordingly, chaotic regime as well as breather modes is recognized as a conventional intracavity state. However, tuning the control parameters also results in a reverse bifurcation and thus returning to a stable state. Accordingly, a chaos-based encryption/decryption system is proposed taking the advantage of using a single-side control process; both the encryption and decryption procedures can be achieved by one of the actions of increasing/decreasing the control parameters.

scholarly journals A New Symmetric Key Cryptographic Algorithm using Paley Graphs and ASCII Values

2021 ◽  
Vol 297 ◽  
pp. 01046
Author(s):  
Zhour Oumazouz ◽  
Driss Karim
Keyword(s):  
Brute Force ◽  
Strong Regularity ◽  
Quadratic Residues ◽  
Cryptographic Algorithm ◽  
Paley Graph ◽  
Encryption And Decryption ◽  
Symmetric Key ◽  
Brute Force Attack ◽  
The Moment ◽  
Paley Graphs

The main objective of the study conducted in this article is to introduce a new algorithm of encryption and decryption of a sensitive message after transforming it into a binary message. Our proposed encryption algorithm is based on the study of a particular graph constructed algebraically from the quadratic residues. We have exploited the Paley graph to introduce an abstract way of encryption of such message bit according to the other message bits by the intermidiate study of the neighborhood of a graph vertex. The strong regularity of the Paley graphs and the unknown behavior of the quadratic residues will play a very important role in the cryptanalysis part which allows to say that the brute force attack remains for the moment the only way to obtain the set of possible messages.

Hybrid Cryptography for Random-key Generation based on ECC Algorithm

2017 ◽  
Vol 7 (3) ◽  
pp. 1293 ◽  
Author(s):  
P. Gayathri ◽  
Syed Umar ◽  
G. Sridevi ◽  
N. Bashwanth ◽  
Royyuru Srikanth
Keyword(s):  
Security Level ◽  
Key Generation ◽  
Public Key Encryption ◽  
Private Key ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Safe Side ◽  
Key Length ◽  
High Level ◽  
User Friendly

As more increase in usage of communications and developing them more user friendly. While developing those communications, we need to take care of security and safety of user’s data. Many researchers have developed many complex algorithms to maintain security in user’s application. Among those one of the best algorithms are cryptography based, in which user will be safe side mostly from the attackers.  We already had some AES algorithm which uses very complex cryptographic algorithm to increase the performance and more usage of lookup tables. So the cache timing attackers will correlates the details to encrypt the data under known key with the unknown key. So, for this we provide an improvised solution. This paper deals with an extension of public-key encryption and decryption support including a private key. The private key is generated with the combination of AES and ECC. In general AES, key length is 128 bits with 10 times of iterations. But with this, users won’t get efficient security for their operations, so to increase the security level we are implementing 196-bit based encryption with 12 times round-key generation iterations. By this enhancement, we can assure to users to high level security and can keep users data in confidential way.

scholarly journals Barrel Shifter Physical Unclonable Function Based Encryption

Cryptography ◽  
2018 ◽  
Vol 2 (3) ◽  
pp. 22 ◽  
Author(s):  
Yunxi Guo ◽  
Timothy Dee ◽  
Akhilesh Tyagi
Keyword(s):  
Logistic Regression ◽  
Manufacturing Process ◽  
Ring Oscillator ◽  
Key Generation ◽  
Physical Unclonable Functions ◽  
Encryption And Decryption ◽  
Barrel Shifter ◽  
Transmission Gates ◽  
Encryption Decryption ◽  
Randomness Tests

Physical Unclonable Functions (PUFs) are designed to extract physical randomness from the underlying silicon. This randomness depends on the manufacturing process. It differs for each device. This enables chip-level authentication and key generation applications. We present an encryption protocol using PUFs as primary encryption/decryption functions. Each party has a PUF used for encryption and decryption. This PUF is constrained to be invertible and commutative. The focus of the paper is an evaluation of an invertible and commutative PUF based on a primitive shifting permutation network—a barrel shifter. Barrel shifter (BS) PUF captures the delay of different shift paths. This delay is entangled with message bits before they are sent across an insecure channel. BS-PUF is implemented using transmission gates for physical commutativity. Post-layout simulations of a common centroid layout 8-level barrel shifter in 0.13 μ m technology assess uniqueness, stability, randomness and commutativity properties. BS-PUFs pass all selected NIST statistical randomness tests. Stability similar to Ring Oscillator (RO) PUFs under environmental variation is shown. Logistic regression of 100,000 plaintext–ciphertext pairs (PCPs) fails to successfully model BS-PUF behavior.

New barbituric acid derivatives for data encryption and decryption based on the mechanochromic fluorescence effect

The Analyst ◽  
2020 ◽  
Vol 145 (15) ◽  
pp. 5325-5332
Author(s):  
Hanjun Zhang ◽  
Zhen Xu ◽  
Furong Tao ◽  
Yan Li ◽  
Yuezhi Cui ◽  
...  
Keyword(s):  
Optical Properties ◽  
Barbituric Acid ◽  
Data Encryption ◽  
Fluorescence Properties ◽  
Encryption And Decryption ◽  
Encryption Decryption ◽  
Barbituric Acid Derivatives ◽  
Fluorescence Effect

CB-Ph and CB-Me have similar color and fluorescence properties, while they exhibit specific differences under the same stimulus. Based on the unique optical properties of CB-Ph and CB-Me, a new data encryption–decryption technology is developed.

scholarly journals REVIEW OF IMAGE ENCRYPTION AND DECRYPTION TECHNIQUES FOR 2D IMAGES

2020 ◽  
Vol 5 (1) ◽  
pp. 81-84
Author(s):  
Jalpa Shah ◽  
JS Dhobi
Keyword(s):  
Image Encryption ◽  
Multimedia Software ◽  
Unauthorized Access ◽  
Application Security ◽  
Encryption And Decryption ◽  
2D Images ◽  
The Way

In the emerging era of Internet, multimedia software and application security of images is of major concern. To offer security to these images encryption is the way for robust security. With Image Encryption it becomes difficult to analyze the image that is communicated over untrusted network. Also it provides security for any unauthorized access. The paper provides an introduction to cryptography and various image encryption techniques are reviewed for 2D images.

Sign in / Sign up

Export Citation Format

Share Document