Chinese Remainder Theorem and Prime Powers
Efficient RSA Cryptosystem Decryption Based on Chinese Remainder Theorem and Strong Prime
... The prime application of it’s is in the RSA ...on Chinese Remainder Theorem and Strong ...method, Chinese Remainder Theorem method and Chinese Remainder ...
5
Threshold cryptography with Chinese remainder theorem
... of a polynomial of degree t − 1, and distributed the points on the polynomial to the group of users. Thus, a coalition of size t can recover the polynomial and reveal the key but a smaller coalition can not. This scheme ...
106
Chinese remainder theorem and its applications
... This example is considered the very first application of the Chinese Remainder Theorem ([DPS96]. This kind of computation was also used in building a wall or the base of a house such as the ...
41
Sharing DSS by the Chinese Remainder Theorem
... Abstract In this paper, we propose a new threshold scheme for the Digital Signature Standard (DSS) using Asmuth-Bloom secret sharing based on the Chinese Re- mainder Theorem (CRT). To achieve the desired ...
17
Chinese Remainder Theorem in Cryptography a Brief Overview Of
... The RSA algorithm is an algorithm for public-key cryptography named after Ron Rivest, Adi Shamir and Len Adleman, who invented it in 1977. The RSA algorithm can be used for both public key encryption and digital ...
11
Compartmented Secret Sharing Based on the Chinese Remainder Theorem
... Moreover, using threshold secret sharing schemes based on the Chinese remainder theorem can lead to further improvements. A compromise between the size of the shares and the level of security must be ...
9
Compartmented Threshold RSA Based on the Chinese Remainder Theorem
... The correctness and the security of this scheme can be easily proven (see [12]). The threshold secret sharing schemes based on the Chinese remainder theorem can be used in order to decrease the size ...
6
Computing Hilbert class polynomials with the Chinese Remainder Theorem
... Let p be a prime in P D . Our plan is to compute H D mod p by determining its roots and forming the product of the corresponding linear factors. By Proposition 1, we can obtain the roots by enumerating the set Ell ...
37
General Secret Sharing Based on the Chinese Remainder Theorem
... 6 Conclusions We have extended the threshold secret schemes based on the Chinese remainder theorem in order to address more general access structures. We have also shown that some access structures ...
15
Secret Sharing Extensions based on the Chinese Remainder Theorem
... 0 and the perfectness of the scheme is preserved. Aside from the shares, the only other information the adversary can observe are the commitments and range-proofs. Given that the discrete logarithm problem is hard and ...
27
Quantum Group Signature Scheme Based on Chinese Remainder Theorem
... on Chinese Remainder Theorem Xin Sun 1 , Ying Guo 1 , Jinjing Shi 1 , Wei Zhang 1 , Qin Xiao 1 , Moon Ho Lee 2 1 School of Information Science & Engineering, Central South University, Changsha, ...
5
Knapsack Public-Key Cryptosystem Using Chinese Remainder Theorem
... Takeshi NASAKO † [email protected] Abstract. The realization of the quantum computer will enable to break public- key cryptosystems based on factoring problem and discrete logarithm problem. It is considered that even ...
12
Multicast Authentication Framework for Hierarchical Networks using Chinese Remainder Theorem
... on Chinese remainder ...uses Chinese remainder theorem to authenticate the message as well as provide a secure lock over the message so that it can be accessed only by the valid members ...
7
Enhanced Chinese Remainder Theorem based Broadcast Authentication in Wireless Networks
... Many routing activities and network management activities needed in wireless networks must rely on broadcast authentication mechanisms to ensure that data is being originated from a valid source. Without an efficient ...
5
Constructing Ideal Secret Sharing Schemes based on Chinese Remainder Theorem
... – Computing efficiency in certain cases: First, different from public key cryp- tosystems, where the private key related with the security level is usually large, the secret sharing schemes mentioned in this paper does ...
22
Reducing Computational Time of Principal Component Analysis with Chinese Remainder Theorem
... Madandola Tajudeen Niyi, Gbolagade Kazeem Alagbe. Reducing Computational Time of Principal Component Analysis with Chinese Remainder Theorem. International Journal of Discrete Mathematics. Vol. 4, ...
7
Rivest Shamir Adleman Encryption Scheme Based on the Chinese Remainder Theorem
... Abstract: Sensitive information is transmitted across the internet every day and keeping such information as sacred is an important adventure. This is because malicious activities are on the increase as hackers are doing ...
8
Performance Enhancement of Huffman Coding Image Compression with Chinese Remainder Theorem
... integrate Chinese Remainder Theorem (CRT) into the Huffman compression algorithm to enhance the speed of compression as against the Traditional Huffman Compression ...Algorithm, Chinese ...
6
General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
... nese remainder theorem in order to deal with more general access ...the Chinese remain- der theorem must be used for recovering the ...the Chinese remainder ...
18
A class of principal ideal rings arising from the converse of the Chinese remainder theorem
... Copyright © 2006 Hindawi Publishing Corporation. All rights reserved. 1. Introduction All rings considered in this note are nonzero, commutative, and unital. Our starting point is the following formulation of the ...
5