On the distinctness of binary sequences derived from primitive sequences modulo square-free odd integers

Let M be a square-free odd integer and Z/(M) the integer residue ring modulo M. This paper studies the distinctness of primitive sequences over Z/(M) modulo 2. Recently, for the case of M = pq, a product of two distinct prime numbers p and q, the problem has been almost completely solved. As for the case that M is a product of more prime numbers, the problem has been quite resistant to proof. In this paper, a partial proof is given by showing that a class of primitive sequences of order 2k+1 over Z/(M) is distinct modulo 2. Besides as an independent interest, the paper also involves two distribution properties of primitive sequences over Z/(M), which related closely to our main results

Further results on the distinctness of binary sequences derived from primitive sequences modulo square-free odd integers

This paper studies the distinctness of primitive sequences over Z/(M) modulo 2, where M is an odd integer that is composite and square-free, and Z/(M) is the integer residue ring modulo M. A new sufficient condition is given for ensuring that primitive sequences generated by a primitive polynomial f(x) over Z/(M) are pairwise distinct modulo 2. Such result improves a recent result obtained in our previous paper [27] and consequently the set of primitive sequences over Z/(M) that can be proven to be distinct modulo 2 is greatly enlarged

A new result on the distinctness of primitive sequences over Z(pq) modulo 2

Let Z/(pq) be the integer residue ring modulo pq with odd prime numbers p and q. This paper studies the distinctness problem of modulo 2 reductions of two primitive sequences over Z/(pq), which has been studied by H.J. Chen and W.F. Qi in 2009. First, it is shown that almost every element in Z/(pq) occurs in a primitive sequence of order n > 2 over Z/(pq). Then based on this element distribution property of primitive sequences over Z/(pq), previous results are greatly improved and the set of primitive sequences over Z/(pq) that are known to be distinct modulo 2 is further enlarged

Implementation of reed solomon error correcting codes

In the present world, communication has got many applications such as telephonic conversations etc. in which the messages are encoded into the communication channel and then decoding it at the receiver end. During the transfer of message, the data might get corrupted due to lots of disturbances in the communication channel. So it is necessary for the decoder tool to also have a function of correcting the error that might occur. Reed Solomon codes are type of burst error detecting codes which has got many applications due to its burst error detection and correction nature. My aim of the project is to implement this reed Solomon codes in a VHDL test bench waveform and also to analyse the error probability that is occurring during transmission. To perform this check one can start with simulating reed Solomon codes in MATLAB and then going for simulation in XILINX writing the VHDL code. The encoder and decoder design of reed Solomon codes have got different algorithms. Based on your requirements you can use those algorithms. The difference between the algorithms is that of the computational calculations between them. The complexity of the code depends on the algorithm used. I will be using Linear Feedback Shift Register circuit for designing the encoder

An introduction of the theory of nonlinear error-correcting codes

Nonlinear error-correcting codes are the topic of this thesis. As a class of codes, it has been investigated far less than the class of linear error-correcting codes. While the latter have many practical advantages, it the former that contain the optimal error-correcting codes. In this project the theory (with illustrative examples) of currently known nonlinear codes is presented. Many definitions and theorems (often with their proofs) are presented thus providing the reader with the opportunity to experience the necessary level of mathematical rigor for good understanding of the subject. Also, the examples will give the reader the additional benefit of seeing how the theory can be put to use. An introduction to a technique for finding new codes via computer search is presented

Discrete Logarithm Cryptography

The security of many cryptographic schemes relies on the intractability of the discrete logarithm problem (DLP) in groups. The most commonly used groups to deploy such schemes are the multiplicative (sub)groups of finite fields and (hyper)elliptic curve groups over finite fields. The elements of these groups can be easily represented in a computer and the group arithmetic can be efficiently implemented. In this thesis we first study certain subgroups of characteristic-two and characteristic-three finite field groups, with the goal of obtaining more efficient representation of elements and more efficient arithmetic in the corresponding groups. In particular, we propose new compression techniques and exponentiation algorithms, and discuss some potential benefits and applications. Having mentioned that intractability of DLP is a basis for building cryptographic protocols, one should also take into consideration how a system is implemented. It has been shown that realistic (validation) attacks can be mounted against elliptic curve cryptosystems in the case that group membership testing is omitted. In the second part of the thesis, we extend the notion of validation attacks from elliptic curves to hyperelliptic curves, and show that singular curves can be used effectively in such attacks. Finally, we tackle a specific location-privacy problem called the nearby friend problem. We formalize the security model and then propose a new protocol and its extensions that solve the problem in the proposed security model. An interesting feature of the protocol is that it does not depend on any cryptographic primitive and its security is primarily based on the intractability of the DLP. Our solution provides a new approach to solve the nearby friend problem and compares favorably with the earlier solutions to this problem

Contribution à l'étude des systèmes de transmission optique utilisant le format de modulation QPSK

