scholarly journals Implementing the Secure Protocol for Exchanging the Symmetric Key of FPGA-based Embedded Systems

2014 ◽  
pp. 45
Author(s):  
Tran Thanh ◽  
Tran Hoang Vu ◽  
Nguyen Van Cuong ◽  
Pham Ngoc Nam
Keyword(s):  
Encryption Algorithm ◽  
Prototype System ◽  
Symmetric Encryption ◽  
Secret Key ◽  
Data Confidentiality ◽  
Public Network ◽  
Secure Protocol ◽  
Symmetric Key ◽  
Asymmetric Encryption ◽  
Pass Through

Cryptographic  solution  for  protecting  data which  pass  through  an  insecure  public  network  is widely  applied.  To  ensure  the  data  confidentiality  and availability,  the  secret  key  must  be  exchanged  securely between  parties before  beginning  a  transaction  session. This paper presents a protocol to enhance the flexibility and  secrecy  of  symmetric  key  exchange  over  the Internet. Our approach uses an asymmetric encryption algorithm  to  protect  symmetric  encryption  keys  from thefts and tampers over a transmission line. In addition, this  paper  presents  a  protocol  to  ensure  the  integrity, confidentiality  of  the  symmetric  key,  and  the  freshness of  a  transaction  session.  Experimental  results  from  a prototype system based on FPGA are also revealed.

scholarly journals Secure Login System using MD5 and AES Attribute Based Encryption Algorithm

2020 ◽  
Vol 9 (8) ◽  
pp. 810-814
Keyword(s):  
Exchange Process ◽  
Encryption Algorithm ◽  
Symmetric Encryption ◽  
Secret Key ◽  
Aes Algorithm ◽  
Attribute Based Encryption ◽  
Financial Framework ◽  
Third Person ◽  
Message Digest ◽  
Symmetric Key

The cryptographic hash work and symmetric encryption make it hard to break Passwords. Secure secret word stockpiling is a crucial perspective in framework dependent on secret word verification, which is as yet the most broadly utilized confirmation system, notwithstanding its some security imperfections. So basically, this work is based on providing security to the systems. Right now, propose a secret word verification structure that is intended for secure secret word stockpiling and could be effectively coordinated into existing confirmation frameworks. In our system, first, the got plain secret key from a customer is worked out a cryptographic hash work. At that point; the hashed secret word is changed over into a negative secret word. At last, the negative secret word is encoded into an Encrypted Negative Password (ENP) utilizing a symmetric-key calculation, and multi-emphasis encryption could be utilized to additionally improve security. The cryptographic hash work and symmetric encryption make it hard to split passwords from ENPs.We are going to use message digest i.e MD5 and AES algorithm for this purpose. Besides, there are loads of comparing ENPs for a given plain secret key, which makes precomputation assaults infeasible. The calculation multifaceted nature investigations and examinations show that the ENP could oppose query table assault and give more grounded secret word insurance under lexicon assault. It merits referencing that the ENP doesn't present additional components other than this, the ENP could in any case oppose precomputation assaults. We are giving shading coding framework just as key logger idea secret key reason. This shading code framework is hard to break to third person. In key lumberjack the keypad of framework is mix, each time it will change the grouping of catches of 0-9 numbers,subsequent to logging the client one otp will send to client email just as the key squence of the keypad will send on client email. By utilizing this otp and key grouping client will login to framework and it will do the further exchange process. This framework will valuable in future for any financial framework or any verification reason will be utilized.

scholarly journals ВДОСКОНАЛЕНА ПОЛІНОМІАЛЬНО-СКЛАДНА АТАКА ВІДНОВЛЕННЯ ВІДКРИТОГО ТЕКСТУ НА РАНЦЕВИЙ ШИФР НА ОСНОВІ МАТРИЦЬ

2020 ◽  
pp. 67-74
Author(s):  
Олексій Сергійович Вамболь
Keyword(s):  
Discrete Logarithm ◽  
Public Information ◽  
Galois Field ◽  
Secret Key ◽  
The Matrix ◽  
Encryption Schemes ◽  
Shared Secret ◽  
Symmetric Key ◽  
Asymmetric Encryption ◽  
The Given

