Abstract The three-modulus residue number system (RNS) based on the moduli set {2, 2–1, 2–1} has been recently introduced. The modulo (2+1)-free feature of this set enables it to provide fast realization of modular addition and multiplication circuits of RNS arithmetic unit. But, the latest design of the RNS to binary (reverse) converter for the moduli set {2, 2–1, 2–1} relies on large hardware...

We present algorithms which, given a genus 2 curve C defined over a finite field and a quartic CM field K, determine whether the endomorphism ring of the Jacobian J of C is the full ring of integers in K. In particular, we present probabilistic algorithms for computing the field of definition of, and the action of Frobenius on, the subgroups J [l] for prime powers l. We use these algorithms to ...

Secure communication has become more and more important for system security. Since avoiding the use of encryption one by one can introduce less computation complexity, secret sharing scheme (SSS) has been used to design many security protocols. In SSSs, several authors have studied multipartite access structures, in which the set of participants is divided into several parts and all participant...

Decoding in Residue Number System (RNS) based architectures can be a bottleneck. A high speed and flexible modulo decoder is an essential computational element to maintain the advantages of RNS. In this paper, a fast and flexible modulo decoder, based on the Chinese Remainder Theorem (CRT), is presented. I t decodes a set of residues into its equivalent representation in either unsigned magnitu...

In a previous paper a novel forwarding scheme for wireless sensor networks has been proposed by the same authors [3]. The authors showed that the proposed technique, mainly based on the Chinese Remainder Theorem (CRT), outperformed more traditional approaches in terms of both energy efficiency and fair distribution of energy consumption. Furthermore, only few changes to the commonly used forwar...

A new algebraic approach to quasi-cyclic codes is introduced. The key idea is to regard a quasi-cyclic code over a field as a linear code over an auxiliary ring. By the use of the Chinese Remainder Theorem (CRT), or of the Discrete Fourier Transform (DFT), that ring can be decomposed into a direct product of fields. That ring decomposition in turn yields a code construction from codes of lower ...

Wireless ad hoc networks are very popular in many areas such as border area protection, rescue operations etc. These networks suffer security problems due to their infrastructure less architecture. Attacks like passive eavesdropping, impersonation, replay etc. can be easily performed in such networks. Also the devices used in such networks are mostly resource constrained devices. Hence highly s...

Power consumption limits the application of public key cryptosystem in portable devices. This paper proposes a low power design of 1,024-bit RSA. In algorithm, the Chinese Remainder Theorem (CRT) and an improved Montgomery algorithm are selected to decrease the computation of RSA. In architecture and circuit, the operand isolation technique is applied to avoid unnecessary flip-flops of the comb...

A closed-form algorithm, named “concerto”, is proposed for phase-based distance estimation in multi-frequency phase unwrapping (MFPU) system. The concerto method consists of three coherent estimation stages,i.e., initial modified BW estimation, residual error estimation and LS estimation , each of which has a closed-form expression and cooperates closely with each other like a concerto. Due to ...

Data hiding is an efficient technique that conceals secret data into a digital medium. In 2006, Zhang and Wang proposed a data hiding scheme called exploiting modification direction (EMD) which has become a milestone in the field of data hiding. In recent years, many EMD-type data hiding schemes have been developed, but their embedding capacity remains restricted. In this paper, a novel data hi...