Abstract: In a random number sequence sharing apparatus, a reception unit receives a radio signal including a radio wave from a pre-designated radio star at a pre-designated observation time, a sending unit sends the received radio signal to another random number sequence sharing apparatus, an acceptance unit accepts a radio signal sent from the another sharing apparatus, an analysis unit separates the two radio signals into a plurality of independent components by independent component analysis, a selection unit selects two independent components temporally different by difference in time required for the radio wave to arrive at both sharing apparatuses from the radio star, a sampling unit averages the two selected independent components after adjusting the temporal difference and bit-samples the average, and an output unit outputs a sequence of the bit samples as a random number sequence to be shared.

Abstract: An FIR filter for filtering a prescribed real impulse constant (r) (?1<r<1) receives in a terminal the input of the input signal of the Chebyshev-chaos type spreading code sequence having a chip length D. A plurality of signals obtained by delaying the input signals by 0, D, 2D, 3D, . . . , and (N?1)D are output by a delay circuit. When the delay time is T, a plurality of delayed and output signals are multiplied by (?r)N?T/D with an amplifier and output, and the sum of a plurality of amplified and output signals, namely an optimum chaos-type spreading code string, is output by an adder.

Abstract: In a multimedia information providing system, responding to a preview request from a terminal equipment, a server device generates a chaotic random number sequence from an initial value allocated to the terminal equipment, mixes this sequence into a set of multimedia information as a noise signal at a first mixing ratio, and then transmits the result as a first set of multimedia information for distribution. Responding to a quality improvement request, the server device generates a chaotic number sequence from the initial value allocated to the terminal equipment, mixes this sequence into a set of multimedia information as a noise signal at a second mixing ratio, and then transmits the result as a second set of multimedia information for distribution. The terminal equipment performs component analysis on the first and second sets of multimedia information, removing the noise and restoring a high-quality version.

Abstract: Disclosed is a random sequence generating apparatus for generating a sequence of integers. A seed receiving section receives a sequence of integers as a seed. An initialization section provides a transformation section with the received sequence of integers. The transformation section performs predetermined transformation on each of the provided integer sequence to acquire a sequence of integers. A rotation section acquires the number of rotation bits from a part of the acquired sequence of integers, performs a rotation operation on the acquired number of rotation bits with respect to all of or part of the sequence of integers taken as a bit sequence, and acquires a sequence of integers. An updating section provides the transformation section with the sequence of integers. An output section outputs part of a sequence of integers obtained last as a random sequence in case where transformation and rotation are repeated a predetermined number of times.

Abstract: A filter (201) accepts spreading code sequences or the like as input sequences of a chip rate 1/D, the accepted spreading code sequences are sequentially delayed and distributed by delay circuits (202) connected in series, delay times of individual signals are an arithmetical progression with a chip length D being a common difference D, the individual signals are amplified with spreading codes by amplifiers (203), amplification factors for the individual signals are a geometrical progression of a common ratio r, the sum of the amplified signals is obtained by addition in an adder (204), and the result is sequentially output as an output sequence.

Abstract: A UWB wireless communicating system is provided. When a process of the system is started, an initial value x0 is set to a storing portion. An output of the storing portion is supplied to a mapping portion that performs a calculation using a P-th order Chebyshev polynomial as a map. In addition, the output of the storing portion is returned to the storing portion. A generated chaotic sequence is stored in a pulse interval converting portion. The pulse interval converting portion converts a linear sum G1(x) of the Chebyshev polynomial into a pulse interval value t. An output of the pulse interval converting portion is supplied to a pulse output portion. A pulse sequence having a pulse interval ti into which the value of a liner sum G1(xi) has been converted is output. The output pulse sequence is supplied to the UWB wireless communicating system.

Abstract: Provided are a receiving device which improves communication performances by separating signals in CDMA communications using a chaos code, etc. In the receiving device, a receiving unit receives a signal directly spread by a chaos code and transmitted from a transmitting device, a component analyzing unit applies component analysis to the received signal to separate it into a plurality of components, a despreading unit obtains a plurality of signals by despreading the plurality of separated components by the chaos code respectively, and a selective output unit selects a signal having a large intensity from the plurality of despread signals, and outputs it.

Abstract: Apparatus for outputting a sequence of vectors includes a first storage that stores vector x having a dimension of at least 1. A first calculator calculates vector function x?=f(x) which utilizes a first rational vector map f to which the stored vector x is input. A second storage stores vector y having a dimension of at least 1. A second calculator calculates vector function y?=g(x, y) which utilizes a second rational vector map g to which the stored vectors x and y are input. An output outputs vector z? which is an association of the resultant vectors x? and y?. A first update updates the first storage by storing the resultant vector x? and a second update updates the second storage by storing the resultant vector y?.