Asymmetric ciphers are widely used to ensure the confidentiality of data transmission via insecure channels. These cryptosystems allow the interacting parties to create a shared secret key for a symmetric cipher in such a way that an eavesdropper gets no information useful for cryptanalysis. Network security protocols that use asymmetric ciphers include TLS, S/MIME, OpenPGP, Tor, and many others. Some of the asymmetric encryption schemes are homomorphic, that is, that they allow calculations on encrypted data to be performed without preliminary decryption. The aforesaid property makes possible using these cryptosystems not only for symmetric key establishment but also in several areas of application, in particular in secret voting protocols and cloud computing. The matrix-based knapsack cipher is a new additively homomorphic asymmetric encryption scheme, which is based on the properties of isomorphic transformations of the inner direct product of diagonal subgroups of a general linear group over a Galois field. Unlike classic knapsack encryption schemes, the cryptographic strength of this cipher depends on the computational complexity of the multidimensional discrete logarithm problem. Despite some useful properties, further research into the cryptographic strength of the matrix-based knapsack cipher has found serious drawbacks inherent in this cryptographic scheme. In the given paper an improved polynomial-time plaintext-recovery attack on the matrix-based knapsack cipher is proposed. Applying this cryptanalytic method requires only public information and has time complexity O(t1.34), where t denotes the decryption time of the attacked cryptosystem. The aforementioned attack is more productive and easier to implement in software in comparison with the original one. The advantages of the proposed method are due to using in its algorithm the simple and relatively fast matrix trace operation instead of more complex and slower transformations.

Cryptanalytic Attacks on IDEA Block Cipher

2016 ◽  
Vol 66 (6) ◽  
pp. 582 ◽  
Author(s):  
Harish Kumar Sahu ◽  
Vikas Jadhav ◽  
Shefali Sonavane ◽  
R.K. Sharma
Keyword(s):  
Block Cipher ◽  
Data Encryption ◽  
Secret Key ◽  
Data Confidentiality ◽  
Data Encryption Standard ◽  
Financial Application ◽  
Time Requirements ◽  
International Data ◽  
Key Block ◽  
Symmetric Key

International data encryption algorithm (IDEA) is a secret key or symmetric key block cipher. The purpose of IDEA was to replace data encryption standard (DES) cipher, which became practically insecure due to its small key size of 56 bits and increase in computational power of systems. IDEA cipher mainly to provide data confidentiality in variety of applications such as commercial and financial application e.g. pretty good privacy (PGP) protocol. Till 2015, no successful linear or algebraic weaknesses IDEA of have been reported. In this paper, author explained IDEA cipher, its application in PGP and did a systematic survey of various attacks attempted on IDEA cipher. The best cryptanalysis result which applied to all keys could break IDEA up to 6 rounds out of 8.5 rounds of the full IDEA cipher1. But the attack requires 264 known plaintexts and 2126.8 operations for reduced round version. This attack is practically not feasible due to above mention mammoth data and time requirements. So IDEA cipher is still completely secure for practical usage. PGP v2.0 uses IDEA cipher in place of BassOmatic which was found to be insecure for providing data confidentiality.

scholarly journals Enhanced Content Based Double Encryption Algorithm Using Symmetric Key Cryptography

2017 ◽  
Vol 10 (2) ◽  
pp. 345-351
Author(s):  
Junestarfield Kynshi ◽  
Deepa Jose
Keyword(s):  
Encryption Algorithm ◽  
Secret Key ◽  
Cipher Text ◽  
Xor Operation ◽  
Symmetric Key ◽  
Binary Addition ◽  
Secure Network ◽  
Symmetric Key Cryptography

This paper aims to solve the problems of the existing technique of the content based double encryption algorithm using symmetric key cryptography. Simple binary addition, folding method and logical XOR operation are used to encrypt the content of a plaintext as well as the secret key.This algorithm helps to achieve the secure transfer of data throught the network. It solved the problems of the existing algorithm and provides a better solution. The plaintext are encrypted using the above methods and produce a cipher text. The secret key is encrypted and shared through secure network and without knowing the secret key it is difficult to decipher the text. As per expected, enhanced encryption algorithm gives better result than the existing encryption algorithm.

Images Encryption Method using Steganographic LSB Method, AES and RSA algorithm

