On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling

2009 ◽  
pp. 137-148 ◽  
Author(s):  
Riddhipratim Basu ◽  
Subhamoy Maitra ◽  
Goutam Paul ◽  
Tanmoy Talukdar
Keyword(s):  
Random Index ◽  
Key Scheduling

scholarly journals On some local asymptotic properties of sequences with a random index

2020 ◽  
Vol 65 (3) ◽  
pp. 453-468
Author(s):  
Oleg V. Rusakov ◽  
◽  
Budimir A. Baev ◽  
Yuriy V. Yakubovich ◽  
◽  
...  
Keyword(s):  
Asymptotic Properties ◽  
Random Index

scholarly journals Scalable PP-1 block cipher

2010 ◽  
Vol 20 (2) ◽  
pp. 401-411 ◽  
Author(s):  
Krzysztof Bucholc ◽  
Krzysztof Chmiel ◽  
Anna Grocholewska-Czuryło ◽  
Ewa Idzikowska ◽  
Izabela Janicka-Lipska ◽  
...  
Keyword(s):  
Error Detection ◽  
Processing Speed ◽  
Block Cipher ◽  
Limited Resources ◽  
Concurrent Error Detection ◽  
Test Results ◽  
Speed Test ◽  
Fast Arithmetic ◽  
Key Scheduling

Scalable PP-1 block cipherA totally involutional, highly scalable PP-1 cipher is proposed, evaluated and discussed. Having very low memory requirements and using only simple and fast arithmetic operations, the cipher is aimed at platforms with limited resources, e.g., smartcards. At the core of the cipher's processing is a carefully designed S-box. The paper discusses in detail all aspects of PP-1 cipher design including S-box construction, permutation and round key scheduling. The quality of the PP-1 cipher is also evaluated with respect to linear cryptanalysis and other attacks. PP-1's concurrent error detection is also discussed. Some processing speed test results are given and compared with those of other ciphers.

Limit theory of bivariate dual generalized order statistics with random index

Statistics ◽  
2016 ◽  
Vol 51 (3) ◽  
pp. 572-590 ◽  
Author(s):  
M. A. Abd Elgawad ◽  
H. M. Barakat ◽  
Hong Qin ◽  
Ting Yan
Keyword(s):  
Order Statistics ◽  
Generalized Order Statistics ◽  
Limit Theory ◽  
Random Index ◽  
Dual Generalized Order Statistics ◽  
Generalized Order

A novel key scheduling scheme for AES algorithm

2016 ◽  
Vol 21 (2) ◽  
pp. 110-114
Author(s):  
Zhihua Hu ◽  
Kuanjiang Xiong
Keyword(s):  
Scheduling Scheme ◽  
Aes Algorithm ◽  
Key Scheduling

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.

Sign in / Sign up

Export Citation Format

Share Document