Abstract: An integer Z101 is divided by an integer I102 to obtain a remainder R109. The integer I102 includes a polynomial of power of a basic operational unit of a computer. In this way, the integer I for divisor is limited based on the basic operational unit of the computer, thus a shift operation, which is required for a conventional operation method, can be eliminated. The remainder can be calculated by only addition and subtraction. Accordingly, a code size becomes compact and the remainder of the integer can be calculated at a high speed.

Abstract: An integer Z101 is divided by an integer I102 to obtain a remainder R109. The integer I102 includes a polynomial of power of a basic operational unit of a computer. In this way, the integer I for divisor is limited based on the basic operational unit of the computer, thus a shift operation, which is required for a conventional operation method, can be eliminated. The remainder can be calculated by only addition and subtraction. Accordingly, a code size becomes compact and the remainder of the integer can be calculated at a high speed.

Abstract: An integer Z101 is divided by an integer I102 to obtain a remainder R109. The integer I102 includes a polynomial of power of a basic operational unit of a computer. In this way, the integer I for divisor is limited based on the basic operational unit of the computer, thus a shift operation, which is required for a conventional operation method, can be eliminated. The remainder can be calculated by only addition and subtraction. Accordingly, a code size becomes compact and the remainder of the integer can be calculated at a high speed.

Abstract: An integer Z101 is divided by an integer I102 to obtain a remainder R109. The integer I102 includes a polynomial of power of a basic operational unit of a computer. In this way, the integer I for divisor is limited based on the basic operational unit of the computer, thus a shift operation, which is required for a conventional operation method, can be eliminated. The remainder can be calculated by only addition and subtraction. Accordingly, a code size becomes compact and the remainder of the integer can be calculated at a high speed.

Abstract: It is desired to share one circuit by an encryption unit 200 and a decryption unit 500. A normal data transformation unit (FL) 251 and an inverse data transformation unit (FL−1) 273 are located at point symmetry on a non-linear data transformation unit 220, and a normal data transformation unit (FL) 253 and an inverse data transformation unit (FL−1) 271 are located at point symmetry on the non-linear data transformation unit 220. Therefore, the encryption unit 200 and the decryption unit 500 can be configured using the same circuits.

Abstract: The present invention can be applied to a cipher processing apparatus, which includes a function F having a configuration of repeating process and inside of the function F, a function f having a configuration of repeating process is included. According to the invention, the cipher processing apparatus is configured by registers 301 through 303 for temporarily holding data, selectors A through C, 311 through 313, and a function f operating circuit 323 for transforming data. An output data from the function f operating circuit 323 is held in the register C 303, and the selector C 313 selects either to repeat the data transformation by the function operating circuit 323 or not. When a cipher processing apparatus includes a function F having a configuration of repeating process and inside of the function F, a function f having a configuration of repeating process is included, the cipher processing apparatus can be embodied efficiently, which enables to reduce the circuit scale and to save electric power.

Abstract: In a data transformation apparatus for transforming two arbitrary pieces of data of A input data and B input data, a first nonlinear transformation of the A input data is performed using a first key parameter, a transformed result is output, an XOR operation of the transformed result and the B input data is performed to output an XORed result as B intermediate data, and the B intermediate data is input to a next sub-transformation unit as B input data. On the other hand, the B input data is input to a next sub-transformation unit as A input data. A second nonlinear transformation of the B input data is performed using a second key parameter, the transformed result is output, an XOR operation of the transformed result and the B intermediate data is performed to output an XORed result as B intermediate data, and the B intermediate data is input to a next sub-transformation unit as B input data.

Abstract: In a data transformation apparatus for transforming two arbitrary pieces of data of A input data and B input data, a first nonlinear transformation of the A input data is performed using a first key parameter, a transformed result is output, an XOR operation of the transformed result and the B input data is performed to output an XORed result as B intermediate data, and the B intermediate data is input to a next sub-transformation unit as B input data. On the other hand, the B input data is input to a next sub-transformation unit as A input data. A second nonlinear transformation of the B input data is performed using a second key parameter, the transformed result is output, an XOR operation of the transformed result and the B intermediate data is performed to output an XORed result as B intermediate data, and the B intermediate data is input to a next sub-transformation unit as B input data.

