This paper analyzes the numerically instable problem in the current 3D fragile watermarking schemes. Some existing fragile watermarking schemes apply the floating-point arithmetic to embed the watermarks. However, these schemes fail to work properly due to the numerically instable problem, which is common in the floating-point arithmetic. This paper proposes a numerically stable fragile waterma...

The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significant progress was made in proving that such abstractions can be sound with respect to actual cryptographic realizations and security definitions. The strongest results show this in the sense of reactive simulatab...

A straightforward way of constructing an n-bit pseudorandom function is to XOR two or more pseudorandom permutations: p1 ⊕ . . .⊕pk. This XOR construction has gained broad attention over the last two decades. In this work, we revisit the security of this well-established construction. We consider the case where the underlying permutations are considered secret, as well as the case where these p...

We present two new classes of 2-level AND/XOR expressions: the class RKRO of Reduced Kronecker Expressions and the class GKRO of Generalized Kronecker Expressions. GKRO contains RKRO and KRO, the well-known class of Kronecker Expressions Sas93b] as a subclass. There is a close relation between RKROs, KROs, GKROs and Ordered Kro-necker Functional Decision Diagrams (OKFDDs) DST + 94], that togeth...

We call F : {0, 1}n×{0, 1}n → {0, 1} a symmetric XOR function if for a function S : {0, 1, ..., n} → {0, 1}, F (x, y) = S(|x⊕ y|), for any x, y ∈ {0, 1}n, where |x⊕ y| is the Hamming weight of the bit-wise XOR of x and y. We show that for any such function, (a) the deterministic communication complexity is always Θ(n) except for four simple functions that have a constant complexity, and (b) up ...

We propose a quantitative x-ray phase imaging technique using previously demonstrated XOR objectives. The fabrication process of XOR is identical to that of a Fresnel zone-plate and as a result the same finest outermost zone width, thus spatial resolution, can be achieved. A series of phase shifts from 0 to 2p is implemented by shifting the relative position of the grating with respect to the z...

A new side channel attack against a simple LFSR is presented. The proposed attack targets a single Galois LFSR running on an embedded device where the only accessible information is the side channel leakage. Even if it is made only of simple XOR gates, such an object is vulnerable to side channel cryptanalysis depending on its implementation. Our attack combines simple side channel analysis and...

Recently, the exclusive-or computation capability was added on high performance disks to provide an alternative way of implementing RAID (Redundant Arrays of Independent Disks). This alternative approach reduces the traffic on the storage channel and eliminates the XOR computation load on the host or RAID controllers. Therefore, it may be a better approach than the traditional RAID design to im...

Ciphers y = C(x, k) and  = (, ) are isomorphic if there exists invertible computable in both directions map y ↔ , x ↔ , k ↔ . Cipher is vulnerable if and only if isomorphic cipher is vulnerable. Instead of computing the key of a cipher it is sufficient to find suitable isomorphic cipher and compute its key. If φ is arbitrary substitution and T is round substitution, its conjugate  = φTφ...

Electromagnetic interference (EMI), once the exclusive concern of equipment designers working with high-speed signals, is no longer limited to a narrow class of high-end applications. Continued innovation in semiconductor technology has resulted in the ready availability of cost-effective, high-performance system-on-chip (SoC) devices, microcontrollers (MCUs), processors, digital signal process...