The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In a user hierarchy, a user belongs to higher-privileged class will have access right to message owned by user in a lower-privileged class; while the opposite in not allowed. Many schemes based on cryptography have been proposed to solve this problem. However, previous schemes need large values associated with each security class. Considering the solution of dynamic access problem in a hierarchy,...
In this paper, we propose a joint digital watermarking protocol for the multiparty multilevel DRM architecture using Garner's algorithm for the Chinese remainder theorem (CRT). Our protocol exploits the incremental nature of the computation of CRT by the Garner's algorithm. The proposed joint watermarking protocol embeds a single watermark signal into the content while taking care of the various security...
In this paper we propose a flexible 4-moduli set (2p+k, 2p+1, 2p-1, 22p+1) which is profitable to construct a high-speed residue number system (RNS). We derive a simple reverse conversion algorithm for the proposed moduli set by using Chinese remainder theorem (CRT). The resulting converter architecture mainly consists of simple adders which are suitable to realize an efficient VLSI implementation...
A threshold multi-secret sharing scheme against cheating among weighted participants of special access right based on Chinese remainder theorem and LUC cryptosystem is introduced , it permits that multiple secrets be shared in one secret sharing session. The sub-secret of every participant can be used many times, and the secrets can be renewed without renewing the sub-secrets of the participants....
Radio frequency identification (RFID) is a rapidly developing wireless communication technology for electronically identifying, locating, and tracking products, assets, and personnel. RFID has become one of the primarily means to construct a real-time locating system (RTLS) that tracks and identifies the location of objects in real time using simple, inexpensive tags attached to or embedded in objects...
Considering three important properties of software watermarks, resilience, stealth and data rate, a new static watermarking scheme based on Chinese Remainder Theorem is proposed. The idea of secret sharing is introduced to the watermark division and retrieval, and the watermark retrieval based on the partial values has great robust. The watermark coding realized by the control-flow diagram assigning...
Frequency-hopping sequences (FHSs) are used to specify which frequency will be used for transmission at any given time, their properties play important roles in FHMA systems. In this correspondence, new families of FHSs are constructed by using Chinese reminder theorem and C.Ding etal.psilas results. The constructed FHSs family is proved to be optimal and each sequence of the family is proved to be...
In high pulse repetition frequency (PRF) radars ambiguities may arise in range measurements. In this paper we describe and compare two algorithms which can be used even when ambiguous returns from several targets are received. The analyzed algorithms are a modified version of the Clustering Algorithm (CA) and a modified version of the Chinese Remainder Theorem (CRT). The performances of both algorithms...
This paper proposes a scheme to provide Security to Dynamic Multicast VoIP systems efficiently. Security is usually provided by encrypting the media packets sent from a user to other users with the help of a shared key called the Session Encryption Key (SEK). The most time consuming process in a dynamic multicast VoIP environment is the Group Key Management. Whenever there is a change in the group...
The purpose of the group key management is to provide a secure key sharing scheme among the users in a group on a broadcast or a multicast environment. CRGK[1] is the centralized group key management scheme based on the Chinese remainder theorem (CRT). It optimizes the number of rekey message, user-side key computation, and number of key storage. However, CRGK is suited for a small size user group...
This paper proposes a scheme to provide security to dynamic multicast VoIP systems efficiently. Security is usually provided by encrypting the media packets sent from a user to other users with the help of a shared key called the session encryption key (SEK). The most time consuming process in a dynamic multicast VoIP environment is the group key management. Whenever there is a change in the group...
This paper proposes new product-sum type public-key cryptosystems using the Chinese remainder theorem as the trapdoor. The security of the proposed schemes is based on the difficulty of finding a specific solution of the linear Diophantine equation. The proposed schemes are invulnerable to the low-density attack because they can realize the sufficiently high density for a practical parameter.
We extend the sharing scheme proposed by Mignotte in 1983 based upon Chinese remainder theorem (CRT) to devise a threshold secret sharing scheme for digital images. Given a secret image I and a set of n participants sharing I, our scheme encrypts I into n shadows in such a way that any group of r shadows can recover I while that of less than r shadows cannot where 2 les r les n. As compared to the...
Residue number system (RNS), which originates from the Chinese remainder theorem, is regarded as a promising number representation in the domain of digital signal processing (DSP). This paper describes our work on optimizing residue arithmetic units on the platform of reconfigurable devices, such as FPGAs. First, we provide improved designs for residue arithmetic units. For reverse converters from...
The moduli set M1=(2n,2n+1-1,2n-1) which is free of 2a+1 modulus is profitable to construct a high-speed residue number system (RNS). In this paper, we derive a reduced-complexity residue-to-binary conversion algorithm for M1 by using new Chinese remainder theorem (CRT). The resulting converter architecture mainly consists of carry-save adders (CSAs), modular adders and multiplexer (MUX) which is...
Two new RNS to Binary converters for the moduli set {2k, 2k-1, 2k-1-1} are presented. These proposed converters, one based on Chinese Remainder theorem and another based on Mixed radix Conversion are evaluated regarding hardware requirement and conversion delay and compared with other residue to binary converters proposed in literature for this moduli set as well as the moduli sets {2n-1, 2n, 2n+1}...
The advent of the Internet and the wide availability of computers, scanners, and printers make digital data acquisition, exchange, and transmission as simple tasks. However, making digital data accessible to others through networks also creates opportunities for malicious parties to make salable copies of copyrighted content without permission of the content owner. Digital watermarking techniques...
In this paper, we investigate residue number system (RNS) to decimal conversion for a three moduli set with a common factor. We propose a new RNS to binary converter for the moduli set {2n + 2, 2n + 1, 2n} for any even integer n > 0. First, we demonstrate that for such a moduli set, the computation of the multiplicative inverses can be eliminated. Secondly, we simplify the Chinese Remainder Theorem...
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n 1+o(1) log1+o(1) q bit operations; this had earlier been achieved in characteristic no(1) by Umans (2008). As an application, we obtain a randomized algorithm for factoring degree n polynomials over Fq requiring (n1.5+o(1) + n 1+o(1) log q) log1+o(1) q bit operations, improving...
Many emerging network applications are based upon group communication models and are implemented with multicast communications. We address the problem of distributing a secret session key to a secure multicast group. In a pair of such key management schemes, the session key is distributed mathematically based upon the Euler-Fermat theorem, such that upon receiving the broadcast keying material known...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.