scholarly journals Improved RC6 Algorithm using Two Types of Chaos Maps

2019 ◽  
Vol 9 (1) ◽  
pp. 2856-2860
Keyword(s):  
Chaotic Maps ◽  
Scheduling Algorithm ◽  
Advanced Encryption Standard ◽  
Key Generation ◽  
Key Length ◽  
Key Scheduling ◽  
Better Than

RC6 (Rivest cipher 6) is keyblock chipher which consider symmetric imitative from RC5. It was intended to encounter the needs competition of the Advanced Encryption Standard (AES) . The aim of this work is to add new security layer to RC6 (Rivest Cipher 6) algorithm, because there is some insufficiency in the Key Scheduling Algorithm (KSA) of RC6. This paper presents improved RC6 (IRC6) key generation based on two types of chaotic maps (Chebyshev,2d logistic) to generate N key to N users. The results prove that the average secrecy of IRC6 is better than of traditional RC6, in which: for 32 bits’ key length, and 256 bits’ plaintext size, the average secrecy of IRC6 is (0.536 - 3.907) while for RC6 is (0.254 constant).

Affine Recurrence Based Key Scheduling Algorithm for the Advanced Encryption Standard

2021 ◽  
pp. 73-84
Author(s):  
S. Shashankh ◽  
Tavishi Kaushik ◽  
Svarnim Agarwal ◽  
C. R. Kavitha
Keyword(s):  
Scheduling Algorithm ◽  
Advanced Encryption Standard ◽  
Key Scheduling

scholarly journals On the security of $\alpha\eta$: response to 'some attacks on quantum-based cryptographic protocols'

2006 ◽  
Vol 6 (7) ◽  
pp. 561-582
Author(s):  
H.P. Yuen ◽  
R. Nair ◽  
E. Corndorf ◽  
G.S. Kanter ◽  
P. Kumar
Keyword(s):  
Coherent State ◽  
Optical Communications ◽  
A Priori ◽  
Key Generation ◽  
Generation System ◽  
New Approach ◽  
Security Proof ◽  
Grover Search ◽  
Channel Loss ◽  
Key Length

Lo and Ko have developed some attacks on the cryptosystem called $\alpha \eta$}, claiming that these attacks undermine the security of $\alpha\eta$ for both direct encryption and key generation. In this paper, we show that their arguments fail in many different ways. In particular, the first attack in [1] requires channel loss or length of known-plaintext that is exponential in the key length and is unrealistic even for moderate key lengths. The second attack is a Grover search attack based on `asymptotic orthogonality' and was not analyzed quantitatively in [1]. We explain why it is not logically possible to "pull back'' an argument valid only at $n=\infty$ into a limit statement, let alone one valid for a finite number of transmissions n. We illustrate this by a `proof' using a similar asymptotic orthogonality argument that coherent-state BB84 is insecure for any value of loss. Even if a limit statement is true, this attack is a priori irrelevant as it requires an indefinitely large amount of known-plaintext, resources and processing. We also explain why the attacks in [1] on $\alpha\eta$ as a key-generation system are based on misinterpretations of [2]. Some misunderstandings in [1] regarding certain issues in cryptography and optical communications are also pointed out. Short of providing a security proof for $\alpha\eta$, we provide a description of relevant results in standard cryptography and in the design of $\alpha\eta$ to put the above issues in the proper framework and to elucidate some security features of this new approach to quantum cryptography.

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.

Based on Improved Genetic Algorithm for Task Scheduling of Heterogeneous Multi-Core Processor

2014 ◽  
Vol 1030-1032 ◽  
pp. 1671-1675
Author(s):  
Yue Qiu ◽  
Jing Feng Zang
Keyword(s):  
Genetic Algorithm ◽  
Task Scheduling ◽  
Execution Time ◽  
Scheduling Algorithm ◽  
Experimental Results ◽  
Initial Population ◽  
Improved Genetic Algorithm ◽  
High Quality ◽  
Multi Core Processor ◽  
Better Than

This paper puts forward an improved genetic scheduling algorithm in order to improve the execution efficiency of task scheduling of the heterogeneous multi-core processor system and give full play to its performance. The attribute values and the high value of tasks were introduced to structure the initial population, randomly selected a method with the 50% probability to sort for task of individuals of the population, thus to get high quality initial population and ensured the diversity of the population. The experimental results have shown that the performance of the improved algorithm was better than that of the traditional genetic algorithm and the HEFT algorithm. The execution time of tasks was reduced.

scholarly journals A Spatiotemporal-Chaos-Based Encryption Having Overall Properties Considerably Better than Advanced Encryption Standard

2003 ◽  
Vol 40 (1) ◽  
pp. 57-62 ◽  
Author(s):  
Wang Shi-Hong ◽  
Ye Wei-Ping ◽  
Lü Hua-Ping ◽  
Kuang Jin-Yu ◽  
Li Jing-Hua ◽  
...  
Keyword(s):  
Spatiotemporal Chaos ◽  
Advanced Encryption Standard ◽  
Better Than

Inscribing in to an Control Attempt against Jammer Attack Using FB Decoding Mechanism

