نتایج جستجو برای: chinese remainder theorem crt
تعداد نتایج: 301262 فیلتر نتایج به سال:
In 2014, Smart and Vercauteren introduced a packing technique for homomorphic encryption schemes by decomposing the plaintext space using the Chinese Remainder Theorem. This technique allows to encrypt multiple data values simultaneously into one ciphertext and execute Single Instruction Multiple Data operations homomorphically. In this paper we improve and generalize their results by introduci...
The scrambling scheme is a part of the conditional access system (CAS) that is used to prevent unauthorized access to Pay-TV systems. In this paper, we propose a new scrambling scheme and key distribution scheme. The scrambling scheme is used in conjunction with ordinary encryption techniques, for protecting the digital video streams from unauthorized viewing. A hash function and a pseudo-rando...
In this paper, an efficient residue to binary converter design for the new high dynamic range moduli set {2-1,2+1,2,2+1,2-1} is presented. The reverse conversion in the four-moduli set {2, 2+1, 2+1, 2-1} has been proposed in literature. Hence, the converters are based on the new moduli set {2-1, (2-1)(2+1)(2+1)2} and propose its residue to binary converter using New Chinese Remainder Theorem 2 ...
A unique decoder for the Chinese remainder codes was stated in [1] in 2000. In this paper, we present a decoder which gives the same error correction radius by introducing syndromes of the Chinese remainder codes. The error positions can be found using a so–called error–locator integer Λ which appears in the proposed key equation. To find Λ, this key equation can be solved by the extended Eucli...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید