Hyperelliptic curves encryption combined with block codes for Gaussian channel

In this paper, a new cryptographic system is constructed using a combination of a hyperelliptic curve of genus g = 2 over the Galois field GF(2ⁿ) and a Reed–Solomon code (N, K) over the Galois field GF(2^m) and this system uses a smaller key than the elliptic curves cryptosystem and the Rivest, Shamir, and Adleman cryptosystem. The design criterion for the combination can be expressed as the data compression condition and addressing capability of the code. In addition, the system performance is compared with other systems; extraordinary improvements of 8 and 16.5 dB can be obtained for a BER = 10^?5, when compared with binary phase shift keying and differential chaos shift keying, respectively. This system has a polynomial complexity, which depends on data length and the number of operations in GF(2ⁿ). Copyright © 2005 John Wiley & Sons, Ltd.     

An ID-based cryptosystem based on the discrete logarithm problem

In a modern network system, data security technologies such as cryptosystems, signature schemes, etc., are indispensable for reliable data transmission. In particular, for a large-scale network, ID-based systems such as the ID-based cryptosystem, the ID-based signature scheme, or the ID-based key distribution system are among the better countermeasures for establishing efficient and secure data transmission systems. The concept of an ID-based cryptosystem has been proposed by A. S?hamir (1985), and it is advantageous to public-key cryptosystems because a large public-key file is not required for such a system. An ID-based cryptosystem based on the discrete logarithm problem is proposed which is one of the earliest realizations in Shamir's sense. The security against a conspiracy of some entities in the proposed system is considered, along with the possibility of establishing a more secure system.<>     

Perfect secrecy cryptosystem with nonuniform distribution of keys

More strictly mathematical concepts of infinite perfect secrecy and random “one-time pad” cryptosystem in theory were presented,and the whole secure communication system was divided into two stages:design of a basic cryptosystem and one of its applications.How to design a basic cryptosystem by using a group of orthogonal Latin squares was first studied and an example to illustrate how to design nonlinear encryption transformations for a basic cryptosystem was given.Then,how to design the sequence of keys by using random method with nonuniform distribution was discussed,and it was strictly proven in theory that the infinite random “one-time pad” cryptosystem based on the designed basic cryptosystem was of perfect secrecy.Since the obtained result generalizes the existing one for random “one-time pad” cryptosystem to be perfect by using a basic cryptosystem with modulo addition,it may be used as a wider ideal simulated prototype to design stream cipher algorithms.Since the number of basic cryptosystems that can be designed is much more than one of the common basic cryptosystems with modulo addition,the obtained result is effective supplement and perfection to mainstream design method for the current stream cryptosystems.     

On the representation of CPM signals by linear superposition ofimpulses in the bandpass domain

A novel signal generation concept for continuous phase modulations (CPMs) with modulation index 1/2 based on real impulses is presented. With this concept, bandpass CPM signals can be generated directly in one step instead of the two consecutive steps, namely, the generation of the complex envelope and the modulation of the carrier by the complex envelope, which are necessary in conventional signal generators. Mathematical expressions for both the real impulses and the bandpass CPM signals are derived and a simple modulator structure is discussed. Examples for the real impulses are given. Among these are the well-known CPM schemes of minimum shift keying (MSK), sinusoidal frequency shift keying (SFSK), and Gaussian minimum shift keying (GMSK). As an example, the validity of the novel signal generation concept is shown for the latter CPM scheme     

基于最大秩距离码的McEliece公钥加密方案

提出了基于最大秩距离码新的McElience公钥密码系统，讨论其可行性及安全性．证明了它比基于纠错码的McElience公钥密码系统里安全。而且，通过引入单向函数．使密码系统能有效地抗击消息重发攻击和相关消患攻击。     

Small Details Gray Scale Image Encryption Using RC6 Block Cipher

Wireless Personal Communications - The paper presents an efficient image cryptosystem for dealing with low details gray scale images. The proposed image cryptosystem is based on using the RC6...     

QMLFD Based RSA Cryptosystem for Enhancing Data Security in Public Cloud Storage System

Nowadays sharing secure data turns out to be a challenging task for the data owner due to its privacy and confidentiality. Several IT companies stores their important information in the cloud since computing has developed immense power in sharing the data. On the other hand, privacy is considered a serious issue in cloud computing as there are numerous privacy concerns namely integrity, authentication as well as confidentiality. Among all those concerns, this paper focuses on enhancing the data integrity in the public cloud environment using Qusai modified levy flight distribution for the RSA cryptosystem (QMLFD-RSA). An effective approach named QMLFD for the RSA cryptosystem is proposed for resolving the problem based on data integrity in public cloud environment. A secured key generation and data encryption are done by employing the RSA cryptosystem thus the data is secured from unauthorized users. The key selection is done by using quasi based modified Levy flight distribution algorithm. Thus the proposed approach provides an effective model to enhance the integrity of data in cloud computing thus checking the data integrity uploaded in the public cloud storage system. In addition to this, ten optimization benchmark functions are calculated to determine the performances and the functioning of the newly developed QMLFD algorithm. The simulation results and comparative performances are carried out and the analysis reveals that the proposed QMLFD for the RSA cryptosystem provides better results when compared with other approaches.

     

