Compared with Shamir’s original secret image sharing (SIS), the Chinese-remainder-theorem-based SIS (CRTSIS) generally has advantages of a lower computation complexity, lossless recovery and no auxiliary encryption. However, general CRTSIS is neither perfect nor ideal, resulting in narrower range share pixels than that pixels. In this paper, we propose practical based on Asmuth Bloom’s threshol...

Abstract: This paper presents a DCT-based (DCT: discrete cosine transform) listless set partitioning in hierarchical trees (SPIHT) digital watermarking technique that is robust against several common attacks such as cropping, filtering, sharpening, noise, inversion, contrast manipulation, and compression. The proposed technique is made further robust by the incorporation of the Chinese remainde...

In digital systems, the Residue Number System (RNS) represents an interesting alternative to traditional two’s complement representation. Its performance and low-power properties have attracted significant research interest over years. this paper, RNS is used estimate angular position of a multi-trace electrical encoder (EE), electro-mechanical device measure angles at high precision widely use...

Abstract Big data becomes the key for ubiquitous computing and intelligence, Distributed Storage Systems (DSS) are widely used in large-scale centers or cloud efficient management. However, on stored likely to be unavailable due hardware failures cyberattacks, e.g. DDoS. Maximum Distance Separable (MDS) codes commonly recovery of faulty storage nodes data. usually involves access multiple nodes...

Based on unique decoding of the polynomial residue code with non-pairwise coprime moduli, a polynomial with degree less than that of the least common multiple (lcm) of all the moduli can be accurately reconstructed when the number of residue errors is less than half the minimum distance of the code. However, once the number of residue errors is beyond half the minimum distance of the code, the ...

Elliptic curves with a known number of points over a given prime field Fn are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication to construct such curves. One of the steps in this method is the calculation of a root modulo n of the Hilbert class polynomial HD(X) for a fundamental discriminant D. T...

We present a new algorithm to compute the classical modular polynomial Φl in the rings Z[X,Y ] and (Z/mZ)[X, Y ], for a prime l and any positive integer m. Our approach uses the graph of l-isogenies to efficiently compute Φl mod p for many primes p of a suitable form, and then applies the Chinese Remainder Theorem (CRT). Under the Generalized Riemann Hypothesis (GRH), we achieve an expected run...