Brownian motion-based Constellation Scrambling Encryption Method to enhance the Security of CO-OFDM/OQAM Systems

2020 ◽  
Author(s):  
Ding Ding ◽  
Yang Zhou ◽  
Ling Xiao ◽  
Zifang Yu ◽  
Lei Zhang ◽  
...  
Keyword(s):  
Brownian Motion ◽  
Encryption Method ◽  
Scrambling Encryption

Image Hybrid Encryption Based on Matrix Nonlinear Operation and Generalized Arnold Transformation

2019 ◽  
Vol 33 (06) ◽  
pp. 1954022 ◽  
Author(s):  
Xikun Liang ◽  
Xiao Tan ◽  
Limin Tao ◽  
Bin Hu
Keyword(s):  
Hybrid Encryption ◽  
Second Stage ◽  
Arnold Scrambling ◽  
Standard Mapping ◽  
Nonlinear Matrix ◽  
Two Stages ◽  
Encryption Method ◽  
Arnold Transformation ◽  
Nonlinear Operation ◽  
Scrambling Encryption

In this paper, we propose a scheme to implement hybrid encryption of images using generalized Arnold transformation and matrix nonlinear operations. This scheme consists of two stages. In the first stage, the pixels scrambling encryption is achieved by using generalized Arnold transformation. In the second stage, the pixels sequence encryption is carried out by a nonlinear matrix operation based on the key stream generated by a random matrix. Accordingly, the decryption process is completed by two steps inverse transformations. The hybrid encryption algorithm is one-time pad, and therefore has good anti-attack performance. The algorithm is featured by good confidentiality, low computational complexity, and easy-to-program processing. Moreover, the effectiveness, security and robustness of the algorithm are demonstrated by an image encryption simulation and the encryption performance analysis. Compared with the traditional Arnold scrambling encryption scheme and the chaotic encryption method based on the generalized standard mapping, the superiority of the proposed algorithm is demonstrated.

Integrated Fractional white Noise as an Alternative to Multifractional Brownian Motion

2007 ◽  
Vol 44 (02) ◽  
pp. 393-408 ◽  
Author(s):  
Allan Sly
Keyword(s):  
Stochastic Process ◽  
Brownian Motion ◽  
White Noise ◽  
Gaussian Process ◽  
Discrete Data ◽  
Hölder Exponent ◽  
Scaling Properties ◽  
Multifractional Brownian Motion ◽  
Local Properties

Multifractional Brownian motion is a Gaussian process which has changing scaling properties generated by varying the local Hölder exponent. We show that multifractional Brownian motion is very sensitive to changes in the selected Hölder exponent and has extreme changes in magnitude. We suggest an alternative stochastic process, called integrated fractional white noise, which retains the important local properties but avoids the undesirable oscillations in magnitude. We also show how the Hölder exponent can be estimated locally from discrete data in this model.

Brownian motion with quadratic killing and some implications

1986 ◽  
Vol 23 (04) ◽  
pp. 893-903 ◽  
Author(s):  
Michael L. Wenocur
Keyword(s):  
Brownian Motion ◽  
Weibull Distribution ◽  
Special Function ◽  
Function Theory ◽  
Killing Rate

Brownian motion subject to a quadratic killing rate and its connection with the Weibull distribution is analyzed. The distribution obtained for the process killing time significantly generalizes the Weibull. The derivation involves the use of the Karhunen–Loève expansion for Brownian motion, special function theory, and the calculus of residues.

Penerapan Kriptografi Keamanan Data Administrasi Kependudukan Desa Pagar Jati Menggunakan SHA-1

2020 ◽  
Vol 3 (2) ◽  
pp. 182-186
Author(s):  
Lisnayani Silalahi ◽  
Anita Sindar
Keyword(s):  
System Application ◽  
Data Security ◽  
Hash Function ◽  
Security System ◽  
Cryptographic Hash Function ◽  
Security Costs ◽  
Encryption Method

Data security and confidentiality is currently a very important issue and continues to grow. Several cases concerning data security are now a job that requires handling and security costs that are so large. To maintain the security and confidentiality of messages, data, or information so that no one can read or understand it, except for the rightful recipients, a data security system application with an encryption method using an algorithm is designed. The SHA-1 cryptographic hash function that takes input and produces a 160-bit hash value which is known as the message iteration is usually rendered as a 40-digit long hexadecimal number.

Model demonstration of brownian motion

1971 ◽  
Vol 105 (12) ◽  
pp. 736-736
Author(s):  
V.I. Arabadzhi
Keyword(s):  
Brownian Motion
Sign in / Sign up

Export Citation Format

Share Document