scholarly journals Hybrid Chaotic Method for Medical Images Ciphering

2020 ◽  
Vol 12 (6) ◽  
pp. 1-14
Author(s):  
Seham Muawadh Ali Ebrahim
Keyword(s):  
Initial Conditions ◽  
Statistical Tests ◽  
Diagnostic Testing ◽  
Image Data ◽  
Statistical Test ◽  
Statistical Properties ◽  
Random Initial Conditions ◽  
Textual Data ◽  
Extreme Sensitivity ◽  
Two Hybrid

Healthcare is an essential application of e-services, where for diagnostic testing, medical imaging acquiring, processing, analysis, storage, and protection are used. Image ciphering during storage and transmission over the networks used has seen implemented using many types of ciphering algorithms for security purpose. Current cyphering algorithms are classified into two types: traditional classical cryptography using standard algorithms (DES, AES, IDEA, RC5, RSA, ...) and chaos cryptography using continuous (Chau, Rossler, Lorenz, ...) or discreet (Logistics, Henon, ...) algorithms. The traditional algorithms have struggled to combat image data as compared to regular textual data. Whereas, the chaotic algorithms are more efficient for image ciphering. The Significancecharacteristics of chaos are its extreme sensitivity to initial conditions and algorithm parameters. In this paper, medical image security based on hybrid/mixed chaotic algorithms is proposed. The proposed method is implemented using MATLAB. Where the image of the Retina of the Eye to detect Blood Vessels is ciphered. The Pseudo-Random Numbers Generators (PRNGs) from the different chaotic algorithms are implemented, and their statistical properties are evaluated using the National Institute of Standards and Technology NIST and other statistical test-suits. Then, these algorithms are used to secure the data, where the statistical properties of the cipher-text are also tested. We propose two PRNGs to increase the complexity of the PRNGs and to allow many of the NIST statistical tests to be passed: one based on twohybrid mixed chaotic logistic maps and one based on two-hybrid mixed chaotic Henon maps, where each chaotic algorithm runs side-by-side andstarts with random initial conditions and parameters (encryption keys). The resulting hybrid PRNGs passed many of the NIST statistical test suits.

scholarly journals Pengembangan True Random Number Generator berbasis Citra menggunakan Algoritme Kaotis

2020 ◽  
Vol 10 (1) ◽  
pp. 87
Author(s):  
Dian Arief Risdianto ◽  
Bambang Nurcahyo Prastowo
Keyword(s):  
Random Number ◽  
Initial Conditions ◽  
Statistical Tests ◽  
Random Number Generator ◽  
Digital Camera ◽  
Image Data ◽  
Random Numbers ◽  
Digital Cameras ◽  
Noise Pattern ◽  
Image Area

The security of most cryptographic systems depends on key generation using a nondeterministic RNG. PRNG generates a random numbers with repeatable patterns over a period of time and can be predicted if the initial conditions and algorithms are known. TRNG extracts entropy from physical sources to generate random numbers. However, most of these systems have relatively high cost, complexity, and difficulty levels. If the camera is directed to a random scene, the resulting random number can be assumed to be random. However, the weakness of a digital camera as a source of random numbers lies in the resulting refractive pattern. The raw data without further processing can have a fixed noise pattern. By applying digital image processing and chaotic algorithms, digital cameras can be used to generate true random numbers. In this research, for preprocessing image data used method of floyd-steinberg algorithm. To solve the problem of several consecutive black or white pixels appearing in the processed image area, the arnold-cat map algorithm is used while the XOR operation is used to combine the data and generate the true random number. NIST statistical tests, scatter and histrogram analyzes show the use of this method can produce truly random numbers

scholarly journals Statistical analysis and simulation of random shocks in stochastic Burgers equation

2014 ◽  
Vol 470 (2171) ◽  
pp. 20140080 ◽  
Author(s):  
Heyrim Cho ◽  
Daniele Venturi ◽  
George E Karniadakis
Keyword(s):  
Shock Waves ◽  
Burgers Equation ◽  
Initial Conditions ◽  
Statistical Properties ◽  
Inviscid Limit ◽  
High Dimensional ◽  
Mathematical Framework ◽  
Stochastic Burgers Equation ◽  
Random Shock ◽  
Random Initial Conditions

We study the statistical properties of random shock waves in stochastic Burgers equation subject to random space–time perturbations and random initial conditions. By using the response–excitation probability density function (PDF) method and the Mori–Zwanzig (MZ) formulation of irreversible statistical mechanics, we derive exact reduced-order equations for the one-point and two-point PDFs of the solution field. In particular, we compute the statistical properties of random shock waves in the inviscid limit by using an adaptive (shock-capturing) discontinuous Galerkin method in both physical and probability spaces. We consider stochastic flows generated by high-dimensional random initial conditions and random additive forcing terms, yielding multiple interacting shock waves collapsing into clusters and settling down to a similarity state. We also address the question of how random shock waves in space and time manifest themselves in probability space. The proposed new mathematical framework can be applied to different conservation laws, potentially leading to new insights into high-dimensional stochastic dynamical systems and more efficient computational algorithms.

Pseudorandom Number Generators Based on Chaotic Dynamical Systems

2001 ◽  
Vol 08 (02) ◽  
pp. 137-146 ◽  
Author(s):  
Janusz Szczepański ◽  
Zbigniew Kotulski
Keyword(s):  
Dynamical Systems ◽  
Communication Systems ◽  
Initial Conditions ◽  
Pseudorandom Number ◽  
New Approach ◽  
Chaotic Dynamical Systems ◽  
Pseudorandom Number Generators ◽  
Transmission Of Information ◽  
Extreme Sensitivity ◽  
Contemporary Technology

Pseudorandom number generators are used in many areas of contemporary technology such as modern communication systems and engineering applications. In recent years a new approach to secure transmission of information based on the application of the theory of chaotic dynamical systems has been developed. In this paper we present a method of generating pseudorandom numbers applying discrete chaotic dynamical systems. The idea of construction of chaotic pseudorandom number generators (CPRNG) intrinsically exploits the property of extreme sensitivity of trajectories to small changes of initial conditions, since the generated bits are associated with trajectories in an appropriate way. To ensure good statistical properties of the CPRBG (which determine its quality) we assume that the dynamical systems used are also ergodic or preferably mixing. Finally, since chaotic systems often appear in realistic physical situations, we suggest a physical model of CPRNG.

scholarly journals Importance of the initial conditions for star formation - III. Statistical properties of embedded protostellar clusters

2012 ◽  
Vol 420 (4) ◽  
pp. 3264-3280 ◽  
Author(s):  
Philipp Girichidis ◽  
Christoph Federrath ◽  
Richard Allison ◽  
Robi Banerjee ◽  
Ralf S. Klessen
Keyword(s):  
Star Formation ◽  
Initial Conditions ◽  
Statistical Properties

scholarly journals ANALISIS TINGKAT KESESUAIAN DARI KLASIFIKASI KEPADATAN LALU LINTAS DAN WAKTU TEMPUH GOOGLE MAPS

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Laksita Amelia Paramesti ◽  
Dedi Atunggal
Keyword(s):  
Travel Time ◽  
Statistical Tests ◽  
Statistical Test ◽  
Traffic Information ◽  
Actual Condition ◽  
Traffic Density ◽  
Traffic Classification ◽  
Google Maps ◽  
Traffic Condition ◽  
Significant Difference

 Traffic congestion is one of problem that occur in big cities, therefore people need traffic information to determine traffic condition. One of many applications that provides traffic information is Google Maps. From the information generated, there are insuitability between google maps’s traffic update and travel time with the actual condition. So the aim of this study is to analyze the suitability level of traffic density classification and google maps travel time. Based on the speed range by Google, the level of suitability can be determined, while the google maps travel time is done by statistical tests. The statistical test used is a statistical test of two parameters using table t with 95% confidence level. The results of this study indicate that the level of suitability of the traffic classification only reaches 35%. The low level of suitability is caused by network latency. While information on google maps travel time does not have a significant difference in actual time.

scholarly journals Burgers' turbulence problem with linear or quadratic external potential

2005 ◽  
Vol 42 (02) ◽  
pp. 550-565 ◽  
Author(s):  
O. E. Barndorff-Nielsen ◽  
N. N. Leonenko
Keyword(s):  
Burgers Equation ◽  
Initial Conditions ◽  
External Potential ◽  
Limit Laws ◽  
Random Initial Conditions ◽  
Burgers Turbulence

We consider solutions of Burgers' equation with linear or quadratic external potential and stationary random initial conditions of Ornstein-Uhlenbeck type. We study a class of limit laws that correspond to a scale renormalization of the solutions.

Sign in / Sign up

Export Citation Format

Share Document