scholarly journals RELIABILITY OF RSA ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY

2014 ◽  
pp. 119-122
Author(s):  
Mykola Karpinskyy ◽  
Yaroslav Kinakh
Keyword(s):  
Computational Complexity ◽  
Number Field ◽  
Encryption Algorithm ◽  
Sieve Method ◽  
Secret Key ◽  
Rsa Algorithm ◽  
Number Field Sieve

This article deals with the RSA encryption algorithm. Its safety is analyzed using the number field sieve method. The algorithm work results allow to define a define a secret key in a simple way.

scholarly journals Image Encryption using Jumbling-Salting Algorithm

2019 ◽  
Vol 8 (12S) ◽  
pp. 790-795
Keyword(s):  
Computational Complexity ◽  
Image Encryption ◽  
Encryption Algorithm ◽  
Selective Encryption ◽  
Data Loss ◽  
Secret Key ◽  
Digital World ◽  
Encryption Algorithms ◽  
Image Encryption Algorithm ◽  
Specific Part

With the advent of digital world today, securing images across internet has become an important issue. There exist many image security techniques viz. steganography, encryption, watermarking etc. Image Encryption is one of such fruitful technique which encrypts an image using random secret key and stores the encrypted image on the server. There are many challenges of implementing image encryption algorithms such as higher computational complexity, loss of information during encryption, universality and applicability of algorithm, less scalability etc. Many image encryption algorithms are selective image encryption algorithm which works for specific part of image. It consists of encrypting only a subset of the data. The aim of selective encryption is to reduce the amount of data to encrypt while preserving a sufficient level of security. The selective encryption algorithms have a problem of scalability and data loss. The paper proposes a new algorithm Jumbling-Salting for images. The algorithm was earlier used in encryption passwords, text files, DNS, payment gateway data etc. An application is developed which incorporates the Jumbling salting encryption stategy for images.

scholarly journals Vector Map Encryption Algorithm Based on Double Random Position Permutation Strategy

2021 ◽  
Vol 10 (5) ◽  
pp. 311
Author(s):  
Xiaolong Wang ◽  
Haowen Yan ◽  
Liming Zhang
Keyword(s):  
Encryption Algorithm ◽  
Hyperchaotic System ◽  
Secret Key ◽  
Vector Map ◽  
Coordinate Position ◽  
Random Position ◽  
One To One ◽  
Map Objects ◽  
Geographic Information Sciences ◽  
The Relationship

Encryption of vector maps, used for copyright protection, is of importance in the community of geographic information sciences. However, some studies adopt one-to-one mapping to scramble vertices and permutate the coordinates one by one according to the coordinate position in a plain map. An attacker can easily obtain the key values by analyzing the relationship between the cipher vector map and the plain vector map, which will lead to the ineffectiveness of the scrambling operation. To solve the problem, a vector map encryption algorithm based on a double random position permutation strategy is proposed in this paper. First, the secret key sequence is generated using a four-dimensional quadratic autonomous hyperchaotic system. Then, all coordinates of the vector map are encrypted using the strategy of double random position permutation. Lastly, the encrypted coordinates are reorganized according to the vector map structure to obtain the cipher map. Experimental results show that: (1) one-to-one mapping between the plain vector map and cipher vector map is prevented from happening; (2) scrambling encryption between different map objects is achieved; (3) hackers cannot obtain the permutation key value by analyzing the pairs of the plain map and cipher map.

scholarly journals Quantum Dual Signature with Coherent States Based on Chained Phase-Controlled Operations

2020 ◽  
Vol 10 (4) ◽  
pp. 1353 ◽  
Author(s):  
Jinjing Shi ◽  
Shuhui Chen ◽  
Jiali Liu ◽  
Fangfang Li ◽  
Yanyan Feng ◽  
...  
Keyword(s):  
Coherent States ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
High Fidelity ◽  
Signature Scheme ◽  
Secret Key ◽  
Simulation Experiments ◽  
Quantum Devices ◽  
Shared Secret ◽  
Cnot Operation

A novel encryption algorithm called the chained phase-controlled operation (CPCO) is presented in this paper, inspired by CNOT operation, which indicates a stronger correlation among message states and each message state depending on not only its corresponding key but also other message states and their associated keys. Thus, it can prevent forgery effectively. According to the encryption algorithm CPCO and the classical dual signature protocols, a quantum dual signature scheme based on coherent states is proposed in this paper. It involves three participants, the customer Alice, the merchant Bob and the bank Trent. Alice expects to send her order message and payment message to Bob and Trent, respectively. It is required that the two messages must be linked to guarantee the payment is paid for the corresponding order. Thus, Alice can generate a quantum dual signature to achieve the goal. In detail, Alice firstly signs her two messages with the shared secret key. Then She connects the two signatures into a quantum dual signature. Finally, Bob and Trent severally verify the signatures of the order message and the payment message. Security analysis shows that our scheme can ensure its security against forgery, repudiation and denial. In addition, simulation experiments based on the Strawberry Fields platform are performed to valid the feasibility of CPCO. Experimental results demonstrate that CPCO is viable and the expected coherent states can be acquired with high fidelity, which indicates that the encryption algorithm of the scheme can be implemented on quantum devices effectively.

scholarly journals System to Safeguard the Identity of Persons in Photographs through Cryptography and Steganography Techniques Using Chaos

2018 ◽  
Vol 2018 ◽  
pp. 1-16
Author(s):  
Octavio Flores Siordia ◽  
Juan Carlos Estrada Gutiérrez ◽  
Carlos Eduardo Padilla Leyferman ◽  
Jorge Aguilar Santiago ◽  
Maricela Jiménez Rodríguez
Keyword(s):  
High Sensitivity ◽  
Encryption Algorithm ◽  
Coding System ◽  
Secret Key ◽  
Least Significant Bit ◽  
Large Space ◽  
Plain Text ◽  
Chaotic Orbits ◽  
Diffusion Technique ◽  
Plain Image

Safeguarding the identity of people in photographs or videos published through social networks or television is of great importance to those who do not wish to be recognized. In this paper, a face detecting and coding system is designed with the goal of solving this problem. Mathematical models to generate chaotic orbits are deployed. One of them applies the diffusion technique to scramble the pixels of each face while another implements the confusion technique to alter the relation between plain text and ciphered text. Afterward, another two orbits are utilized for the steganography technique to modify the least significant bit (LSB) to conceal data that would allow authorized users to decipher the faces. To verify the robustness of the proposed encryption algorithm, different tests are performed with the Lena standard image, such as correlation diagrams, histograms, and entropy. In addition, occlusion, noise, and plain image attacks are performed. The results are compared with those of other works, and the proposed system provided high sensitivity at secret key and a large space for the encryption keys, good speed for ciphering, disorder in the cryptogram, security, data integrity, and robustness against different attacks.

scholarly journals A Kilobit Special Number Field Sieve Factorization

2007 ◽  
pp. 1-12 ◽  
Author(s):  
Kazumaro Aoki ◽  
Jens Franke ◽  
Thorsten Kleinjung ◽  
Arjen K. Lenstra ◽  
Dag Arne Osvik
Keyword(s):  
Number Field ◽  
Number Field Sieve ◽  
Special Number
Sign in / Sign up

Export Citation Format

Share Document