scholarly journals Secret Keys from Channel Noise

2011 ◽  
pp. 266-283 ◽  
Author(s):  
Hadi Ahmadi ◽  
Reihaneh Safavi-Naini
Keyword(s):  
Channel Noise ◽  
Secret Keys

A novel cryptosystem based on abstract automata and Latin cubes

2015 ◽  
Vol 52 (2) ◽  
pp. 221-232
Author(s):  
Pál Dömösi ◽  
Géza Horváth
Keyword(s):  
Block Cipher ◽  
Finite Automata ◽  
Theoretical Background ◽  
Point Of View ◽  
Theoretical Point ◽  
Transition Matrices ◽  
Encryption And Decryption ◽  
Secret Keys ◽  
Automata Network ◽  
Fully Functioning

In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.

Detection of Malicious Spatial-Domain Steganography over Noisy Channels Using Convolutional Neural Networks

2020 ◽  
Vol 2020 (4) ◽  
pp. 76-1-76-7
Author(s):  
Swaroop Shankar Prasad ◽  
Ofer Hadar ◽  
Ilia Polian
Keyword(s):  
State Of The Art ◽  
Visual Quality ◽  
Channel Noise ◽  
Detection Accuracy ◽  
Noisy Channel ◽  
Noisy Channels ◽  
Reliable Transmission ◽  
Reliable Detection ◽  
Natural Noise ◽  
Will Force

Image steganography can have legitimate uses, for example, augmenting an image with a watermark for copyright reasons, but can also be utilized for malicious purposes. We investigate the detection of malicious steganography using neural networkbased classification when images are transmitted through a noisy channel. Noise makes detection harder because the classifier must not only detect perturbations in the image but also decide whether they are due to the malicious steganographic modifications or due to natural noise. Our results show that reliable detection is possible even for state-of-the-art steganographic algorithms that insert stego bits not affecting an image’s visual quality. The detection accuracy is high (above 85%) if the payload, or the amount of the steganographic content in an image, exceeds a certain threshold. At the same time, noise critically affects the steganographic information being transmitted, both through desynchronization (destruction of information which bits of the image contain steganographic information) and by flipping these bits themselves. This will force the adversary to use a redundant encoding with a substantial number of error-correction bits for reliable transmission, making detection feasible even for small payloads.

Image encryption based on Fractional wavelet transform, Arnold transform with the double random phases in HSV color domain

2020 ◽  
Vol 13 ◽  
Author(s):  
Aarushi Shrivastava ◽  
Janki Ballabh Sharma ◽  
Sunil Dutt Purohit
Keyword(s):  
Wavelet Transform ◽  
Image Encryption ◽  
Fractional Fourier Transform ◽  
Color Image ◽  
Random Phase ◽  
Arnold Transform ◽  
Time Frequency ◽  
Key Space ◽  
Secret Keys ◽  
Fractional Wavelet Transform

Objective: In the recent multimedia technology images play an integral role in communication. Here in this paper, we propose a new color image encryption method using FWT (Fractional Wavelet transform), double random phases and Arnold transform in HSV color domain. Methods: Firstly the image is changed into the HSV domain and the encoding is done using the FWT which is the combination of the fractional Fourier transform with wavelet transform and the two random phase masks are used in the double random phase encoding. In this one inverse DWT is taken at the end in order to obtain the encrypted image. To scramble the matrices the Arnold transform is used with different iterative values. The fractional order of FRFT, the wavelet family and the iterative numbers of Arnold transform are used as various secret keys in order to enhance the level of security of the proposed method. Results: The performance of the scheme is analyzed through its PSNR and SSIM values, key space, entropy, statistical analysis which demonstrates its effectiveness and feasibility of the proposed technique. Stimulation result verifies its robustness in comparison to nearby schemes. Conclusion: This method develops the better security, enlarged and sensitive key space with improved PSNR and SSIM. FWT reflecting time frequency information adds on to its flexibility with additional variables and making it more suitable for secure transmission.

scholarly journals Device-independent quantum key distribution with random key basis

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
René Schwonnek ◽  
Koon Tong Goh ◽  
Ignatius W. Primaatmaja ◽  
Ernest Y.-Z. Tan ◽  
Ramona Wolf ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
Bell Inequality ◽  
Key Distribution ◽  
Theory And Practice ◽  
Information Theoretic ◽  
Information Theoretic Security ◽  
Experimental Parameters ◽  
Secret Keys ◽  
Simple Variant ◽  
First Time