2017 ◽  
Vol 6 (1) ◽  
Author(s):  
Abdelkader Moumen ◽  
Hocine Sissaoui
Keyword(s):  
Image Encryption ◽  
Digital Images ◽  
Communication Security ◽  
Symmetric Encryption ◽  
Secret Key ◽  
Rsa Algorithm ◽  
Asymmetric Encryption ◽  
Encryption Method ◽  
Least Significant Bits

AbstractVulnerability of communication of digital images is an extremely important issue nowadays, particularly when the images are communicated through insecure channels. To improve communication security, many cryptosystems have been presented in the image encryption literature. This paper proposes a novel image encryption technique based on an algorithm that is faster than current methods. The proposed algorithm eliminates the step in which the secrete key is shared during the encryption process. It is formulated based on the symmetric encryption, asymmetric encryption and steganography theories. The image is encrypted using a symmetric algorithm, then, the secret key is encrypted by means of an asymmetrical algorithm and it is hidden in the ciphered image using a least significant bits steganographic scheme. The analysis results show that while enjoying the faster computation, our method performs close to optimal in terms of accuracy.

scholarly journals An improved NFC device authentication protocol

PLoS ONE ◽  
2021 ◽  
Vol 16 (8) ◽  
pp. e0256367
Author(s):  
He-Jun Lu ◽  
Dui Liu
Keyword(s):  
Near Field ◽  
Transmission Efficiency ◽  
Authentication Protocol ◽  
Encryption Algorithm ◽  
Symmetric Encryption ◽  
Replay Attack ◽  
Security Authentication ◽  
Man In The Middle ◽  
Asymmetric Encryption ◽  
Brute Force Attack

Aimed at the security authentication problem between Near Field Communication (NFC) devices, this paper uses the technology of asymmetric encryption algorithm, symmetric encryption algorithm, hash function, timestamp and survival period to improve the confidentiality, performance and security of the protocol. The symmetric encryption algorithm encrypts the transmission content, while the asymmetric encryption algorithm encrypts the shared key. The whole authentication process is secure, and the key distribution is secure. The improved NFC device authentication protocol can effectively resist the brute force attack, man-in-the-middle attack and replay attack in the authentication process, it can reduce the number of message transmission in the authentication process, improve the transmission efficiency, enhance the confidentiality, integrity, non-repudiation and improve the security of NFC device authentication.

scholarly journals Password Substantiation with Negative Password Encryption

2020 ◽  
pp. 184-190
Author(s):  
Dr. D. Hema Latha ◽  
Azmath Mubeen ◽  
Dr. D. Rama Krishna Reddy
Keyword(s):  
Hash Function ◽  
Symmetric Encryption ◽  
Secret Key ◽  
Good Resistance ◽  
Protection Mechanism ◽  
Cryptographic Hash Function ◽  
Rainbow Table ◽  
Password Protection ◽  
Symmetric Key

Secure secret password storage is an essential perspective in frameworks dependent on secret phrase Substantiation method, which is as yet the most broadly utilized Substantiation confirmation procedure, in spite of its some security imperfections. In this paper, a secret key Substantiation architecture structure is implemented that is intended for secure secret password storage and could be effectively incorporated into existing authentication frameworks. In this framework first the plain password which is received from the customer is given to cryptographic hash component for SHA-256 cryptographic process. After this, the hashed secret password is changed over into a negative secret password phrase. At last, the negative password is encoded/encrypted into an Encrypted Negative Password (ENP) utilizing a symmetric-key computation using for example, AES, and additionally to improve security, multi-repeated encryption could be utilized. The cryptographic hash function and symmetric encryption make it hard to break passwords from ENPs. Also, it provides lots of comparing ENPs for a given plain password, which makes pre-calculation intrusions (e.g., and rainbow table intrusion and query table attacks) infeasible. The complex calculations and comparisons of the algorithm provide good resistance towards intrusions and also provide stronger password protection. The proposed and implemented mechanism for Password Substantiation with Negative Password Encryption is a good secured password protection mechanism that merges cryptographic hash function, the negative password and the symmetric-key algorithm, without the requirement for extra data from the plain password.

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.

Sign in / Sign up

Export Citation Format

Share Document