Performance analysis of differential-phase-shift-keying optical receivers in the presence of in-band crosstalk noise

In-band crosstalk can pose important limitations in an all-optical wavelength-division-multiplexed (WDM) network. Recent studies have demonstrated that differential phase shift keying (DPSK), can tolerate higher in-band crosstalk-noise levels compared to amplitude shift keying (ASK). In this paper, the performance of a DPSK receiver, limited by in-band crosstalk noise, is studied theoretically. The model takes into account both the in-band crosstalk noise as well as the amplified-spontaneous-emission (ASE) noise of the optical amplifiers. The model is based on the evaluation of the moment-generating function (MGF) of the decision variable through which, the error probability (EP) can be calculated by applying the saddle point approximation. This provides a rigorous model for the evaluation of the EP of a DPSK receiver in the presence of ASE and in-band crosstalk noises. In the absence of the ASE noise, a closed-form formula for the EP is also given that is useful for estimating the error floor set by the in-band crosstalk noise.     

Nonnegative Matrix Factorization Applied to Nonlinear Speech and Image Cryptosystems

Nonnegative matrix factorization (NMF) is widely used in signal separation and image compression. Motivated by its successful applications, we propose a new cryptosystem based on NMF, where the nonlinear mixing (NLM) model with a strong noise is introduced for encryption and NMF is used for decryption. The security of the cryptosystem relies on following two facts: 1) the constructed multivariable nonlinear function is not invertible; 2) the process of NMF is unilateral, if the inverse matrix of the constructed linear mixing matrix is not nonnegative. Comparing with Lin's method (2006) that is a theoretical scheme using one-time Padding in the cryptosystem, our cipher can be used repeatedly for the practical request, i.e., multitme padding is used in our cryptosystem. Also, there is no restriction on statistical characteristics of the ciphers and the plaintexts. Thus, more signals can be processed (successfully encrypted and decrypted), no matter they are correlative, sparse, or Gaussian. Furthermore, instead of the number of zero-crossing-based method that is often unstable in encryption and decryption, an improved method based on the kurtosis of the signals is introduced to solve permutation ambiguities in waveform reconstruction. Simulations are given to illustrate security and availability of our cryptosystem.      

一种基于FPGA的MSK调制器设计与实现

首先分析了MSK调制信号的特点以及功率谱,然后根据软件无线电的思想,用可编程器件FPGA实现了基带信号的MSK调制,主要包括串并转换、数字频率合成、基带调制与中频调制等部分.     

Linearly shift knapsack public-key cryptosystem

Two algorithms are proposed to improve the Merkle-Hellman knapsack public-key cryptosystem. an approach to transform a superincreasing sequence to a high-density knapsack sequence is proposed. The algorithm is easy to implement and eliminates the redundancy of many knapsack cryptosystems. A linear shift method is used to improve the security of the knapsack public-key cryptosystem. It is shown that several knapsacks (e.g., the so-called useless knapsack), which cannot be generated by using the Merkle-Hellman scheme, can be generated by the linear shift method. Thus A. Shamir's (1982, 1984) attack to the original knapsack, as well as the low-density attack to the iterated knapsack, cannot be applied to this system successfully. It is interesting to note that the concept of the requirement of being one-to-one in practical enciphering keys is not necessary for this system.<>     

STOLAS: switching technologies for optically labeled signals

GMPLS-based labeled optical burst switching (LOBS) networks are being considered as the next-generation optical Internet. GMPLS includes wavelength switching next to label and fiber (space) switching. We present a new concept of optically labeling bursts of packets suitable for LOBS networks supported by GMPLS. It is based on angle modulation, which enables control information to modulate the phase or frequency of the optical carrier, while payload data are transmitted via intensity modulation (IM). In particular, the optical label is orthogonally modulated, with respect to the payload, using either frequency shift keying or differential phase shift keying. We present a performance analysis of the modulation schemes by means of simulations where the influence of the payload IM extinction ratio and laser linewidth are investigated. In addition, the transmission performance of an IM/FSK combined modulated signal is experimentally validated at 10 Gb/s, demonstrating at the same time an FSK label swapping operation. Finally, a suitable optical label-controlled switch design is proposed that takes advantage of these novel labeling techniques, and efficiently combines widely tunable, fast switching lasers and SOA-MZI wavelength converters with an arrayed waveguide grating router.     

基于RS码的改进McEliece公钥密码体制

论文首先简要介绍了M公钥密码体制,然后重点讨论了基于RS码,利用广义置换矩阵改进的M公钥密码体制,最后对这种改进的M公钥密码体制的安全性进行了分析,证明它的性能和安全性都优于M公钥密码体制。     

ID-based cryptographic schemes for user identification, digitalsignature, and key distribution