Abstract: In a data transformation apparatus for transforming two arbitrary pieces of data of A input data (101) and B input data (102), a first nonlinear transformation of the A input data is performed using a first key parameter (111), a transformed result (109) is output, an XOR operation of the transformed result and the B input data (102) is performed to output an XORed result as B intermediate data (106), and the B intermediate data is input to a next sub-transformation unit (122) as B input data. On the other hand, the B input data (102) is input to a next sub-transformation unit as A input data. A second nonlinear transformation of the B input data (102) is performed using a second key parameter (112), the transformed result is output, an XOR operation of the transformed result and the B intermediate data (106) is performed to output an XORed result as B intermediate data (108), and the B intermediate data is input to a next sub-transformation unit (123) as B input data.

Abstract: Data transformation apparatuses and methods for transforming two arbitrary pieces of data of A input data and B input data, wherein a first nonlinear transformation of the A input data is performed using a first key parameter, a transformed result is output, an XOR operation of the transformed result and the B input data is performed to output an XORed result as B intermediate data, and the B intermediate data is input to a next sub-transformation unit as B input data. On the other hand, the B input data is input to a next sub-transformation unit as A input data. A second nonlinear transformation of the B input data is performed using a second key parameter, the transformed result is output, an XOR operation of the transformed result and the B intermediate data is performed to output an XORed result as B intermediate data, and the B intermediate data is input to a next sub-transformation unit as B input data.

Abstract: A codeword contains information symbols representing elements of a Galois field, a parity check symbol generated using a certain element of the Galois field, and additional check symbols generated using a polynomial of which this certain element is not a root. The reliability of corrected codewords is assessed by counting the number of symbols found to be in error, or by counting the number of symbols having at least a certain number of bits in error. When a row-column array is decoded, rows of intermediate reliability are not corrected but their error patterns are stored in a memory, and columns of intermediate reliability are corrected if their error patterns match the error information stored in the memory.

Abstract: Data communication system and method with a data scrambling with high security. A data scrambling part is provided with a extended key memory for storing addresses of extended keys, and one of the extended keys is used as a parameter for scrambling an input data to be scrambled. In order to select one of the extended keys to be input to each processing block for converting the input data by using the parameter to output converted data, a selector varies the address of the extended key depending on a plaintext of the input data.

Abstract: Data communication system and method with a data scrambling with high security. A data scrambling part is provided with a extended key memory for storing addresses of extended keys, and one of the extended keys is used as a parameter for scrambling an input data to be scrambled. In order to select one of the extended keys to be input to each processing block for converting the input data by using the parameter to output converted data, a selector varies the address of the extended key depending on a plaintext of the input data.

Abstract: A method for computing a current vehicle speed value from a detected vehicle speed value derived from a pulse signal, said method provided data which can be used in a control process such as a cruise control of a vehicle, in which the current vehicle speed value is predicted from a previously computed vehicle speed value after an abnormal state of the current detected vehicle speed value is detected; and a cancel signal is produced for aborting the control process when the abnormal state has persisted for more than a certain time period.

Abstract: A cruise control system for maintaining the speed of a vehicle at a fixed, set speed, comprising an actuator including an electric motor which actuates a speed control member via an electromagnetic clutch. To ensure the capability of the cruise control system to decelerate the vehicle even when it is traveling a steep and long downhill, and the normal operation of the cruise control system becomes inadequate for curbing the excessive increase of the vehicle speed, the electromagnetic clutch is disengaged whereby the speed control member is returned to the position for maximum deceleration. Since the operation of the cruise control system is not canceled even when the vehicle speed is increased substantially beyond the set speed, the cruise control system can readily return to its normal operation even after the vehicle is accelerated from the state of cruise control by stepping on the accelerator pedal, for instance for passing another car.

Abstract: A vehicle cruise control system, comprising a control circuit for producing a control signal for maintaining a speed of a vehicle at a fixed level according to a difference between an actual vehicle speed and a target vehicle speed, and a drive circuit for producing a drive signal for selectively driving an actuator in a direction either to accelerate the vehicle or to decelerate the vehicle according to the control signal from the control circuit. The drive circuit is provided with a transistor bridge circuit comprising four drive transistors for producing the drive signal. The control circuit is provided with a detection means for detecting an abnormal state of the system and an inhibiting means which brings at least one of the drive transistors into an non-conductive state when any abnormal state is detected by the detecting means. The control circuit may be programmed to perform a certain diagnostic procedure for testing the soundness of the drive transistors.