1,853 research outputs found
A novel quality assessment for visual secret sharing schemes
To evaluate the visual quality in visual secret sharing schemes, most of the existing metrics fail to generate fair and uniform quality scores for tested reconstructed images. We propose a new approach to measure the visual quality of the reconstructed image for visual secret sharing schemes. We developed an object detection method in the context of secret sharing, detecting outstanding local features and global object contour. The quality metric is constructed based on the object detection-weight map. The effectiveness of the proposed quality metric is demonstrated by a series of experiments. The experimental results show that our quality metric based on secret object detection outperforms existing metrics. Furthermore, it is straightforward to implement and can be applied to various applications such as performing the security test of the visual secret sharing process
Development of Visual Cryptography Technique for Authentication Using Facial Images
Security in the real world is an important issue to be taken care and to be encountered with various aspects and preventive measures. In the present era, whole major security concerns is the protection of this multimedia web is coming closer from text data to multimedia data, one of the data. Image, which covers the highest percentage of the multimedia data, its protection is very important. These might include Military Secrets, Commercial Secrets and Information of individuals. This can be achieved by visual Cryptography. It is one kind of image encryption. Incurrent technology, most of visual cryptography areembedded a secret using multiple shares. Visual is secret sharing technique used in visual cryptography which divides the secret image into multiple shares and by superimposing those shares the original secret image is going to be revealed, but it create a threat when an intruder get shares with which the image is going to be decrypted easily. However in these project work, an extremely useful bitwise operation is perform on every pixel with the help of key. The key is provided by new concept of sterilization algorithm. Initially Red, Green and Blue channels get separated from image and are going to be encrypted on multiple levels using multiple shares, convert an image into unreadable format and by combining all the shares in proper sequence the original secret image revealed
A Novel Latin Square Image Cipher
In this paper, we introduce a symmetric-key Latin square image cipher (LSIC)
for grayscale and color images. Our contributions to the image encryption
community include 1) we develop new Latin square image encryption primitives
including Latin Square Whitening, Latin Square S-box and Latin Square P-box ;
2) we provide a new way of integrating probabilistic encryption in image
encryption by embedding random noise in the least significant image bit-plane;
and 3) we construct LSIC with these Latin square image encryption primitives
all on one keyed Latin square in a new loom-like substitution-permutation
network. Consequently, the proposed LSIC achieve many desired properties of a
secure cipher including a large key space, high key sensitivities, uniformly
distributed ciphertext, excellent confusion and diffusion properties,
semantically secure, and robustness against channel noise. Theoretical analysis
show that the LSIC has good resistance to many attack models including
brute-force attacks, ciphertext-only attacks, known-plaintext attacks and
chosen-plaintext attacks. Experimental analysis under extensive simulation
results using the complete USC-SIPI Miscellaneous image dataset demonstrate
that LSIC outperforms or reach state of the art suggested by many peer
algorithms. All these analysis and results demonstrate that the LSIC is very
suitable for digital image encryption. Finally, we open source the LSIC MATLAB
code under webpage https://sites.google.com/site/tuftsyuewu/source-code.Comment: 26 pages, 17 figures, and 7 table
On Real-valued Visual Cryptographic Basis Matrices
Visual cryptography (VC) encodes an image into noise-like shares, which can be stacked to reveal a reduced quality version of the original. The problem with encrypting colour images is that they must undergo heavy pre-processing to reduce them to binary, entailing significant quality loss. This paper proposes VC that works directly on intermediate grayscale values per colour channel and demonstrates real-valued basis matrices for this purpose. The resulting stacked shares produce a clearer reconstruction than in binary VC, and to the best of the authors’ knowledge, is the first method posing no restrictions on colour values
while maintaining the ability to decrypt with human vision. Grayscale and colour images of differing entropies are encrypted using fuzzy OR and XOR, and their PSNR and structural similarities are compared with binary VC to demonstrate improved quality. It is compared with previous research and its advantages highlighted, notably in high quality reconstructions with minimal processing
A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
Cellular automata (CAs) are dynamical systems which exhibit complex global
behavior from simple local interaction and computation. Since the inception of
cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention
of several researchers over various backgrounds and fields for modelling
different physical, natural as well as real-life phenomena. Classically, CAs
are uniform. However, non-uniformity has also been introduced in update
pattern, lattice structure, neighborhood dependency and local rule. In this
survey, we tour to the various types of CAs introduced till date, the different
characterization tools, the global behaviors of CAs, like universality,
reversibility, dynamics etc. Special attention is given to non-uniformity in
CAs and especially to non-uniform elementary CAs, which have been very useful
in solving several real-life problems.Comment: 43 pages; Under review in Natural Computin
Pseudorandom sequence generation using binary cellular automata
Tezin basılısı İstanbul Şehir Üniversitesi Kütüphanesi'ndedir.Random numbers are an integral part of many applications from computer simulations,
gaming, security protocols to the practices of applied mathematics and physics. As
randomness plays more critical roles, cheap and fast generation methods are becoming a
point of interest for both scientific and technological use.
Cellular Automata (CA) is a class of functions which attracts attention mostly due to the
potential it holds in modeling complex phenomena in nature along with its discreteness
and simplicity. Several studies are available in the literature expressing its potentiality
for generating randomness and presenting its advantages over commonly used random
number generators.
Most of the researches in the CA field focus on one-dimensional 3-input CA rules. In
this study, we perform an exhaustive search over the set of 5-input CA to find out the
rules with high randomness quality. As the measure of quality, the outcomes of NIST
Statistical Test Suite are used.
Since the set of 5-input CA rules is very large (including more than 4.2 billions of rules),
they are eliminated by discarding poor-quality rules before testing.
In the literature, generally entropy is used as the elimination criterion, but we preferred
mutual information. The main motive behind that choice is to find out a metric for
elimination which is directly computed on the truth table of the CA rule instead of the
generated sequence. As the test results collected on 3- and 4-input CA indicate, all rules
with very good statistical performance have zero mutual information. By exploiting this
observation, we limit the set to be tested to the rules with zero mutual information. The
reasons and consequences of this choice are discussed.
In total, more than 248 millions of rules are tested. Among them, 120 rules show out-
standing performance with all attempted neighborhood schemes. Along with these tests,
one of them is subjected to a more detailed testing and test results are included.
Keywords: Cellular Automata, Pseudorandom Number Generators, Randomness TestsContents
Declaration of Authorship ii
Abstract iii
Öz iv
Acknowledgments v
List of Figures ix
List of Tables x
1 Introduction 1
2 Random Number Sequences 4
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2.2 Theoretical Approaches to Randomness . . . . . . . . . . . . . . . . . . . 5
2.2.1 Information Theory . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.2.2 Complexity Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.2.3 Computability Theory . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.3 Random Number Generator Classification . . . . . . . . . . . . . . . . . . 7
2.3.1 Physical TRNGs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2.3.2 Non-Physical TRNGs . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.3.3 Pseudorandom Number Generators . . . . . . . . . . . . . . . . . . 10
2.3.3.1 Generic Design of Pseudorandom Number Generators . . 10
2.3.3.2 Cryptographically Secure Pseudorandom Number Gener- ators . . . . . . . . . . . . . .11
2.3.4 Hybrid Random Number Generators . . . . . . . . . . . . . . . . . 13
2.4 A Comparison between True and Pseudo RNGs . . . . . . . . . . . . . . . 14
2.5 General Requirements on Random Number Sequences . . . . . . . . . . . 14
2.6 Evaluation Criteria of PRNGs . . . . . . . . . . . . . . . . . . . . . . . . . 16
2.7 Statistical Test Suites . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
2.8 NIST Test Suite . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
2.8.1 Hypothetical Testing . . . . . . . . . . . . . . . . . . . . . . . . . . 18
2.8.2 Tests in NIST Test Suite . . . . . . . . . . . . . . . . . . . . . . . . 20
2.8.2.1 Frequency Test . . . . . . . . . . . . . . . . . . . . . . . . 20
2.8.2.2 Block Frequency Test . . . . . . . . . . . . . . . . . . . . 20
2.8.2.3 Runs Test . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
2.8.2.4 Longest Run of Ones in a Block . . . . . . . . . . . . . . 21
2.8.2.5 Binary Matrix Rank Test . . . . . . . . . . . . . . . . . . 21
2.8.2.6 Spectral Test . . . . . . . . . . . . . . . . . . . . . . . . . 22
2.8.2.7 Non-overlapping Template Matching Test . . . . . . . . . 22
2.8.2.8 Overlapping Template Matching Test . . . . . . . . . . . 22
2.8.2.9 Universal Statistical Test . . . . . . . . . . . . . . . . . . 23
2.8.2.10 Linear Complexity Test . . . . . . . . . . . . . . . . . . . 23
2.8.2.11 Serial Test . . . . . . . . . . . . . . . . . . . . . . . . . . 24
2.8.2.12 Approximate Entropy Test . . . . . . . . . . . . . . . . . 24
2.8.2.13 Cumulative Sums Test . . . . . . . . . . . . . . . . . . . . 24
2.8.2.14 Random Excursions Test . . . . . . . . . . . . . . . . . . 24
2.8.2.15 Random Excursions Variant Test . . . . . . . . . . . . . . 25
3 Cellular Automata 26 3.1 History of Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . .26
3.1.1 von Neumann’s Work . . . . . . . . . . . . . . . . . . . . . . . . . 27
3.1.2 Conway’s Life . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
3.1.3 Wolfram’s Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
3.2 Cellular Automata and the Definitive Parameters . . . . . . . . . . . . . . 31
3.2.1 Lattice Geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
3.2.2 Cell Content . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
3.2.3 Guiding Rule . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
3.2.4 Neighborhood Scheme . . . . . . . . . . . . . . . . . . . . . . . . . 36
3.3 A Formal Definition of Cellular Automata . . . . . . . . . . . . . . . . . . 37
3.4 Elementary Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
3.5 Rule Families . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
3.6 Producing Randomness via Cellular Automata . . . . . . . . . . . . . . . 42
3.6.1 CA-Based PRNGs . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
3.6.2 Balancedness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
3.6.3 Mutual Information . . . . . . . . . . . . . . . . . . . . . . . . . . 44
3.6.4 Entropy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
4 Test Results 47 4.1 Output of a Statistical Test . . . . . . . . . . . . . . . . . . . . . . . . . . 48
4.2 Testing Strategy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
4.3 Interpretation of the Test Results . . . . . . . . . . . . . . . . . . . . . . . 49
4.3.1 Rate of success over all trials . . . . . . . . . . . . . . . . . . . . . 49
4.3.2 Distribution of P-values . . . . . . . . . . . . . . . . . . . . . . . . 50
4.4 Testing over a big space of functions . . . . . . . . . . . . . . . . . . . . . 50
4.5 Our Procedure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
4.6 Results and Observations . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
4.6.1 Change in State Width . . . . . . . . . . . . . . . . . . . . . . . . 53
4.6.2 Change in Neighborhood Scheme . . . . . . . . . . . . . . . . . . . 53
4.6.3 Entropy vs. Statistical Quality . . . . . . . . . . . . . . . . . . . . 58
4.6.4 Mutual Information vs. Statistical Quality . . . . . . . . . . . . . . 60
4.6.5 Entropy vs. Mutual Information . . . . . . . . . . . . . . . . . . . 62
4.6.6 Overall Test Results of 4- and 5-input CA . . . . . . . . . . . . . . 6
4.7 The simplest rule: 1435932310 . . . . . . . . . . . . . . . . . . . . . . . . . 68
5 Conclusion 74
A Test Results for Rule 30 and Rule 45 77
B 120 Rules with their Shortest Boolean Formulae 80
Bibliograph
Recommended from our members
On Building Generalizable Learning Agents
It has been a long-standing goal in Artificial Intelligence (AI) to build machines that can solve tasks that humans can. Thanks to the recent rapid progress in data-driven methods, which train agents to solve tasks by learning from massive training data, there have been many successes in applying such learning approaches to handle and even solve a number of extremely challenging tasks, including image classification, language generation, robotics control, and several multi-player games. The key factor for all these data-driven successes is that the trained agents can generalize to test scenarios that are unseen during training. This generalization capability is the foundation for building any practical AI system. This thesis studies generalization, the fundamental challenge in AI, and proposes solutions to improve the generalization performances of learning agents in a variety of problems. We start by providing a formal formulation of the generalization problem in the context of reinforcement learning and proposing 4 principles within this formulation to guide the design of training techniques for improved generalization. We validate the effectiveness of our proposed principles by considering 4 different domains, from simple to complex, and developing domain-specific techniques following these principles. Particularly, we begin with the simplest domain, i.e., path-finding on graphs (Part I), and then consider visual navigation in a 3D world (Part II) and competition in complex multi-agent games (Part III), and lastly tackle some natural language processing tasks (Part IV). Empirical evidences demonstrate that the proposed principles can generally lead to much improved generalization performances in a wide range of problems
- …