scholarly journals AES WITH CHAOTIC USING CHEBYSHEV POLYNOMIAL

2018 ◽  
Vol 44 (2) ◽  
pp. 35-40
Author(s):  
Tanya jabor ◽  
Hiba Taresh ◽  
Alaa Raheema
Keyword(s):  
Real Time ◽  
Personal Information ◽  
Chaotic Map ◽  
Encryption Algorithm ◽  
The Internet ◽  
Key Generation ◽  
Generation Algorithm ◽  
Critical Data ◽  
Encryption And Decryption ◽  
Day By Day

All the important information is exchanged between facilities using the internet and networks, all these data should besecret and secured probably, the personal information of person in each of these institutions day by day need to organized secretlyand the need of the cryptography systems is raised which can easily encrypt the personal and critical data and it can be shared withother centers via internet without and concerns about privacy. Chaotic performance is added to different phases of AES but very few apply it on key generation and choosing ChebyshevPolynomial will provide a chaotic map which will led to random strong key. our system based on modified advanced encryptionstandard (AES) , with encryption and decryption in real time taking to consideration the criticality of data images that beenencrypted the main encryption algorithm is the same the modification is done by replacing the key generation algorithm byChebyshev Polynomial to generate key with the required key size.

scholarly journals Provide a New Encryption Algorithm for Medical Images and Evaluate the Proposed Algorithm

2019 ◽  
Vol 8 (1) ◽  
pp. 2
Author(s):  
Mehdi Lotfi ◽  
Hossein Kheiri ◽  
Azizeh Jabbari
Keyword(s):  
Differential Equations ◽  
Chaotic Systems ◽  
Medical Information ◽  
Medical Images ◽  
Encryption Algorithm ◽  
Key Generation ◽  
Time Period ◽  
Key Space ◽  
Encryption And Decryption ◽  
Very High

Introduction:  In this paper, an encryption algorithm for the security of medical images is presented, which has extraordinary security. Given that the confidentiality of patient data is one of the priorities of medical informatics, the algorithm can be used to store and send medical image.Material and Methods:  In this paper, the solutions of chaotic differential equations are used to generate encryption keys. This method is more than other methods used in encoding medical images, resistant to statistics attacks, low encryption and decryption time and very high key space. In the proposed algorithm, unlike other methods that use random key generation, this method uses the production of solutions of the chaotic differential equations in a given time period for generating a key. All simulations and coding are done in MATLAB software.Results:   Chaotic Differential Equations have two very important features that make it possible to encode medical images. One is the unpredictability of the system's behavior and the other is a severe sensitivity to the initial condition.Conclusion: These two features make the method resistant to possible attacks to decode the concept of synchronization chaotic systems. Using the results of the method, medical information can be made safer than existing ones.

A Color Image Encryption Algorithm Based on Improved DES

2015 ◽  
Vol 743 ◽  
pp. 379-384 ◽  
Author(s):  
Zhang Li Lan ◽  
Lin Zhu ◽  
Yi Cai Li ◽  
Jun Liu
Keyword(s):  
Random Function ◽  
Color Image ◽  
Logistic Function ◽  
Color Images ◽  
Encryption Algorithm ◽  
Key Generation ◽  
Color Image Encryption ◽  
Generation Algorithm ◽  
Key Space ◽  
Image Encryption Algorithm

Key space will be reduced after using the traditional DES algorithm to directly encrypt color images. Through combining the chaotic capability of the logistic function and by means of a specific algorithm, the fake chaotic son key’s space which is produced by the logistic chaotic pseudo-random function could be acquired. Then use the key generation algorithm to replace the traditional DES key generation algorithm. Experiment illustrates that the proposed algorithm has stronger robustness and anti-jamming capability to noise, and larger key’s space, sensitive initial keys, and better encryption effect, meanwhile it is better immune to multiple attacks.

scholarly journals Encryption and Decryption of data using Elliptical Curve Cryptography