AbstractDevice-independent quantum key distribution (DIQKD) is the art of using untrusted devices to distribute secret keys in an insecure network. It thus represents the ultimate form of cryptography, offering not only information-theoretic security against channel attacks, but also against attacks exploiting implementation loopholes. In recent years, much progress has been made towards realising the first DIQKD experiments, but current proposals are just out of reach of today’s loophole-free Bell experiments. Here, we significantly narrow the gap between the theory and practice of DIQKD with a simple variant of the original protocol based on the celebrated Clauser-Horne-Shimony-Holt (CHSH) Bell inequality. By using two randomly chosen key generating bases instead of one, we show that our protocol significantly improves over the original DIQKD protocol, enabling positive keys in the high noise regime for the first time. We also compute the finite-key security of the protocol for general attacks, showing that approximately 108–1010 measurement rounds are needed to achieve positive rates using state-of-the-art experimental parameters. Our proposed DIQKD protocol thus represents a highly promising path towards the first realisation of DIQKD in practice.

Impact of Pointing Error on the BER Performance of an OFDM Optical Wireless Communication Link over Turbulent Condition

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Bobby Barua ◽  
S. P. Majumder
Keyword(s):  
Noise Analysis ◽  
Data Rate ◽  
Channel Noise ◽  
Communication Link ◽  
Optical Wireless ◽  
Power Penalty ◽  
Major Power ◽  
Pointing Error ◽  
Turbulent Condition ◽  
Ber Performance

AbstractAn analytical approach is developed in this paper to evaluate the bit error rate (BER) performance of an optical wireless (OW) communication system with multiplexing of the RF orthogonal frequency division (OFDM) over turbulent condition taking into account the effect of pointing error. The received signal is detected through direct detection receiver followed by RF synchronous demodulation including the effect of OW channel and different form of noises such as receiver thermal noise, background channel noise and photo detector shot noise. Analysis is developed for an OFDM system over the OW channel, taking into account the effect of pointing error between the transmitter and the receiver in turbulent condition and the analysis reveals that the OFDM OW system is less affected by pointing error with deference to the major power penalty at BER performance. For instance, power penalty at BER 10−9 is found to be 3 dB for 256 OFDM subcarriers with 9 millidegree displacement angle at a data rate of 10 Gbps under turbulent condition. It is found that the system is more influenced by the atmospheric turbulence at a higher data rate.

scholarly journals High Resolution, High Contrast Beamformer Using Minimum Variance and Plane Wave Nonlinear Compounding with Low Complexity

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 394
Author(s):  
Xin Yan ◽  
Yanxing Qi ◽  
Yinmeng Wang ◽  
Yuanyuan Wang
Keyword(s):  
Plane Wave ◽  
Dimensional Space ◽  
Contrast Ratio ◽  
Low Complexity ◽  
Minimum Variance ◽  
Frame Rate ◽  
Channel Noise ◽  
Length Estimation ◽  
Lower Dimensional Space

The plane wave compounding (PWC) is a promising modality to improve the imaging quality and maintain the high frame rate for ultrafast ultrasound imaging. In this paper, a novel beamforming method is proposed to achieve higher resolution and contrast with low complexity. A minimum variance (MV) weight calculated by the partial generalized sidelobe canceler is adopted to beamform the receiving array signals. The dimension reduction technique is introduced to project the data into lower dimensional space, which also contributes to a large subarray length. Estimation of multi-wave receiving covariance matrix is performed and then utilized to determine only one weight. Afterwards, a fast second-order reformulation of the delay multiply and sum (DMAS) is developed as nonlinear compounding to composite the beamforming output of multiple transmissions. Simulations, phantom, in vivo, and robustness experiments were carried out to evaluate the performance of the proposed method. Compared with the delay and sum (DAS) beamformer, the proposed method achieved 86.3% narrower main lobe width and 112% higher contrast ratio in simulations. The robustness to the channel noise of the proposed method is effectively enhanced at the same time. Furthermore, it maintains a linear computational complexity, which means that it has the potential to be implemented for real-time response.

Sign in / Sign up

Export Citation Format

Share Document