In 1984, A. Shamir introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a key authentication center (KAC) and identify himself before joining a communication network. Once a user is accepted, the KAC will provide him with a secret key. In this way, if a user wants to communicate with others, he or she only needs to know the identity of his communication partner and the public key of the KAC. There is no public file required in this system. However, Shamir did not succeed in constructing an identity-based cryptosystem, but only in constructing an identity-based signature scheme. The authors here propose three identity-based cryptographic schemes based on the discrete logarithm problem: the user identification scheme, the digital signature scheme, and the key distribution scheme. The schemes are based on the digital signature scheme of G.B. Agnew et al. (1990), which is reviewed     

A low-cost alternative scheme to detect a 100 Gbps PM-DQPSK signal

We propose and demonstrate a low-cost alternative scheme of direct-detection to detect a 100 Gbps polarization-multiplexed differential quadrature phase-shift keying (PM-DQPSK) signal. The proposed scheme is based on a delay line and a polarization rotator; the phase-shift keying signal is first converted into a polarization shift keying signal. Then, this signal is converted into an intensity-modulated signal by a polarization beam splitter. Finally, the intensity-modulated signal is detected by balanced photodetectors. In order to demonstrate that our proposed receiver is suitable for using as a PM-DQPSK demodulator, a set of simulations have been performed. In addition to testing the sensitivity, the performance under various impairments, including narrow optical filtering, polarization mode dispersion, chromatic dispersion and polarization sensitivity, is analyzed. The simulation results show that our performance receiver is as good as a conventional receiver based on four delay interferometers. Moreover, in comparison with the typical receiver, fewer components are used in our receiver. Hence, implementation is easier, and total cost is reduced. In addition, our receiver can be easily improved to a bit-rate tunable receiver.     

基于椭圆球面波信号的连续相位调制及其频谱性能分析

椭圆球面波信号（PSWF）是时频域最佳能量聚集性信号,探索性地将PSWF信号应用于连续相位调制（CPM）技术,对基于椭圆球面波信号的CPM调制信号产生过程进行了描述;给出了采用自相关函数法对基于PSWF的CPM调制信号功率谱密度计算方法;结合数值计算、分析对比了最小频移键控、正弦频移键控、高斯最小频移键控以及基于高斯函数的CPM调制信号功率谱密度及其信号占用带宽等特性。数值计算结果表明椭圆球面波信号相比矩形脉冲、升余弦脉冲、高斯脉冲及（类）高斯脉冲作为CPM的基带调频信号,可以获得频谱性能、能量聚集性较好的CPM信号。     

Multilayer LMS interference suppression algorithms for CDMAwireless networks

The general theory of adaptive self reconfigurable interference suppression schemes is applied to several specific practical problems mainly suppression of m-level m amplitude-shift keying, m phase-shift keying (PSK), and m quadrature amplitude modulation signals. This is a practical situation when a code-division multiple-access (CDMA) network is overlaid with standard microwave systems. Another example is a multirate CDMA network where a limited number of high bit rate CDMA signals are allowed to use much higher power level due to lower processing gain. The algorithm is well suited for a modular software radio concept, which we believe, will be more and more accepted in future wireless communications. Further modifications of the schemes necessary for these applications are described, and numerous results are presented to illustrate performance improvements. A general interpretation of these techniques based on so-called multilayer least mean squares (LMS) algorithm is introduced and discussed. The algorithm is based on estimating fast changing interfering signal parameters by using parallel structures, which are fast but complex. At the same time, estimation of slow-varying signal parameters over a large range is accomplished by using an LMS algorithm that is simple but slower. In this way, suppression of the interference occupying the same bandwidth as the CDMA signal is possible with reasonable implementation complexity. For this case, a BER<10^-18 can be achieved if the interference signal to useful signal power ratio J/S>0 dB for binary PSK interference, J/S>17 dB for 8-PSK, J/S>27 dB for 32-PSK, and J/S>40 dB for 128-PSK     

基于球面波照射的非对称光学图像加密

为了克服基于相位截断傅里叶变换的非对称光学图像加密系统不能抵御已知明文攻击的缺陷,采用球面波的自带因子扰乱输入图像空间信息的方法实现图像的加解密,并通过理论分析和实验仿真进行了研究。结果表明,该方法既能抵御已知明文攻击和保持非线性特性,又能获得原系统加解密图像的效果,同时还能减少相位掩膜数量,简化系统设置。这一结果对于改进基于相位截断傅里叶变换的非对称光学图像加密系统的安全性是有帮助的。     

基于物理学的密码体制

本文综述了基于混沌动力学的混沌加密体制,基于量子物理学的量子加密体制,基于光学信息处理的光学模式识别加密体制。对这３种加密体系所对应的物理效应、加密原理、特点、研究状况及应用情况做了详细阐述,并分别对３种加密体系的发展进行了展望。     

一种Montgomery型椭圆曲线的高效标量乘算法

椭圆曲线标量乘法是椭圆曲线密码系统的基本运算,安全高效的标量乘法将直接提高椭圆曲线密码系统的效率和安全性.本文将Fibonacei数列的概念进行了扩展,提出了Fibonacci型数列的概念,并用Fibonaeei型数列将Montgomery型曲线上点的加法运算公式进行了简化,得到了新的点加公式fibAdd.利用黄金比率...