La demande constante de capacité et la saturation prévue de la fibre monomode ont conduit récemment à des avances technologiques qui ont complètement changé le paysage des télécommunications à fibre optique. Le progrès le plus important était la mise en œuvre d'une détection cohérente à l'aide d'électronique rapide. Cela a permis pas seulement l'utilisation de formats de modulation qui promettent une utilisation plus efficace de la bande passante, mais aussi l utilisation des algorithmes adaptés pour combattre la dégradation du signal optique due à la propagation. Cette thèse a commencé un peu après le début de cette ère du cohérent et son principal objectif était de revoir les effets physiques de la propagation dans des systèmes de transmission terrestres, utilisant le format de modulation QPSK (Quadrature Phase Shift Keying). Le manuscrit est divisé en deux parties. La première partie est consacrée à une étude sur les séquences des données qui doivent être utilisés dans les simulations numériques, lorsqu un format de modulation avancée est impliqué. La propagation, et en particulier l'interaction entre la dispersion chromatique et les non-linéarités, introduisent une interférence inter-symbole (ISI). Vu que cet ISI dépend de l enchainement des données transmises, il est évident que le choix de la séquence a une influence sur la qualité estimée du canal. Etant donné que des séquences aléatoires infinies ne sont pas pratiquement réalisables, nous utilisons souvent des séquences pseudo-aléatoires (PR), i.e. des séquences déterministes de longueur finie, avec des statistiques équilibrés, qui semblent être aléatoires. Dans la première partie, nous décrivons la méthode de génération de séquences PR avec M. niveaux (M> 2) et nous détaillons leurs propriétés. En outre, nous proposons des outils numériques pour caractériser les séquences non pseudo-aléatoires qu on utilise souvent dans des simulations, ou parfois aussi dans des expériences au laboratoire. Enfin, nous présentons les résultats de simulations qui permettent de quantifier la nécessité d'utiliser des séquences PR en fonction des paramètres du système. Après avoir établi les séquences finies "les plus adaptées", dans la seconde partie du manuscrit, nous nous concentrons sur l'étude de la propagation, dans le contexte d'un système de transmission QPSK et en supposant une gestion de dispersion et un type de fibre variables. Plus précisément, nous étudions numériquement les statistiques de signaux dégradés dus à l'interaction de la dispersion chromatique avec les effets non linéaires, en négligeant tout effet de polarisation ou inter-canaux, aussi que le bruit des amplificateurs. Dans ce contexte, nous étions intéressés à déterminer si certaines lois empiriques développées pour les systèmes OOK, sont valable dans le cas d'une modulation QPSK, tels que le critère de la phase non-linéaire cumulée ( NL) ou des lois qui permettent une optimisation de la gestion de dispersion. Ensuite, nous révélons l'importance de la rotation de la constellation du signal initial, comme un paramètre qui peut fournir des informations pour la post-optimisation de notre système. Nous discutons également autour du fait que la forme de la constellation dépend de la gestion de dispersion et concernant les constellations nous concluons qu'il y en a généralement 3 types, avec: (1) une variance de phase supérieure à la variance d'amplitude (2) une variance d'amplitude supérieure à la variance de phase et (3) avec le signal ayant une constellation qui ressemble à la constellation d un signal sous l'influence d'un bruit blanc gaussien additif. Enfin, nous fournissons une explication phénoménologique des formes des constellations révélant le fait que des sous-séquences différentes conduisent à un type différent de dégradation et nous utilisons ces informations pour définir un paramètre qui quantifie le bénéfice potentiel d'un algorithme de correction du type MAP(Maximum A Posteriori Probability)The constant demand for capacity increase, together with the foreseen saturation of the single-mode optical fiber, paved the way to technological breakthroughs that have completely changed the landscape of fiber-optic telecommunications. The most important advance was, undeniably, the practical implementation of a coherent detection with the help of high-speed electronics. This has, first, enabled the use of advanced modulation formats that allowed for a more efficient use of the fiber bandwidth, compared to the classical On-Off Keying, while adapted algorithms could not be used in order to mitigate the optical signal degradation. This thesis began a little after the advent of coherent detection and its main objective was to revisit the propagation effects in optical transmission systems using "Quadrature phase shift keying" (QPSK) modulation in the context of terrestrial systems, i.e. for transmission distances of up to about 2000 km. The manuscript is divided into two parts. The first part is dedicated to a study on the data sequences that need to be used in numerical simulations, when advanced modulation is involved. Fiber propagation, and in particular the interplay between chromatic dispersion and nonlinearities, usually introduce a nonlinear inter-symbol interference (ISI) to the transmitted signal. Since this ISI depends on the actual transmitted data pattern, it is obvious that the choice of the sequence used in our numerical simulations will have a direct influence on the estimated channel quality. Since, an infinite length, random sequence is impractical; we very commonly use pseudorandom" (PR) sequences, i.e. finite-length, deterministic sequences with balanced pattern statistics that seem to be random. In the first part we describe the method of generating M-level (with M>2) pseudorandom sequences and we detail their properties. In addition, we propose numerical tools to characterize the non-pseudorandom sequences that we use in numerical simulations, or we are sometimes forced to use in laboratory experiments. Finally, we present results of numerical simulations that quantify the necessity to use PR sequences as a function of our system parameters. After having established the fairest possible finite sequences, in the second part of the manuscript, we focus on the study of the nonlinear propagation, in the context of a transmission system using QPSK modulation and assuming a variable dispersion management and fiber type. Specifically, we numerically study the signal statistics due to the interplay of chromatic dispersion and nonlinear effects, neglecting all polarization or multi-wavelength effects and the amplifier noise. In this context, we were first interested in determining whether some empirical laws developed for OOK systems, can be also used in the case of QPSK modulation, such as the criterion of cumulative nonlinear phase ( NL) or laws that allow for a quick optimization of the dispersion management. Next we reveal the importance of a global phase rotation added to the initial signal constellation, as a parameter that can provide interesting information for the post-optimization of our system. We also discuss the fact that the constellation shape critically depends on the applied dispersion management, while there are generally 3 types of constellations, concerning the complex signal statistics: (1) the phase variance is higher than the amplitude variance (2) the amplitude variance is higher than the phase variance and (3) the received signal constellation resembles to a constellation of a signal under the influence of just an Additive White Gaussian Noise. Finally, we provide a phenomenological explanation of the constellations shapes revealing the fact that different data sub-sequences suffer from a different kind of signal degradation, while we also use this information to define a parameter that quantifies the potential benefit from a MAP (Maximum A Posteriori probability) correction algorithmEVRY-INT (912282302) / SudocSudocFranceF