In a (t, n) secret sharing scheme (SS), the secret is shared among n shareholders in such a way that (a) with t or more than t shares can recover the secret, and (b) with fewer than t shares cannot obtain the secret. The threshold signature scheme is an application that extends the SS to a digital signature scheme. In a threshold signature scheme, any t or more than t group members can represen...

One of the key points of success in high performance computation using an FPGA is the efficient usage of DSP slices and block RAMs in it. This paper presents a FDFM (Few DSP slices and Few block RAMs) processor core approach for implementing RSA encryption. In our approach, an efficient hardware algorithm for Chinese Remainder Theorem (CRT) based RSA decryption using Montgomery multiplication a...

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

* This work is supported by NSFC under grant No. 41001282. Abstract A fast multi-baseline Interferometric synthetic aperture radar (InSAR) phase ambiguity resolving method is presented. The ambiguity solution vector of the shortest baseline is first computed and used as a reference, and then the ambiguity solutions of all the other baselines are selected with logical judgment of phase differenc...

Data is generated over time by each device in the Internet of Things (IoT) ecosphere. Recent years have seen a resurgence interest IoT due to its positive impact on society. However, automatic management devices, possibility disclosing sensitive information without user consent high. A situation which should not be unintentionally disclosed outside parties we do trust, i.e., privacy-preservatio...

In this paper, a novel 3-moduli set { 2 − 1, 2, 2 − 1 } , which has larger dynamic range when compared to other existing 3-moduli sets is proposed. After providing a proof that this moduli set always results in legitimate RNS, we subsequently propose an associated reverse converter based on the New Chinese Remainder Theorem. The proposed reverse converter has a delay of (4n + 6)tFA with an area...

In this article, we formalize that every finite cyclic group is isomorphic to a direct product of finite cyclic groups which orders are relative prime. This theorem is closely related to the Chinese Remainder theorem ([18]) and is a useful lemma to prove the basis theorem for finite abelian groups and the fundamental theorem of finite abelian groups. Moreover, we formalize some facts about the ...

We show that multiplication complexities of n-term Karatsuba-Like formulae of GF (2)[x] (7 < n < 19) presented in the above paper can be further improved using the Chinese Remainder Theorem and the construction multiplication modulo (x−∞).