2019 ◽  
Vol 8 (9) ◽  
pp. 1141-1144
Keyword(s):  
Performance Metrics ◽  
Personal Information ◽  
Public Key Cryptography ◽  
Original Data ◽  
Public Key ◽  
Key Generation ◽  
Plain Text ◽  
Private Key ◽  
Encryption And Decryption ◽  
Pixel Value

Aadhaar database is the world's largest biometric database system. The security of Aadhaar database plays a major role. In order to secure such huge database, an encryption and decryption algorithm has been proposed in this paper. Elliptic Curve Cryptography (ECC) is a public key cryptography which is used to provide high security to those databases. The Aadhaar database contains individual personal information as well as their biometric identities. ECC is widely used for providing security to all kinds of data. ECC has smaller key size, fast computation, high throughput compared to other cryptographic algorithms. The data’s present in database are converted into their corresponding Pixel or ASCII values. After that the encryption process is done with the help of public key, private key, generation points and plain text. After the encryption process, the encrypted coordinates can be mapped with the generated points and from that corresponding ASCII value for text, pixel value for image can be retrieved. Then, the alphabet which is corresponding to ASCII will be displayed so that the cipher text can be viewed. This encrypted data is stored in the database. In order to retrieve the original data decryption process using ECC is carried out. In decryption process, receiver’s private key and cipher coordinates which is retrieved from encryption process are used. Therefore, the personal details of an individual can be retrieved with the presence of that particular person who only knows that private key. So, the hackers will not be able to retrieve the database of any individual just by knowing their Aadhaar ID. The proposed work is implemented in the MATLAB software. The Performance metrics like PSNR, Similarity, Correlation Coefficient, NPCR and UACI has been done for analysis.

scholarly journals Identity Authentication Security Management in Mobile Payment Systems

2021 ◽  
pp. 821-837
Author(s):  
Feng Wang ◽  
Ge Bao Shan ◽  
Yong Chen ◽  
Xianrong Zheng ◽  
Hong Wang ◽  
...  
Keyword(s):  
Early Stage ◽  
User Authentication ◽  
Personal Information ◽  
Mobile Payment ◽  
Key Generation ◽  
Payment Systems ◽  
Flow Management ◽  
Encryption And Decryption ◽  
Authentication Security ◽  
Management Flow

Mobile payment is a new payment method offering users mobility, reachability, compatibility, and convenience. But mobile payment involves great uncertainty and risk given its electronic and wireless nature. Therefore, biometric authentication has been adopted widely in mobile payment in recent years. However, although technology requirements for secure mobile payment have been met, standards and consistent requirements of user authentication in mobile payment are not available. The flow management of user authentication in mobile payment is still at its early stage. Accordingly, this paper proposes an anonymous authentication and management flow for mobile payment to support secure transaction to prevent the disclosure of users' information and to reduce identity theft. The proposed management flow integrates transaction key generation, encryption and decryption, and matching to process users' personal information and biometric characteristics based on mobile equipment authentication carrier.

scholarly journals Identity Authentication Security Management in Mobile Payment Systems

2020 ◽  
Vol 28 (1) ◽  
pp. 189-203
Author(s):  
Feng Wang ◽  
Ge Bao Shan ◽  
Yong Chen ◽  
Xianrong Zheng ◽  
Hong Wang ◽  
...  
Keyword(s):  
Early Stage ◽  
User Authentication ◽  
Personal Information ◽  
Mobile Payment ◽  
Key Generation ◽  
Biometric Authentication ◽  
Payment Systems ◽  
Encryption And Decryption ◽  
Authentication Security ◽  
Management Flow

