Amplitude estimation (AE) is a fundamental quantum algorithmic primitive that enables computers to achieve quadratic speedups for large class of statistical problems, including Monte Carlo methods. Recent works have succeeded in somewhat reducing the necessary resources AE by trading off some speedup lower depth circuits, but high quality qubits are still needed demonstrating such algorithms. H...

The Chinese Remainder Theorem (CRT) has numerous applications including in cryptography. In a striking example of this utility, we demonstrate how the CRT facilitates making one additive homomorphic encryption scheme viable and making another more flexible. First we show that the CRT may be used to turn an intractable problem into a tractable one. Specifically, using the CRT to replace a single...

We propose different approaches of PDF files based steganography, essentially based on the Chinese Remainder Theorem. Here, after a cover PDF document has been released from unnecessary characters of ASCII code A0, a secret message is hidden in it using one of the proposed approaches, making it invisible to common PDF readers, and the file is then transmitted through a non-secure communication ...

Random linear network code has to sacrifice part of bandwidth to transfer the coding vectors, thus a head of size k log |T | is appended to each packet. We present a distributed random network coding approach based on the Chinese remainder theorem for general multicast networks. It uses a couple of modulus as the head, thus reduces the size of head to O(log k). This makes it more suitable for s...

Threshold secret sharing based on the Chinese remainder theorem has been considered by Mignotte [23] and Asmuth and Bloom [1]. In this paper we demonstrate that the Chinese remainder theorem can be used for realizing more general access structures, as the compartmented or the weighted threshold ones. We also prove that there exist some non-weighted threshold access structures whose realizations...

Electronic-commerce (e-commerce) has become a provider of distinctive services to individuals and companies due the speed flexibility transferring orders completing commercial deals across far different places. However, increasing attacks on penetrating transaction information or tampering with e-commerce requests, interest in protecting this hiding it from tamperers extremely important. In add...

Scaling is one of the complex operations in Residue Number System (RNS). This operation necessary for RNS-based implementations deep neural networks (DNNs) to prevent overflow. However, state-of-the-art RNS scalers special moduli sets consider 2k modulo as scaling factor, which results a high-precision output with high area and delay. Therefore, low-precision based on multi-moduli factors shoul...

In this paper, we present a new group key management protocol based on the Chinese Remainder Theorem (CRT), which is developed based on our previous paper [29]. By shifting more computing load onto the key server we optimized the number of re-key broadcast message, user-side key computation and number of key storages. Our protocol, Hierarchical Chinese Remaindering Group Key (HCRGK) Protocol, o...

Security can only be as strong as the weakest link. In this world of cryptography, it is now well established, that the weakest link lies in the implementation of cryptographic algorithms. This paper deals with RSA algorithm with and without Chinese Remainder Theorem. In practice, RSA public exponents are chosen to be small which makes encryption and signature verification reasonably fast. Priv...

Schemes of reversible data hiding in encrypted domain (RDH-ED) based on symmetric or public key encryption are mainly applied the scenarios end-to-end communication. To provide security guarantees for multi-party scenarios, a RDH-ED scheme secret image sharing Chinese remainder theorem (CRT) is presented. In application ( $t$ </inline-formul...