We present the theoretical result, which is based on the linear algebra theory (similar operators). The obtained theoretical results optimize the experimental technique to construct quantum computer e.g., reduces the number of steps to perform the logical CNOT (XOR) operation. The present theoretical technique can also be generalized to the other operators in in quantum computation and informat...

We present two new theorems to analyze the indistinguishability of the composition of cryptographic permutations and the indistinguishability of the XOR of cryptographic functions. Using the H Coefficients technique of [Pat01], for any two families of permutations F and G with CCA distinghuishability advantage ≤ αF and ≤ αG, we prove that the set of permutations f ◦ g, f ∈ F, g ∈ G has CCA dist...

Hardware-Software co-simulation of a multiple image encryption technique shall be described in this paper. Our proposed multiple image encryption technique is based on the Latin Square Image Cipher (LSIC). First, a carrier image that is based on the Latin Square is generated by using 256-bits of length key. The XOR operation is applied between an input image and the Latin Square Image to genera...

Unification algorithms are central components in constraint solving procedures for security protocol analysis. For the analysis of security protocols with XOR a unification algorithm for an equational theory including ACUN is required. While such an algorithm can easily be obtained using general combination methods such methods do not yield practical unification algorithms. In this work, we pre...

This paper presents a design method for AND-OR-EXOR three-level networks, where a single two-input exclusive-OR (EXOR) gate is used. The network realizes an EXOR of two sum-of-products expressions (EX-SOPs). The problem is to minimize the total number of products in the two sum-of-products expressions (SOPs). We introduce the notion of μ-equivalence of logic functions to develop exact minimizat...

A two-player one-round binary game consists of two cooperative players who each one replies by one bit to a message that receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is called entangled if the players are allowed to share a priori entanglement. It is well-known that the maximum winning probability (the value) of entangled XOR-ga...

To reduce the feedbacks between access point and all nodes in lossy wireless networks, a clustered system model consisting of a cluster head and multiple common nodes is investigated. Network coding has been proposed for more efficient retransmissions in reliable multicast. However, in existing schemes the access point retransmits coded packets, which causes severe delay and considerable feedba...

We study the Log-rank Conjecture for XOR functions and the Sensitivity Conjecture by exploiting structure of the Fourier transform and polynomial representations of Boolean functions. For the Log-rank Conjecture for XOR functions, we show that the it is true for functions with small spectral norm or low F2-degree. More precisely, we prove the following two bounds. 1. CC(f(x⊕ y)) = O(‖f̂‖1 · log ...

Consider a decision problem that cannot be 1 ? approximated by circuits of a given size in the sense that any such circuit fails to give the correct answer on at least a fraction of instances. We show that for any such problem there is a speciic \hard-core" set of inputs which is at least a fraction of all inputs and on which no circuit of a slightly smaller size can get even a small advantage ...

We construct logical gates via topology optimisation (aimed to solve a station problem of heat conduction) of a conductive material layout. Values of logical variables are represented high and low values of a temperature at given sites. Logical functions are implemented via the formation of an optimum layout of conductive material between the sites with loading conditions. We implement and and ...