Mobile payment is a new payment method offering users mobility, reachability, compatibility, and convenience. But mobile payment involves great uncertainty and risk given its electronic and wireless nature. Therefore, biometric authentication has been adopted widely in mobile payment in recent years. However, although technology requirements for secure mobile payment have been met, standards and consistent requirements of user authentication in mobile payment are not available. The flow management of user authentication in mobile payment is still at its early stage. Accordingly, this paper proposes an anonymous authentication and management flow for mobile payment to support secure transaction to prevent the disclosure of users' information and to reduce identity theft. The proposed management flow integrates transaction key generation, encryption and decryption, and matching to process users' personal information and biometric characteristics based on mobile equipment authentication carrier.

scholarly journals Lightweight Cryptographic Algorithms for Guessing Attack Protection in Complex Internet of Things Applications

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Mohammad Kamrul Hasan ◽  
Muhammad Shafiq ◽  
Shayla Islam ◽  
Bishwajeet Pandey ◽  
Yousef A. Baker El-Ebiary ◽  
...  
Keyword(s):  
Deep Learning ◽  
Internet Of Things ◽  
Real Time ◽  
Encryption Algorithm ◽  
Support Vector ◽  
Iot Applications ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Encryption Algorithms ◽  
Guessing Attack

As the world keeps advancing, the need for automated interconnected devices has started to gain significance; to cater to the condition, a new concept Internet of Things (IoT) has been introduced that revolves around smart devicesʼ conception. These smart devices using IoT can communicate with each other through a network to attain particular objectives, i.e., automation and intelligent decision making. IoT has enabled the users to divide their household burden with machines as these complex machines look after the environment variables and control their behavior accordingly. As evident, these machines use sensors to collect vital information, which is then the complexity analyzed at a computational node that then smartly controls these devicesʼ operational behaviors. Deep learning-based guessing attack protection algorithms have been enhancing IoT security; however, it still has a critical challenge for the complex industries’ IoT networks. One of the crucial aspects of such systems is the need to have a significant training time for processing a large dataset from the networkʼs previous flow of data. Traditional deep learning approaches include decision trees, logistic regression, and support vector machines. However, it is essential to note that this convenience comes with a price that involves security vulnerabilities as IoT networks are prone to be interfered with by hackers who can access the sensor/communication data and later utilize it for malicious purposes. This paper presents the experimental study of cryptographic algorithms to classify the types of encryption algorithms into the asymmetric and asymmetric encryption algorithm. It presents a deep analysis of AES, DES, 3DES, RSA, and Blowfish based on timing complexity, size, encryption, and decryption performances. It has been assessed in terms of the guessing attack in real-time deep learning complex IoT applications. The assessment has been done using the simulation approach and it has been tested the speed of encryption and decryption of the selected encryption algorithms. For each encryption and decryption, the tests executed the same encryption using the same plaintext for five separate times, and the average time is compared. The key size used for each encryption algorithm is the maximum bytes the cipher can allow. To the comparison, the average time required to compute the algorithm by the three devices is used. For the experimental test, a set of plaintexts is used in the simulation—password-sized text and paragraph-sized text—that achieves target fair results compared to the existing algorithms in real-time deep learning networks for IoT applications.

scholarly journals DES encryption and decryption algorithm implementation based on FPGA

2020 ◽  
Vol 18 (2) ◽  
pp. 774
Author(s):  
Subhi R. M. Zeebaree
Keyword(s):  
Data Security ◽  
Hardware Implementation ◽  
Block Cipher ◽  
Encryption Algorithm ◽  
The Internet ◽  
Clock Frequency ◽  
Hardware Implementations ◽  
Encryption And Decryption ◽  
Encryption Decryption ◽  
Algorithm Implementation

Nowadays there is a lot of importance given to data security on the internet. The DES is one of the most preferred block cipher encryption/decryption procedures used at present. This paper presents a high throughput reconfigurable hardware implementation of DES Encryption algorithm. This achieved by using a new proposed implementation of the DES algorithm using pipelined concept.  The implementation of the proposed design is presented by using Spartan-3E (XC3S500E) family FPGAs and is one of the fastest hardware implementations with much greater security. At a clock frequency of 167.448MHz for encryption and 167.870MHz for decryption, it can encrypt or decrypt data blocks at a rate of 10688Mbps.