Abstract: An observation unit of an authentication apparatus and an observation unit of an authentication target apparatus observe a radio wave from a common radio star at a common observation time. A sending unit sends information message including information on the observed radio wave, and an information reception unit receives it. An estimation unit estimates a position of the authentication target apparatus based on “the information on the radio wave observed by the observation unit” and “information on the radio wave observed by the observation unit”. A retaining unit pre-retains positions of one or more authentication target apparatus(s). A determination unit checks whether a position of the authentication target apparatus pre-retained in the retaining unit and the estimated position correspond within a predetermined error range, and settles authentication for the information message as a success in a case where the positions correspond.

Abstract: A key sharing system is disclosed which uses a public key X?GF(n) (2?X<n) which belongs to a Galois finite field GF(n) for an integer n (n?2), and a polynomial T(•, •) defined in GF(n) by T(a, x)?S(a, x)mod n where S(•, •) is a Chebyshev polynomial defined by S(a, cos ?)=cos(a?) where a is an integer (a?2). In a key sharing apparatus of this system, an integer obtaining unit obtains an integer p (2?p<n), a transmission key calculation unit calculates a transmission key Y?GF(n) using the integer p based on Y=T(p, X), a transmission key sending unit sends the transmission key Y to another key sharing apparatus, a transmission key reception unit receives a transmission key W from another key sharing apparatus, and a common key calculation unit calculates a common key Z?GF(n) using the transmission key W based on Z=T(p, W).

Abstract: A pseudo-random number sequence output unit responsive to s (1?s) number of prescribed positive integers q1, q2, . . . , qs, a prescribed real impulse constant r (?1<r<1), and a prescribed non-zero real constant C for outputting a pseudo-random number sequence of length N (1?N), which output unit includes: an input acceptance section that accepts input of s (1?s) number of real number sequence initial values Y1, Y2, . . . , Ys (?1<Y1<1, ?1<Y2<1, . . . , ?1 Ys<1), and s number of integer parameters p1, p2, . . . , ps (2?p1, 2?p2, . . . 2?ps) for which q1 mod p1?0, q2 mod p2?0 . . . , qs mod ps?0 respectively hold with respect to the prescribed positive integers q1, q2 . . . qs; a calculation section that uses the prescribed real impulse constant r, the prescribed non-zero real constant C, the sequence initial values Y1, Y2, . . . , Ys, the integer parameters p1, p2, . . . , ps, the prescribed positive integers q1, q2, . . .

Abstract: A part of data is extracted as an IV from cipher text at the previous time. An EX-OR gate ORes the IV and a common key and outputs a cipher key. Data to be transmitted are encrypted with the cipher key according to stream cipher. When ciphered data 15a are obtained at time tn?1, an IV extracted from the ciphered data 15a is supplied to an EX-OR gate 11b. The EX-OR gate 11b exclusively ORes the IV and a common key 12b and outputs a cipher key 13b. Since the cipher key 13b and transmission data are exclusively ORed, encryption is performed according to the stream cipher. As a result, ciphered data 15b at time tn is obtained. Next, with the IV extracted from the ciphered data 15b, encryption at time tn+1 is performed. Thereafter, at each time, a part of cipher text is used as an IV. The encrypting process is repeated.

Abstract: An input receiving section 102 of a transmitter apparatus 101 receives inputs of multiple synchronized signals r1, . . . , rN, an asynchronizing section 103 outputs multiple asynchronized signals v1, . . . , vN that are obtained by delaying the multiple synchronized signals r1, . . . , rN by time t1, . . . , tN, a modulating section 104 modulates the multiple output asynchronized signals v1, . . . , vN to output modulated signal w1, . . . wL (1?L?N), a transmitting section 105 transmits the output modulated signal w1, . . . wL, and the delay time t1, . . . , tN is shorter than a reciprocal number of a minimum value of clock rates of the multiple input received synchronized signals r1, . . . , rN, and is desirably proportional to one generated by a chaos random number in particular.

Abstract: A chaos spreading code c(n) is inputted to a spreading unit 32. Data D1 and c(n) are multiplied in the spreading unit 32. A chaos spreading code d(n) is inputted to a spreading unit 42. Data D2 and d(n) are multiplied in the spreading unit 42. The chaos spreading codes c(n) and d(n) orthogonally cross each other. Outputs of the spreading units 32 and 42 are added by an adder 35 and transmitted through a transmitting unit 36 to a transmission path 38. By making an initial value which is set in a chaos sequence generator having a construction of a digital circuit different, the chaos spreading codes which orthogonally cross can be formed. Since the chaos spreading codes c(n) and d(n) orthogonally cross, an orthogonal modulating unit having a construction of an analog circuit for amplitude-modulating carriers which orthogonally cross can be made unnecessary and the construction can be simplified.

