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...

In the spirit of mathematical knowledge management theorems are proven with computer assistance to be included into mathematical repositories. In the mathematical literature one often finds not only different proofs for theorems, but also different versions or generalizations with a different background. In mathematical repositories, for obvious reasons, there is usually one version of a theore...

The conference-key agreement protocol is a mechanism for generating a common session key among the authorized conference members. The common session key is used to encrypt communication messages transmitted over an open network. Inspired by traditional key agreement protocols and threshold cryptosystems, we have proposed a novel threshold conference-key agreement protocol in this paper. In the ...

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...

This article considers the problem of how to prevent the fast RSA signature and decryption computation with residue number system (or called the CRT-based approach) speedup from a hardware fault cryptanalysis in a highly reliable and efficient approach. The CRT-based speedup for RSA signature has been widely adopted as an implementation standard ranging from large servers to very tiny smart IC ...

A group key distribution scheme based on static key tree structure and the Chinese Remainder Theorem (KTCRT-GKD) is proposed. It deal with the scenario of a pre-defined static prospective user set U containing all potential customs of multicast services and concentrate on the stateless receiver case. Given a privileged group member set G U ⊆ consisting of authorized users in a multicast session...

Secure group communication with hierarchical access control refers to a scenario where a group of members is divided into a number of subgroups located at different privilege levels and a high-level subgroup can receive and decrypt messages within any of its descendant lower-level subgroups; but the converse is not allowed. In this paper, we propose a new scheme CRTHACS, which is based on the C...

This paper presents the design and implementation of a systolic RSA cryptosystem based on a modified Montgomery’s algorithm and the Chinese Remainder Theorem (CRT) technique. The CRT technique improves the throughput rate up to 4 times in the best case. The processing unit of the systolic array has 100% utilization because of the proposed block interleaving technique for multiplication and squa...

Secure broadcasting is an essential feature for critical operations in wireless sensor network (WSNs). However, due to the limited resources of sensor networks, verifying the authenticity for broadcasted messages is a very difficult issue. μTESLA is a broadcast authentication protocol, which uses network-wide loose time synchronization with one-way hashed keys to provide the authenticity verifi...