An Image Encryption Algorithm Based on Oversampled Chaotic Map

2013 ◽  
Vol 694-697 ◽  
pp. 2016-2020
Author(s):  
Shu Cong Liu ◽  
Yan Xing Song ◽  
Jing Song Yang
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Chaotic Sequence ◽  
Transmission System ◽  
Encryption Algorithm ◽  
Chaotic Mapping ◽  
Key Space ◽  
Encryption And Decryption ◽  
Simulation Results ◽  
Image Encryption Algorithm

A new image encryption algorithm based on chaotic sequence is proposed, and the over sampled techniques is used in the Chebyshev mapping and Logistic chaotic mapping to generate multi-parameter chaotic key.A chaotic image encryption transmission system is build to achieve the encryption and decryption of the image signal,and the security and the encryption properties of the algorithm are analyzed. Simulation results show that the method ia simple and easy to achieve, and with larger key space ang good encryption effect.

Secure System Model for Replicated DRTDBS

2020 ◽  
pp. 264-281 ◽  
Author(s):  
Pratik Shrivastava ◽  
Udai Shanker
Keyword(s):  
Real Time ◽  
Database System ◽  
Data Item ◽  
System Model ◽  
Key Generation ◽  
Generation Algorithm ◽  
Malicious Attack ◽  
Replicated Data ◽  
Cryptographic Algorithm ◽  
Real Time Applications

Security in replicated distributed real time database system (RDRTDBS) is still explorative and, despite an increase in real-time applications, many issues and challenges remain in designing a more secure system model. However, very little research has been reported for maintaining security, timeliness, and mutual consistency. This chapter proposes the secure system model for RDRTDBS which secures the system from malicious attack. To prevent the request/response from malicious attack, authors have extended the system model with a cryptographic algorithm. In the cryptographic algorithm, a key must be secretly known only to the sender and receiver. Thus, in this chapter, authors have used the key generation algorithm to generate a key using an image. This secure system model maintains the confidentiality of the replicated data item and preserves its data integrity. It performs better in terms of malicious attack compared to other non-secure system models.

scholarly journals LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding

2021 ◽  
Author(s):  
Julian Renner ◽  
Sven Puchinger ◽  
Antonia Wachter-Zeh
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Key Generation ◽  
Gabidulin Codes ◽  
Generation Algorithm ◽  
The Public ◽  
Rank Metric ◽  
Encryption And Decryption ◽  
Time Interleaved ◽  
Constant Time Algorithms

AbstractWe propose the new rank-metric code-based cryptosystem which is based on the hardness of list decoding and interleaved decoding of Gabidulin codes. is an improved variant of the Faure–Loidreau (FL) system, which was broken in a structural attack by Gaborit, Otmani, and Talé Kalachi (GOT, 2018). We keep the FL encryption and decryption algorithms, but modify the insecure key generation algorithm. Our crucial observation is that the GOT attack is equivalent to decoding an interleaved Gabidulin code. The new key generation algorithm constructs public keys for which all polynomial-time interleaved decoders fail—hence resists the GOT attack. We also prove that the public-key encryption version of is IND-CPA secure in the standard model and the key encapsulation mechanisms version is IND-CCA2 secure in the random oracle model, both under hardness assumptions of formally defined problems related to list decoding and interleaved decoding of Gabidulin codes. We propose and analyze various exponential-time attacks on these problems, calculate their work factors, and compare the resulting parameters to NIST proposals. The strengths of are short ciphertext sizes and (relatively) small key sizes. Further, guarantees correct decryption and has no decryption failure rate. It is not based on hiding the structure of a code. Since there are efficient and constant-time algorithms for encoding and decoding Gabidulin codes, timing attacks on the encryption and decryption algorithms can be easily prevented.

Sign in / Sign up

Export Citation Format

Share Document