2014 ◽  
Vol 573 ◽  
pp. 412-417
Author(s):  
G. Sona ◽  
P. Annapandi ◽  
Boopathy Yamni
Keyword(s):  
Spread Spectrum ◽  
Cost Effective ◽  
Original Data ◽  
Overhead Cost ◽  
Storage Overhead ◽  
Node Spreading ◽  
Time Required ◽  
Key Scheduling ◽  
Secured Communication ◽  
Better Than

Previously Spread Spectrum (SS) communication involve by setting up preconfigured keys among the communicating nodes that are constrained to possess synchronous behaviour. This extends to several issues creating circular dependency problem, offering less energy efficiency and thereby leading to insecure short-lived communication. In this paper, an opponent resilient secret sharing concept is introduced without any establishment of pre-shared keys by FB (Forward Backward) decoding. It illustrates using time reversed message extraction and key scheduling at receiver side that enables secured transmission over wireless communication even when the receiver node remains inactive and attaining jammer not to obtain the original data sent by the sender node. Spreading the data involves use of DSSS as it would be more compatible in adjusting to multiple bandwidths. Main goal is to transmit the message in such a way that the time required to deliver the secret must be less than the time for the opponent to find key during transmission. Further, it come up with minimal storage overhead, cost effective and sustains long-lived secured communication among the interacting nodes. Evaluation of various parameters is performed using NS-2 toolkit to prove that this newer approach is better than earlier work.

A Semi-Persistent Scheduling Algorithm for VoIP in LTE-Advanced System

2014 ◽  
Vol 1046 ◽  
pp. 343-347
Author(s):  
Wei Wu ◽  
Jun Sun ◽  
Tong Hui Wu
Keyword(s):  
Source Coding ◽  
Scheduling Algorithm ◽  
System Throughput ◽  
Time Frequency ◽  
Coding Scheme ◽  
Lte Advanced ◽  
Key Technologies ◽  
Utilization Ratio ◽  
Advanced System ◽  
Better Than

The scheduling algorithm is one of the key technologies in LTE-Advanced system. In this paper, a semi-persistent scheduling algorithm designed for the VoIP service in LTE-Advanced system is proposed. The time-frequency resource will be allocated to the users according to the semi-persistent scheduling algorithm based on the gain for each user on the certain RB. By introducing the mechanism and procedure, analyzing the proposed semi-persistent scheduling algorithm combined the source coding (SC) or modulation and coding scheme (MCS) techniques, the superiority of the proposed algorithm is shown. The simulation results indicate that the performance of the proposed semi-persistent scheduling algorithm is better than the traditional algorithms in term of resource utilization ratio, system throughput and scheduling success rate.

scholarly journals Schedulability of Rate Monotonic Algorithm using Improved Time Demand Analysis for Multiprocessor Environment

2018 ◽  
Vol 8 (1) ◽  
pp. 429
Author(s):  
Leena Das ◽  
Sourav Mohapatra ◽  
Durga Prasad Mohapatra
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Demand Analysis ◽  
Priority Scheduling ◽  
Task Set ◽  
Rate Monotonic ◽  
Test Algorithm ◽  
Task Sets ◽  
Number Of Iterations ◽  
Better Than

<p>Real-Time Monotonic algorithm (RMA) is a widely used static priority scheduling algorithm. For application of RMA at various systems, it is essential to determine the system’s feasibility first. The various existing algorithms perform the analysis by reducing the scheduling points in a given task set. In this paper we propose a schedubility test algorithm, which reduces the number of tasks to be analyzed instead of reducing the scheduling points of a given task. This significantly reduces the number of iterations taken to compute feasibility. This algorithm can be used along with the existing algorithms to effectively reduce the high complexities encountered in processing large task sets. We also extend our algorithm to multiprocessor environment and compare number of iterations with different number of processors. This paper then compares the proposed algorithm with existing algorithm. The expected results show that the proposed algorithm performs better than the existing algorithms.</p>

scholarly journals Speech Encryption using Advanced Encryption Standard for Secured Communication

2019 ◽  
Vol 8 (3) ◽  
pp. 6515-6521
Keyword(s):  
Research Area ◽  
Quality Analysis ◽  
Advanced Encryption Standard ◽  
Speech Communication ◽  
Novel Approach ◽  
Speech Data ◽  
Speech Encryption ◽  
Key Length ◽  
Brute Force Attack ◽  
Voice Data

Securing speech communication is a great challenging task and interesting research area in recent years. Transmission of voice data over untrusted networks leads to attack the confidential information. Various speech encryption algorithms are in progress and even though speech data have been encrypted some additional features are still getting compromised to the eavesdroppers which are a get setback for security attacks. The state-of-art of Advanced Encryption Standard (AES) algorithm when compared to other encryption algorithm it has different types of cipher key length such as 128,192 and 256 bits respectively. Advanced Encryption Standard is analyzed statistically for revealing its superiority based on confusion and diffusion properties for evaluating the robustness against statistical attacks. A novel approach is developed for encrypting speech data using Advanced Encryption Standard (AES). Encrypted and the decrypted signal are evaluated based on some quality analysis for immunity checking against frequency-domain attack, brute force attack and statistical attack etc.

Sign in / Sign up

Export Citation Format

Share Document