Efficient Timing and Frequency Offset Estimation Scheme for OFDM Systems

A new training symbol weighted by pseudo-noise(PN) sequence is designed and an efficient timing and fre-quency offset estimation scheme for orthogonal frequency division multiplexing(OFDM) systems is proposed. The timing synchronization is accomplished by using the piecewise symmetric conjugate of the primitive training symbol and the good autocorrelation of PN weighted factor. The frequency synchronization is finished by utilizing the training symbol whose PN weighted factor is removed after the timing synchronization. Compared with conventional schemes, the pro-posed scheme can achieve a smaller mean square error and provide a wider frequency acquisition range.

IDENTITY-BASED MULTISIGNATURE AND AGGREGATE SIGNATURE SCHEMES FROM M-TORSION GROUPS

An identity-based multisignature scheme and an identity-based aggregate signature scheme are proposed in this paper. They are both from m-torsion groups on super-singular elliptic curves or hyper-elliptic curves and based on the recently proposed identity-based signature scheme of Cha and Cheon. Due to the sound properties of m-torsion groups and the base scheme, it turns out that our schemes are very simple and efficient. Both schemes are proven to be secure against adaptive chosen message attack in the random oracle model under the normal security notions with the assumption that the Computational Diffie-Hellman problem is hard in the m-torsion groups.

A THRESHOLD BLIND SIGNATURE FROM WEIL PAIRING ON ELLIPTIC CURVES

The idea behind a (t, n) threshold blind signature is that a user can ask at least t out of n players of a group to cooperate to generate a signature for a message without revealing its content. This paper first presents a new blind signature scheme from Weil pairing on elliptic curves. Based on this scheme, a threshold blind signature scheme is proposed. It is efficient and has the security properties of robustness and unforgeability. In the proposed scheme, the group manger is introduced to take the role of distributing the group secret key to each player. However, he cannot forge the players to generate partial blind signatures (Each partial blind signature depends on not only the secret key of the player, but also a random number the player picks). Compared with a threshold signature with a trusted third party, its advantage is obvious; Compared with a threshold signature without a trusted third party, it is more simple and efficient.

Improvement of McCullagh-Barreto key agreement with KCI-security

McCullagh-Barreto key agreement protocol and its variant achieve perfect forward security and key generation center （KGC） forward security, but provide no resistance to key compromise impersonation attack （KCI attack）. In this paper, we give a formal treatment of key compromise impersonation （KCI） attack and define the security notion against it. Then an variant of McCullagh-Barreto protocol is presented with only one more Hash operation. The improved protocol preserves perfect forward security and KGC forward security, and furthermore is proved to be secure against KCI attack under k-Gap-BCAA1 assumption.

Despreader for Direct Sequence Spread Spectrum System and Its Performance Analysis

A new type of despreader for direct sequence spread spectrum signal is proposed. Compared with traditional despreaders, the new despreader does not contain hard decision ware or handle binary sequence any more, and the locally stored spread spectrum signals are pre-modulated baseband signals (such as Gaussian minimum shift keying (GMSK) signals), which are much more similar to the received spread spectrum signals. Moreover, the missed detection probability of the despreader is about one order of magnitude lower than that of traditional ones. Based on the maximum likelihood criterion and phase probability density function of demodulated signal, a new method of ana- lyzing the despreaders’ performance is put forward, which is proved to be more accurate than traditional methods according to the numerical results. Finally, an adaptive despreader under different signal-to-noise ratios is given.

A Real-Time Attack on the GMR-2 Encryption Algorithm in Satellite Phones

In this paper, we present one method to attack on the GMR-2 algorithm used in satellite phone under the chosen-plaintexts. First using the relationship of the rows of the two s-boxes and outputs of the F coordinate, we attack on the GMR-2 algorithm. Then we deduce the happening probability of read-collision, and analyze its mathematical expectation. Finally, combining with the read-collision, we present an improved method to attack on the GMR-2 algorithm. The research results show that the complexity of the improved algorithm is about 220, and the session key Kc can be recovered in about 0.3 seconds. Compared with the available method, our method takes less time than the guess-and-decide attack method which is 700 s.

Further research on public-key cryptosystems based on third-order recurrence sequence

Properties of third-order recurrence sequences were investigated and a new variant of the GH public-key cryptosystem,which was further improved to be a probabil-istic public-key cryptosystem,was proposed.Then security analysis of the proposed scheme was provided and it was proved that the one-wayness of the proposed scheme is equivalent to partial discrete logarithm and its semantic se-curity is equivalent to decisional Diffie-Hellman problem in ring extension.Finally,efficiency analysis of the proposed scheme was provided,and that these two encryption schemes need to transfer 2log N and 4log N bits data re-spectively.

Packet routing algorithm for polar orbit LEO satellite constellation network

Broadband satellite networks are capable of providing global coverage and support various services. The networks constructed by Low Earth Orbit （LEO） satellite constellations have attracted great interests because of their short round-trip delays and wide bandwidths. A challenging problem is to develop a simple and efficient packet routing algorithm for the LEO satellite constellation network. This paper presents a SpiderWeb Topological Network （SWTN） and a distributed packet routing algorithm for the LEO satellite constellation network based on the SWTN. The algorithm gives the minimum propagation delay paths with low computational complexity and requires no routing tables, which is practical for on-board processing. The performance of the algorithm is demon- strated through simulations.

Short Group Signatures Without Random Oracles

We propose short group signature （GS） schemes which are provably secure without random oracles. Our basic scheme is about 14 times shorter than the Boyen-Waters GS scheme at Eurocrypt 2006, and 42% shorter than the recent GS schemes due to Ateniese et al. The security proofs are provided in the Universally Composable model, which allows the proofs of security valid not only when our scheme is executed in isolation, but also in composition with other secure cryptographic primitives. We also present several new computational assumptions and justify them in the generic group model. These assumptions are useful in the design of high-level protocols and may be of independent interest.

A Novel VLSI Architecture for Real-Time Line-Based Wavelet Transform Using Lifting Scheme

In this paper, we propose a VLSI architecture that performs the line-based discrete wavelet transform （DWT） using a lifting scheme. The architecture consists of row processors, column processors, an intermediate buffer and a control module. Row processor and Column processor work as the horizontal and vertical filters respectively. Intermediate buffer is composed of five FIFOs to store temporary results of horizontal filter. Control module schedules the output order to external memory. Compared with existing ones, the presented architecture parallelizes all levels of wavelet transform to compute multilevel DWT within one image transmission time, and uses no external but one intermediate buffer to store several line results of horizontal filtering, which decreases resource required significantly and reduces memory efficiently. This architecture is suitable for various real-time image/video applications.