Abstract:
Methods for code-division multiplex communications. The methods involve generating orthogonal or statistically orthogonal chaotic spreading codes (CSC 1 ,..., CSC K ) having different static offsets using a set of polynomial equations (fo(x(nT)),..., f N-ι (x(nT)) and/or fo[x((n+v)T+t)],..., f N-1 [x((n+v)T+t)]). The methods also involve forming spread spectrum communications signals respectively using the orthogonal or statistically orthogonal chaotic spreading codes. The methods further involve concurrently transmitting the spread spectrum communications signals over a common RF frequency band. The spreading codes are generated using different initial values for a variable "x" of a polynomial equation f(x(nT)) and/or different acc-dec values for a variable "v" of a polynomial equation fix((n+v)T+t)]. The static offsets are defined by the different initial values for a variable "x" and/or different acc-dec values for a variable "v".
Abstract:
Methods for code-division multiplex communications. The methods involve generating orthogonal or statistically orthogonal chaotic spreading codes (CSC 1 ,..., CSC K ) using different sets of polynomial equations (f o (x(nT)),..., f N-1 ,(x(nT))), different constant values (Co, Ci,..., C N-1 for the polynomial equations, or different sets of relatively prime numbers (ρ o , p i ,..., p N-1 ) as modulus (m 0 , m 1 ,..., m N-ι ) in solving the polynomial equations. The methods also involve forming spread spectrum communications signals using the orthogonal or statistically orthogonal chaotic spreading codes, respectively. The methods further involve concurrently transmitting the spread spectrum communications signals over a common RF frequency band.
Abstract:
A cryptographic system (CS) comprised of generators (502), (504), (510), an encryption device (ED), and a decryption device (DD). The generator (502) generates a data sequence (DS) including payload data. The generator (504) generates an encryption sequence (ES) including random numbers. The ED (506) is configured to perform a CGFC arithmetic process. As such, the ED is comprised of a mapping device (MD) and an encryptor. The MD is configured to map the DS and ES from Galois field GF[p k ] to Galois extension field GF[p k+1 ]. The encryptor is configured to generate an encrypted data sequence (EDS) by combining the DS and ES utilizing a Galois field multiplication operation in Galois extension field GF[p k+1 ]. The generator (510) is configured to generate a decryption sequence (DS). The DD (508) is configured to generate a decrypted data sequence by performing an inverse of the CGFC arithmetic process utilizing the EDS and DS.
Abstract:
A cryptographic system (CS) is provided. The CS (800) comprises a data stream receiving means (DSRM), a generator (702), a mixed radix converter (MRC) and an encryptor (908). The DSRM (902) is configured to receive a data stream (DS). The generator is configured to selectively generate a random number sequence (RNS) utilizing a punctured ring structure. The MRC (704) is coupled to the generator and configured to perform a mixed radix conversion to convert the RNS from a first number base to a second number base. The encryptor is coupled to the DSRM and MRC. The encryptor is configured to generate an altered data stream by combining the RNS in the second number base with the DS. The punctured ring structure and the MRC are configured in combination to produce an RNS in the second number base which contains a priori defined statistical artifacts after the mixed radix conversion.
Abstract:
A method is provided for generating a chaotic sequence. The method includes selecting a plurality of polynomial equations. The method also includes using residue number system (RNS) arithmetic operations to respectively determine solutions for the polynomial equations. The solutions are iteratively computed and expressed as RNS residue values. The method further includes determining a series of digits in a weighted number system (e.g., a binary number system) based on the RNS residue values. According to an aspect of the invention, the method includes using a Chinese Remainder Theorem process to determine a series of digits in the weighted number system based on the RNS residue values. According to another aspect of the invention, the determining step comprises identifying a number in the weighted number system that is defined by the RNS residue values.