Abstract: A transmitter, receiver, and communication system that utilize a pseudo-random number sequence (PRNS) output unit that provides a PRNS of length N. The PRNS output unit generates the PRNS responsive to a number (s) of prescribed positive integers (qx), a prescribed real impulse constant (r), and a prescribed non-zero real constant (C), where 1<x<s. The PRNS output unit includes an input acceptance section that accepts the number (s) of real number sequence initial values (Yx), and the number (s) of integer parameters (px); and a calculation section that uses the prescribed real impulse constant (r), the prescribed non-zero real constant (C), the real number sequence initial values (Yx), the integer parameters (px). and the prescribed positive integers (qx) to calculate a recurrence formula that is used to generate a PRNS (z?[y]) of length N, and that outputs the PRNS (z?[y]), where 1<y<N.

Abstract: Random number generating, encrypting, and decrypting apparatus, method thereof, program thereof, and recording medium thereof are provided. Random numbers for cryptographic applications are generated by a CA core. The CA core is composed of one-dimensional, two-state, and three-neighbor cell automaton. A total of three inputs for the own cell and both neighbor cells are input to each cell. Each cell performs a logical operation and outputs the result of the logical operation. Each cell contains a register. Each register captures the result of the logical operation in synchronization with a clock and stores the result. An output of a cell is fed back to the cell to perform an arithmetic calculation at the next time step. In this case, a rotation shift operation of which outputs of cells are shifted to the left and fed back to the cells is performed. To output random numbers having many bits, 40 bits of outputs of cells are selected.

Abstract: In a random number sequence sharing apparatus, a reception unit receives a radio signal including a radio wave from a pre-designated radio star at a pre-designated observation time, a sending unit sends the received radio signal to another random number sequence sharing apparatus, an acceptance unit accepts a radio signal sent from the another sharing apparatus, an analysis unit separates the two radio signals into a plurality of independent components by independent component analysis, a selection unit selects two independent components temporally different by difference in time required for the radio wave to arrive at both sharing apparatuses from the radio star, a sampling unit averages the two selected independent components after adjusting the temporal difference and bit-samples the average, and an output unit outputs a sequence of the bit samples as a random number sequence to be shared.

Abstract: A random number sequence output apparatus (101) includes a sequence acceptance unit (102) for accepting input of a numerical sequence, an initial value setting unit (103) for accepting an initial value and causing a storage unit (104) to store this, an output unit (105) for outputting a new value stored in the storage unit (104), a calculation unit (106) for applying a predetermined rational map stored in he storage unit (104) each time the output unit (105) outputs a value and further applying a predetermined calculation unit to the value and value extracted from the numerical sequence accepted by the sequence acceptance unit (102), and an updating unit (104) to store the value of the result of calculation performed by the calculation unit (106), thereby performing updating.

Abstract: A UWB wireless communicating system is provided. When a process of the system is started, an initial value x0 is set to a storing portion. An output of the storing portion is supplied to a mapping portion that performs a calculation using a P-th order Chebyshev polynomial as a map. In addition, the output of the storing portion is returned to the storing portion. A generated chaotic sequence is stored in a pulse interval converting portion. The pulse interval converting portion converts a linear sum G1(x) of the Chebyshev polynomial into a pulse interval value t. An output of the pulse interval converting portion is supplied to a pulse output portion. A pulse sequence having a pulse interval ti into which the value of a liner sum G1(xi) has been converted is output. The output pulse sequence is supplied to the UWB wireless communicating system.

Abstract: When numerically integrating an integrand function A over an unbounded domain, a vector map f converts an m (m≧1)-dimensional vector into an m-dimensional vector wherein a multidimensional density function &rgr; of the limiting distribution resulting from repeatedly applying the map f to a predetermined m-dimensional vector u is analytically solvable. A first storage unit stores an m-dimensional vector x, a second storage unit stores a scalar value w, a first computing unit computes a vector x′=f(x), a second computing unit computes a scalar value w′=A(x)/&rgr;(x), an update unit updates values in the first and second storage units and by storing the vector x′ on the first storage unit and adding the scalar value w′ to a value to be stored in the second storage unit, and an output unit computes a scalar value s=w/(c+1) when the number of update times by the update unit becomes c (c≧1) and outputs the result.