WO2008001918A1

WO2008001918A1 - Random number generation device, encryption/decryption device using the same, its program, and program recording medium

Info

Publication number: WO2008001918A1
Application number: PCT/JP2007/063182
Authority: WO
Inventors: Kiyoto Yui; Daisuke Sumisawa; Akira Kawasaki; Takeshi Sasaki
Original assignee: Kiyoto Yui; Daisuke Sumisawa; Akira Kawasaki; Takeshi Sasaki
Priority date: 2006-06-30
Filing date: 2007-06-30
Publication date: 2008-01-03
Also published as: JP2009258141A

Abstract

[PROBLEMS] The necessity of sophisticated encryption and decryption which can easily be used for a memory disc or the like is increasing. The present invention generates an effective pseudo-random number which can be used in a small-scale computer system and a mobile terminal. A pseudo-random number generation device has n encryption keys and uses a combination of the encryption keys so as to extract the maximum performance of the pseudo-random number and execute encryption and decryption for a rugged memory disc. [MEANS FOR SOLVING PROBLEMS] Since a random number sequence generated by a reproducible pseudo-random number has an N-1 cycle, a mechanism has been developed for using the generated random number sequence in this cycle without entering the next cycle. Moreover, the random number generation device includes a mechanism for extracting a random number sequence without overlap in the random number sequence N-1 generated by the pseudo-random number so as to maximize the disorder of the random number and extract the maximum performance of the random number generation device. The random number generation device is embedded to encrypt/decrypt data so as to protect data in a memory disc or the like.

Description

Specification

Random number table generator, encryption Z decryption device using the same, program thereof, and program recording medium

Technical field

[oooi] The present invention relates to a random number table generator and an encryption / decryption device using the same. In particular, the present invention relates to a random number table generation device and an encryption Z decryption device that are suitable for embedded devices, home appliances, portable devices, small information terminals, and small game terminal devices that are low in resources.

Background art

[0002] As a general random number generation technique, a timer is provided, and a seed is generated based on the time information of the power-on power and the last information of the previous time. Means that can withstand the analysis of objects is disclosed (see Patent Document 1).

[0003] In addition, a method is disclosed in which the security of authentication is improved by remembering the most recent exchange of random numbers and not using the used random number values (see Patent Document 2).

[0004] Further, there is disclosed means for generating a random number within its own device in order to realize random number generation with a small number of resources (see Patent Document 3).

[0005] Non-Patent Document 1 introduces a Mersenne twister. Mersenne twister, which uses Mersenne prime numbers, was a pseudorandom number generator developed in 1997 (published in January 1998) by Kei Matsumoto and Takushi Nishimura. It is proved that the period is evenly distributed in the 623-dimensional hypercube with an expressive power of 2 to 19937-1 or 623 words (19937 bits, 2492 bytes).

[0006] The 32-bit version of Mersenne's twister has an internal structure that increases by one word and has 624 words (19 968 bits, 2496 bytes) of internal variables. A random number table of 624 words (19968 bits, 2496 bytes) is generated by combining these internal variables. This random number table has a different random number table only by the combination of 624 words (19968 bits, 2496 bytes).

[0007] Based on the above, it can be explained that there are at least 624 words (19968 bits, 2496 bits) with a random number table of 2 to the power of 19937-1 proven to be evenly distributed (Non-patent Document 1) reference ) o

[0008] Further, Non-Patent Document 2 is an introduction page of cryptography published by the Ministry of Foreign Affairs! This page introduces finite and infinite random number cryptography in an easy-to-understand manner. Here, infinite random number cryptography cannot be logically deciphered !, and state the fact! /, (See Non-Patent Document 2).

[0009] In data encryption, there are a finite random number expression and an infinite random number expression. A finite random number expression is a method in which the same random number table is used repeatedly for encryption. It is efficient, but once the random number table is decoded, it can be easily decoded. The infinite random number formula is a method in which the random number table once used is not used again. An infinite random number expression is a cipher that has been proved by information theory that the same random number is not used twice but cannot be deciphered when used only once. Patent Document 1: Japanese Patent Laid-Open No. 2000-242470

Patent Document 2: JP 2001-177519 A

Patent Document 3: Japanese Patent Laid-Open No. 10-247140

Non-patent literature 1: M. Matsumoto and T. Nishimura, Mersenne Twister: A 623- dimensio nally equidistributed uniform pseudorandom number generator ", ACM Trans, on Modeling and Computer Simulation Vol. 8, No. 1, January pp.3- 30 (1998) http://www.math.sci.hiroshima-u.ac.jp/~m—mat/MT/mt.html

Non-Patent Document 2: Ministry of Foreign Affairs Minister's Secretariat Information and Communication Division, Adjunct Lecturer Sadao Okumura “Diplomacy and Cryptography” ht tp: // www.mofa.go.jp/ mofaj / annai / snocho / e—seifu / toukou2004.html

Disclosure of the invention

Problems to be solved by the invention

[0010] The present invention enables data to be correctly decrypted only when conditions such as connection of a specific individual, a specific computer system, and specific equipment are satisfied, and data theft, data alteration, viruses and spyware The challenge is to minimize the damage caused by peer-to-peer applications.

Means for solving the problem

[0011] In the present invention, n encryption keys are set for data, and information can be decrypted when conditions such as connection of a specific individual, a specific computer system, and a specific equipment are satisfied. It is. In addition, the present invention provides a random number that overlaps by controlling the pseudo-random number generator with fine-grained control. The strength of the infinite random number formula is taken in such a way that a different random number is generated each time.

[0012] The random number table generation device of the present invention is a random number table generation device by computer processing, and includes the following elements. That is, a means for generating a random number table having an element number power equal to or greater than the use limit number n (n is a positive number), an area for storing the generated random number table, an area for storing the use limit number n, and elements of the random number table Means to generate another random number table without using the elements after n + 1 of the random number table when using up to the use limit number n. This is the idea corresponding to S916 in FIG.

[0013] Further, the random number table generating device of the present invention includes means for acquiring a plurality of encryption keys having different origins, an area for storing the plurality of encryption keys having different origins, and the plurality of encryption keys having different origins. Means for generating one random number table as a seed, and an area for storing the random number table.

[0014] The random number table generating device can generate the random number table by a pseudo random number generation method using Mersenne prime numbers or a pseudo random number generation method by a Mersenne twister.

[0015] In addition, time information may be included as one of the encryption keys. In this case, it is possible to provide means for using the result of calculating the random number table and the time information as a random number table.

[0016] In addition, as one of the encryption keys, unique information of a device connected to a computer system as a random number table generator can be included.

[0017] Further, as one of the encryption keys, unique information of the computer system itself as the random number table generation device can be included. In this case, the serial number of the storage device built in the computer system can be acquired as the unique information of the computer system.

[0018] In the present invention, the computer system includes embedded devices, home appliances, portable devices, small information terminals, small game terminal devices, and the like.

[0019] In addition, the user's biometric information can be included as one of the encryption keys.

[0020] Also, as one of the encryption keys, a key key input from an input device or automatically set can be included.

[0021] Also, as one of the encryption keys, a means for providing a unique code such as a serial number for each random number table to be generated can be provided. [0022] Furthermore, it is possible to provide means for generating a new random number sequence by generating a plurality of random number tables and combining the elements of the plurality of random number tables.

Next, the encryption Z decryption device of the present invention includes the random number table generation device described above and the following elements. That is, an area for storing information to be encrypted or decrypted, means for encrypting or decrypting information to be encrypted or decrypted using a random table, and information encrypted or decrypted. A storage area. Among these, the means for encrypting or decrypting individually generates a random number table with a different seed from the random number table generator for each information to be encrypted or decrypted, and uses the recently generated random number table. Encrypt or decrypt.

At this time, the time information set in the encryption key can be time information related to information to be encrypted or decrypted.

[0025] For example, means for storing encrypted information in a storage device as a file by a file management system possessed by the basic control software of the computer, and the time information used for the encryption key for the generation time or update of the file There is no means to save the file as time.

[0026] Further, as a unique code set to the encryption key, a value indicating a recording unit of a storage device such as a sector and a block can be given. In this case, the random number table used when encrypting or decrypting the information recorded in a certain recording unit can be provided with means for generating a unique code by giving a value indicating the recording unit. BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, embodiments of the present invention will be described with reference to the drawings.

[Example 1]

The present embodiment relates to a program and an apparatus that perform encryption and decryption. FIG. 18 shows an overall configuration diagram as an electronic device of the computer system of the first embodiment of the present invention.

[0030] The information processing device (host device) includes a central processing unit S1811 (hereinafter referred to as CPU) that executes overall control of the computer and various programs, a memory device S1813 in which various programs and data are loaded, ROMBIOS- S1812, And adapters S1815 and S1816. These are connected to the system bus S1814. [0031] Among these, the host interface S1820 of the HDD S1830 is connected to the adapter S1815. In addition, a reader / writer S1 819 to which a storage device can be attached is connected to the adapter S1816. In this embodiment, the USB device S1840 can be mounted as a storage device (storage device). The USB device S1840 has a function as a storage device. In the present embodiment, the USB device S1840 is described as being a memory disk device, but any device may be used as long as the effects of the present embodiment are achieved.

[0032] ROMBIOS-S1812 includes means for selecting one device from system bootable devices such as HDD-S1830 or a storage device, means for reading the system boot loader from the device module to memory device S1813, and reading And a means for branching to the system boot loader (so-called system boot function). At system boot, the HDD—S1830 or any storage device power read OS program power is stored in the memory device S1813 and executed by the CPU—S1811.

Next, a method for managing random numbers generated in the computer system will be described.

In this embodiment, a Mersenne twister is used as a pseudo random number generator. Pseudorandom numbers have a disadvantage that they have a period. Mersenne's twister generates the same random number at regular intervals. Mersenne 'Twister 2-19937-1 The decimal system has a period of about 10 to the 6000th power. In other words, about 10 to the 6000th power of random numbers are repeatedly generated. The upper figure in Fig. 1 shows a straight line of one cycle. The horizontal axis shows the data length, and the divided strips are unit data lengths representing the individual random numbers.

[0035] Now, as shown in the lower diagram of Fig. 1, there is a huge random number table with 2 as the power of 19937-1 as element N.

S112 is a small table characterized in that the number n of elements does not overlap. The encryption in this embodiment is performed using this small table S112.

[0036] Once used, the small table S112 is not used again. In this way, infinite random number encryption and decryption are performed within the period of the pseudo random number. Here, the small tables S112 are arranged side by side without any gaps! / It is better to be efficient, but there may be gaps!

[0037] Mersenne's Twister has a 2496-byte (624-word) table internally as its internal specifications, and when the random number generated when one seed is given is 2496 bytes or less, the table is a small table S112 Can be used as In this case, generated in one seed You can generate and manage random numbers under 2496 bytes, and never use the same seed again!

[0038] That is, the following simple calculation formula is regarded as one table, and the above theory is established.

^ s + a = a X n = ∞

a = 10 to the power of 6000

a '= 2492 bytes

a "= 623 words

s = 1 seed

n = number of tapes

∞ = Infinite value

Subsequently, the encryption method of the present embodiment will be described with reference to FIG. S210 is the plaintext that you want to encrypt. S211 is a random number table. The random number table S211 is a collection of small tables S112 generated with different seeds. The result of XORing each element of the plaintext S210 and each element of the small table S211 on a one-to-one basis, that is, in byte units is S212.

[0040] Thus, encryption can be performed by performing an operation between S210 and S211. As the type of operation, addition or subtraction may be performed in addition to exclusive OR, but exclusive OR is adopted in this embodiment because the processing is simple. When exclusive OR is used, the same exclusive OR is sufficient for decoding, and it is also suitable for computer processing. That is, when it is desired to decrypt the plaintext S210, the plaintext S210 can be decrypted by taking the exclusive OR of the encrypted data S212 and the random number table used at the time of encryption.

Subsequently, FIG. 3 shows a physical overview of the system of the present embodiment. S310 is a USB connector of the computer shown in FIG. S311 is a USB memory device (S1840) with a built-in fingerprint authentication device. In the present embodiment, a prototype was made using a USB memory device with a built-in fingerprint authentication device, but the present invention does not require this fingerprint authentication device. It is clearly indicated that the fingerprint authentication device is one of the embodiments.

Subsequently, FIG. 4 explains how to use the USB memory device employed in this embodiment. Note that the basic control software for USB is from Microsoft Corporation. [0043] When the USB memory device is connected to the USB connector S310, the computer system displays the screen of S410 on the screen of the display device. A CD-ROM device S411 and a removable disk S412 appear on the screen.

[0044] Subsequently, the computer system displays a screen prompting fingerprint authentication in S416 on the display device. When the user instructs authentication from the input device, the computer system displays the fingerprint authentication screen of S417 on the display device. When the user slides his / her finger on the fingerprint sensor built in the USB memory device, the computer system reads the user's fingerprint information and performs fingerprint authentication. When fingerprint authentication passes, the computer system switches the screen of S410 to the screen of S413.

[0045] S414 and S415 displayed after switching the screen are protected disk areas that appear only when fingerprint authentication is performed. In order to perform this series of processing, it is necessary to register the user's fingerprint in the computer system in advance using the tool attached to the USB memory device.

[0046] Here, the use of the fingerprint authentication and the USB memory device will be described in order to facilitate understanding of the present invention, and it is clearly shown that it is not directly related to the present invention.

FIG. 5 shows n encryption keys that serve as seeds when generating random numbers in the above-described computer system. First, in this embodiment, the encryption key is statically determined. These are essential information for the operation of this device.

In FIG. 5, S510 is a memory area for generating an encryption key. In this embodiment, a size of 624 bytes (2496 bytes) is secured. This size is matched to the maximum number of seeds that can be set in the Mersenne Twister Open Program (2002 version (mtl9937ar.c)) used in this example. However, the size of 624 words is secured, but it is not necessary to use all of them.

Here, in order to prevent malfunction, the memory area S510 is assumed to store all zeros once when this memory area is secured. Then, each internal element is stored. Also, whether or not to use all the statically determined elements S511 to S514 in the encryption key stored in the memory area S510 is arbitrary. Store a value in the item to be used, and set the value of the unused item to zero. Here, each element determined statically is an element other than time information and a serial number (dynamic encryption key S610) described later. [0050] Among the statically determined elements, the keyword S511 is a value stored in the computer system in which this embodiment operates, and is an arbitrary character string. In this embodiment, the ASCII character string is 128 bytes or less, and this character string is terminated with a null code. This keyboard S511 sets an initial value via an input screen as shown in S515, and the computer stores it in a nonvolatile storage device.

[0051] The computer specific information S512 reads and stores the unique code of the computer system or terminal in which this embodiment is operating. In this embodiment, the memory area for storing the computer specific information is a 4-byte area. For example, when using a disk device, the basic control software of Microphone Software Inc. in the US issues a 4-byte unique code called a volume serial number each time the disk device is initialized. In this embodiment, it is assumed that the 4-byte value is written in the memory area S511 as the unique information S512.

In FIG. 5, the 4-byte unique code is shown on the screen of S516. This S516 screen is a collection of disk list information. Of these, the S517 hexadecimal code is the 4-byte code.

On the other hand, in this embodiment, when it is not desired to check the unique code of the computer system, zero is always stored in the area of the computer specific information S512. In this case, no matter which computer system the USB memory device S311 is connected to, it becomes zero and the encryption key check becomes loose.

Subsequently, in S513, the manufacturer number, product number, and serial number of the USB memory device S311 are registered. A USB device has a manufacturer number, a product number, and a serial number in its original specifications. The combination of these three codes shall be stored. Usually this code is a total of 24 bytes. Allocate a size of 64 bytes to S513 with a margin.

Here, the USB manufacturing company number and product number registered in S513 are information written in the USB memory device at the time of manufacture. This is a safety measure to prevent the manufacturer company number and product number from being stored when a USB from a different company is connected.

[0056] Here, when the USB memory device S311 is connected, it is read from the USB memory device and classified as S513. Shall be paid.

[0057] Subsequently, a 4-byte biometric key is registered in S514. This reads the volume serial number of S415 in Fig. 4 that appears as a result of biometric authentication. Originally, it is preferable to read the biometric authentication key directly. However, in the case of fingerprint authentication, it is conceivable that multiple persons including the administrator register the fingerprint. In this case, different biometric data appears for each person who performed fingerprint registration. However, when multiple people share a file using a single computer, it is necessary to share the encryption key. Therefore, if the biometric key is used for encryption as it is, sharing will be lost and inconvenience will occur. Therefore, it is necessary to key S415 in this way.

From this, a code appearing as a result of biometric authentication is registered as a biometric authentication code.

Next, S610 indicates a dynamic encryption key area. The generation of n dynamic encryption keys stored in the dynamic encryption key area S610 will be described with reference to FIG. Figure 6 shows the memory map of the dynamic encryption key area S610!

In FIG. 6, S611 is a time information area, which is an 8-byte memory area. This stores the time information of the computer system. The time information specification is based on the power of the basic control software installed in the computer, usually with system seconds shown in 4 to 8 bytes, and the current year / month / day / hour / minute / second can be determined uniquely. A common system second is the number of seconds from 00:00:00 on January 1, 1970 to the present, in seconds. It is convenient to express the date and time up to 2100 because it has a range of about 130 years with 4 bytes of expressive power.

[0061] In the time information area S611, when performing encryption, the current time at that time is stored. In addition, since this time information is necessary for decryption, when the encrypted data is stored in the storage device, the time information used for the encryption key is always stored in association with it. This time information storage process is the role of the higher-level process that calls this conversion program (encryption key Z decryption key program), and specifies that it does not belong to this conversion program. Also, as described above, the encrypted data cannot be decrypted without this time information. Therefore, when performing encryption key and decryption key as a set, it is clearly stated that the higher-level program check device must always store the time information. [0062] In the time information area S611, when decryption is performed, the time when encryption is performed is stored. Time information always exists for each piece of data encrypted by a higher-level program. The time information is registered here.

[0063] Subsequently, a serial number starting from zero is stored in the serial number area S612. In the lower diagram of FIG. 6, S613 indicates data to be encrypted or decrypted. The horizontal axis is the data length, which has N elements. S614 indicates a division in units of RND_SIZE bytes. In this embodiment, consecutive numbers are assigned in units of RND_SIZE bytes. When the first RND_SIZE of S613 is zero, when the next RND_SIZE is 1, the number is incremented by one. That is, when the data to be encrypted or decrypted S613 is given, the number obtained in S614 is stored in the serial number area S612. In this embodiment, it is assumed that the sequence number area S612 has a 4-byte area.

[0064] Further, in this embodiment, RND_SIZE indicates 2048 bytes. RND_SIZE can be of any size, but it is preferable to fit within the width of the random number table guaranteed by the pseudo-random numbers used. In this embodiment, a Mersenne twister is used, and the safe width of this is 2496 bytes. This width should be chosen according to the characteristics of the pseudorandom number generator used.

Subsequently, S620 is a free area. The entire area S510 shown in FIG. 5 has 624 words (2496 bytes) secured, and the remaining static information keys S511 to S514 and the time information area S611 and sequence number area S612 which are dynamic encryption keys are allocated. The area is a free area S620.

In this embodiment, the time information S611 and the serial number S612 are repeatedly stored in this empty area S620. However, the present invention operates without any problem even if the empty area S620 is cleared to zero. In this embodiment, setting the value in the free area S620 as described above is a device for disturbing the value taken by the memory area S510 as much as possible and generating a higher-quality random number.

Next, FIG. 7 shows the concept of encryption / decryption actually performed. S710 indicates data to be encrypted or decrypted. This data shall have a length of N bytes (corresponding to the case where the unit data length is 1 byte in Figs. 1 and 2). S711 is a random number with the size of RND_SIZE generated using the data in memory area S510 shown in FIG. 5 as a seed. It is a table (corresponding to the small table S112 in FIGS. 1 and 2). Each random number table S711 is generated as a different random number table because the serial number stored in S612 in FIG. 6 changes according to the position from the beginning.

[0068] S712 shows the result of exclusive OR of the data S710 to be encrypted or decrypted and each random number table S711. When S710 is plaintext, the encrypted result is S71

Become 2. When S710 is ciphertext, the result of decryption and decryption is S712.

Subsequently, FIG. 8 shows input / output of a program that realizes the encryption / decryption device of the present embodiment.

. In this embodiment, encryption and decryption are performed in the same manner, and hence simply referred to as “conversion”.

First, a memory area for storing an address reference variable is defined. The memory area for storing the address reference variable stores a position for referring to the memory area to be mounted on the computer system and the portable terminal, and changes depending on the computer system.

[0071] Since this embodiment was prototyped with 32-bit basic control software of Microsoft Corporation, the memory area for storing the address reference variable is 4 bytes. Here, an address reference variable is synonymous with a pointer variable, pointer variable, or address variable.

S810 is a memory area for storing address reference variables. As the contents, the memory address where the memory area S510 shown in FIG. 5 exists is stored.

S811 is a memory area for storing an address reference variable. The contents are encrypted or decrypted, and the memory address where the data stored in S814 is stored. S814 is a table storing data to be encrypted or decrypted.

Here, this program is a component that performs encryption / decryption, and actually, there is a higher-order program that uses the program. The host program has an overview of the data represented by S817 when converting. S814 is an arbitrary mapping of S817. The upper program stores and stores the converted! /, Location of S817 in the form of a table in memory, and stores this memory address in S811.

[0075] S815 is position information indicating where the data stored in S814 starts in S817. Zero at the beginning. 100 for the 100th byte. [0076] S816 is information indicating how many bytes the data stored in S814 is.

[0077] S812 is an 8-byte memory area. Stores S815 as the contents. In S812, 4 bytes is usually sufficient for 32-bit basic control software. In this program, 8 bytes are provided with a margin. If the S817 is simply a file or small data in memory, 4 bytes is sufficient. On the other hand, the entire hard disk may be converted. In this case, the total data to be converted is several tens of gigabytes. Considering such a case, it is 8 bytes.

S813 is a 4-byte memory area. Stores S816 as the contents.

Subsequently, FIG. 9 shows a control flow of the present embodiment. Figure 8 shows the actual flow of the program that defines input and output.

[0080] The special symbols in the flowchart of the present application conform to the C language which is a computer language.

% · · 'This is a symbol indicating remainder calculation.

"· · · This is a symbol indicating an exclusive logical circle.

++ · · 'Increment, a symbol that means incrementing the value by one.

[n] · · 'This is a symbol that means an array. n is an array index.

*: When placed before an address type variable, indicates the value at the address indicated by the variable.

In S910, initialization processing is performed! Here, a variable no having a size of 4 bytes, a variable ip having a size of 4 bytes, and an array variable rncLtbl having a size of RND_SIZE are allocated. The contents of no, ip and rnd_tbl do not need to be initialized! /.

In S911, the result of dividing the value stored in S812 by RND_SIZE is stored in no. As a result, the serial number of the random number table required for conversion is calculated.

[0083] S912 calculates the remainder of S812 and substitutes it into ip.

In S913, “no” is assigned to the serial number area S612. In other words, the serial number is stored in S612 here. The address of the serial number area S612 can be calculated from the memory address strength of S510 stored in S810.

In S914, a random number table is generated by a Mersenne twister. Specifically, the processes shown in FIGS. 10 and 11 described later are executed. The S810 value is stored in S1010, which will be described later, and the start address on the memory of rncLtbl is stored in S1 011. And the processing of Fig. 10 and Fig. 11 Do.

[0086] S915 is a loop. The variable i is set to zero as an initial value, and i is incremented by 1 for each round. Then i loops RND_SIZE times. In other words, the loop is repeated between i = 0 ... i = RND_SIZE-l.

[0087] S916 is a restrictor. ip indicates the reference position of the random number table rnd_tbl currently used. When ip takes a value less than RND_SIZE, it correctly refers to the random number table. On the other hand, when ip exceeds RND_SIZE, it is when the random number table is used and cut.

In S917, an actual conversion process is performed. The i-th element from the top of the memory address indicated by S811 and the upper force of rnd_tbl also take the exclusive OR of the ip-th element and substitute it. Assigned to

This is the i-th element from the top of the memory address indicated by S811.

[0089] In S918, ip is increased by one. This shifts the elements of random numbers to be used next.

[0090] In S919, increment the serial number by one! Use this process !, just use it! /, Use random numbers!処理 This is the process when cut. Prepare to generate the next random number table.

[0091] S920 substitutes zero for ip. When generating a new random number, the ip indicating the starting position is cleared.

In S921, no is substituted for S612. That is, the serial number is stored in S612. [0093] Next, FIG. 10 shows input / output of the random number generation program.

S1010 is a memory area for storing address reference variables. The memory address where S510 exists is stored as its contents.

S1011 is a memory area for storing address reference variables. The contents store the memory address where the random number table exists. This random number table is rnt_tbl shown in FIG. S9

This memory area has the size of RND_SIZE allocated in 10.

Subsequently, FIG. 11 shows the processing of the random number generation program.

In S1110, initialization processing is performed. Here, variables used internally are secured. no is a 4-byte variable. Ptr is an address type variable, and is reserved for the purpose of referring to 4-byte memory. i is a 4-byte variable. [0098] The internal working memory used by the Mersenne Twister is also initialized here. This is to avoid indefinite random numbers generated by Mersenne's twister because the initial value of the internal working memory is undefined.

In S1111, a random number seed is given. The standard function init_by_array () published by Mersenne 'Twister is executed. S510 is given as a seed to this function. The function is called by specifying the address and length of the memory area that stores the key data for seed generation. Here, the start address of S510 and the length of the area are given.

[0100] In SI 112, substitute the value obtained by dividing RND_SIZE by 4 for the variable no! /. The Mersenne twister generates a random number in units of 1 word or 4 bytes. Therefore, the number of random numbers required to fill RND_SIZE is calculated here.

[0101] S1113 assigns the value of S1011 to the variable ptr.

[0102] S1114 performs a loop process no times!

[0103] S1115 generates a random number. Mersenne 'Twister public function genrand_int32 () is executed. The return value of this function is a 4-byte random number. This 4-byte random number is assigned to the address area indicated by ptr. Store a 4-byte random number at a time.

[0104] S1116 is an optional black box process. This processing is not necessary. If the random number generated by Mersenne 'Twister is adopted as it is, it is not preferable as a random number for encryption because the algorithm is publicly available. In order to correct this, it is preferable to apply arbitrary deformation. The transformation process is performed in S1116. It works without problems even without S1116. However, the reliability can be improved by incorporating it.

[0105] In S1117, the variable ptr is increased. Here, the memory address indicated by ptr is added by 4 bytes. The variable ptr is an address type variable that references 4 bytes. Therefore, increasing the indicated value by one indicates the next 4-byte area, and actually increases the memory address by four. It is added here that it is 1 addition on the notation but 4 addition in byte conversion.

[0106] Next, FIG. 12 describes the flow of a program for acquiring a unique code of a specific device. This embodiment is an apparatus that performs encryption / decryption. It is acquired by a program or a host device and stored in S513 in FIG. Here, we describe a program in which a higher-level program implemented for prototyping acquires a unique code. Here, it is proved that a unique code can be obtained, and its mechanism is shown.

In this embodiment, recognition of a USB memory device with a built-in fingerprint authentication function as a unique device and identification of the unique code are performed.

[0108] S1220 is a table showing the manufacturer code, product number, and serial number of the USB device. Hexadecimal A 4-byte code that identifies the manufacturer. Similarly, it has a 4-byte hexadecimal product number. And it has a 16-byte serial number. In this prototype, the serial number has a margin of 54 bytes, giving a total of 64 bytes.

[0109] S1221 represents the company number, serial number, and product number with reference to a character string registered in the registry of 32-bit basic common software of Microsoft Corporation. Different ways of expression depending on the basic common software. Each code is converted to an ASCII character string and concatenated into a single character string for management. In this way, the basic common software is now connected! /, So that the unique code of the USB device can be obtained! /, (The registry is the basic common software built in for management. Database).

[0110] S1210 performs initialization. When this program ends, the value passed to the calling upper program is cleared to zero.

[0111] S1211 is an endless loop.

[0112] S1212 obtains the unique code of the currently connected USB device from the basic common software. In this prototype, the first connected device is acquired for the first time. Loop and get the second connected device for the second time. If this is repeated and all of the connected devices are acquired, the acquisition fails.

In S1213, the presence / absence of the connected device S311 is determined. If none, exit the program. At this time, the zero-cleared memory area set in S1210 is stored in the upper program as a return value.

[0114] If the connected device S311 exists, in S1214, the company number of the value such as S1221 obtained from the connected device S311 is determined. At this time, it is determined whether it matches the manufacturing company code written in this program beforehand. The manufacturer code to be included in the program is this program The code of the company specified or the corresponding company shall be embedded when manufacturing and selling.

[0115] If the manufacturing company codes match, in S1215, the obtained product number as in S1221 is determined. At this time, it is determined whether or not it matches the product number code written in this program in advance. The product number code to be incorporated into the program shall be genuinely designated or embedded with the corresponding company code when this program is manufactured and sold.

[0116] If the product number code matches, the manufacturer code, product number code, and serial number are stored in the return value in S1216.

By using the mechanism of this program, the unique code of the connected device S311 is registered in the connected device information area S513 of FIG. 5, and the encryption key using the connected device S311 of this embodiment is used.

[0118] In the present embodiment, by using the technology described above, (1) an encryption key composed of a static encryption key and a dynamic encryption key is stored in the memory area S510 shown in FIG. Based on the key, the seed generated is input to the Mersenne Twister to generate a random number table. The random number table is generated as different random number tables 0 to n as shown in FIG. 7 by including the serial number S612 in the encryption key. (3) Then, as shown in FIG. 7, the encryption result or the decryption result S712 is obtained by taking the exclusive OR of the data S 710 to be encrypted or decrypted and each random number table S711. . (4) The computer processing is performed by the firmware shown in FIG. 18 and FIG. 3, and the processing content is performed by using the memory area and the program processing described in FIG. 8 to FIG.

In the present embodiment, all computer processing is realized by a computer executing a program. Data used for computer processing is read from the storage device by the computer as necessary, and stored in the storage device as necessary. Instruction to the user force computer is performed by operating the input device, and information output to the computer force computer is performed by an output device such as a display device. The same applies to the embodiments described later.

[0120] [Example 2]

[0121] In the second embodiment, an apparatus and a program for generating random numbers faster than in the first embodiment will be introduced. First, an outline of the conversion (encryption Z decryption) of the present embodiment will be described based on FIG. [0122] S1310, S1311, and S1312 are RND_SIZE random number tables. This random number table can be of any size, but is RND_SIZE here because it is easy to manage.

[0123] The number of three prepared is originally n and may be arbitrary. However, 3 is calculated as a realistic number from the size of RND_SIZE. Now, it is assumed that different random number tables are stored in S1310, S1311, and S1312, respectively.

[0124] S1313 is arbitrary data to be converted. S1319 is data resulting from the conversion.

S1314 is a random number table having the size of RND_SIZE generated by taking the exclusive OR of S1310, S1311, and S1312. The first 1 byte of S1314 is the result of XORing the first 1 byte of S1310, S1311, and S1312. Each element of S1314 is the result of XORing the elements at the same positions of S1310, S1 311, and S1312.

[0126] S1315 is a random number table generated in the same process as S1314. However, S1 311 is generated by rotating 1 byte before generation. This rotation can be either clockwise or counterclockwise. Here, it is assumed that it is rotated 1 byte counterclockwise.

[0127] S1316 and S1317 are generated after rotating S1311 one byte at a time in the same manner.

When generating random numbers in this way, S1311 will circulate and generate the same random number after repeating RND.SIZE times. At this time, S1312 is rotated 1 byte counterclockwise. In this way, long-period random numbers can be generated by combining n random number tables. Here, since there are three RND.SI ZE random number tables, it is possible to create a random number table with a cycle of 2048 X 2048 X 2048 = 8,589,934,592 or about 8 Gbytes and returning to the original (that is, three random numbers) The random number tables 0 to n are generated while shifting the combinations of the values of the tables S1310, S1311, and S1312. If the data to be converted is generated individually, 8GB is enough.

[0128] Random number tables S1310, S1311, and S1312 are most preferably able to generate a random number table for each of S1319. However, it is possible to generate high-quality random numbers by generating S1311 and S1312 in advance and generating only S1310 for each S1319.

The present embodiment provides a program and apparatus for performing encryption / decryption using this method.

FIG. 14 shows input / output of a program that implements the encryption / decryption device of the present embodiment. Real In the embodiment, encryption and decryption are performed in the same way, and hence simply referred to as conversion.

[0131] First, a memory area for storing an address reference variable is defined. The memory area for storing the address reference variable is a thing for storing a position for referring to the memory area to be mounted on the computer system and the portable terminal, and changes depending on the computer system. Since this embodiment was prototyped with 32-bit basic control software of Microsoft Corporation, the memory area for storing address reference variables is 4 bytes.

S1413 is a memory area for storing an address reference variable. In this area, the memory address where the data S814 exists, which is encrypted or decrypted, is stored. In FIG. 14, the data S817 to be encrypted or decrypted, the S814 that is the part, the position S815 from the head where the S814 exists in the data S817, and the length S816 of the S814 are as follows: This is the same as that shown in FIG. Therefore, the same reference numerals are given and redundant description is omitted.

S1414 is an 8-byte memory area. S815 is stored in this area. In this area, 4 bytes is usually sufficient for 32-bit basic control software. This program has a margin of 8 bytes. If the S817 is simply a file or small data in memory, 4 bytes is sufficient. However, the entire hard disk may be converted. In this case, the entire data to be converted is several tens of gigabytes. Considering such a case, it is 8 bytes.

[0134] S1415 is a 4-byte memory area. S816 is stored in this area.

[0135] S1416 is a random number table having a size of RND_TBL. This corresponds to S1310 in FIG. In this case, the stored data is generated by the program shown in FIGS. 10 and 11 described in the first embodiment.

[0136] S1417 is a random number table having a size of RND_TBL. This corresponds to S1311 in FIG. In this case, the stored data is generated by the program shown in FIGS. 10 and 11 described in the first embodiment.

[0137] S1418 is a random number table having a size of RND_TBL. This corresponds to S1312 in FIG. In this case, the stored data is generated by the program shown in FIGS. 10 and 11 described in the first embodiment.

S1410 is a memory area for storing address reference variables. The content is S1416 Stores the existing memory address.

S1411 is a memory area for storing address reference variables. The contents store the address on the memory where S1417 exists.

[0140] S1412 is a memory area for storing an address reference variable. The content stores the address on the memory where S1418 exists.

[0141] Next, FIG. 15 shows the flow of control of the present embodiment. This is the actual flow of a program that defines input and output according to Fig. 14.

First, in S1510, initialization processing is performed. Here, the 4-byte variables i, ipl, ip2, ip3, and lwk are reserved. ipl manages the random number table indicated by S1416. ip2 manages the random table indicated by S1417. ip3 manages the random number table indicated by S1418.

S1511 substitutes the position used at the beginning of the random number table shown in S1416 for calculation Upl.

The random number in S1511 uses a buffer of size RND_SIZE. Therefore, the result of taking the remainder with RND_SIZE is the first use starting point.

S1512 substitutes the position used at the beginning of the random number table shown in S1417 for calculation Up2.

S1512 circulates S1416 once to circulate 1 byte. Therefore, S1314 is calculated by dividing by RND_SIZE.

[0145] S1513 substitutes the position used at the beginning of the random number table indicated by S1418 for calculation Up3.

S1513 circulates 1 byte as S1417 circulates once. Therefore, ip2 is divided and calculated by RND_SIZE.

[0146] In S1514, the remainder of ip2 is taken with RND_SIZE and assigned to ip2. The substitution calculation for ip2 in S1512 does not take action when S1417 circulates more than one revolution. Here, the result of taking and circulating the surplus is calculated.

[0147] In S1515, the remainder of ip3 is taken with RND_SIZE and assigned to ip3. The substitution calculation for ip3 in S1513 does not take action when S1418 circulates more than one revolution. Here, the result of circulating the remainder is calculated. The situation where S1418 makes one rotation means that the same random number is generated and reused. Therefore, although it should not occur, it exists as a safety device. This safety device makes sense when the data you want to convert exceeds 8GB. Usually not considered first. In S1516, variable lwk stores S1414, that is, position information of data to be converted.

S1517 performs loop processing. Loops through the value stored in S1415. The variable i is set as a loop counter, and loops starting from i = 0 and increasing i by 1 for each loop.

[0150] In S1518 and S1519, conversion information is generated from three random number tables. Specifically, in S1518, the exclusive logical ring of the value having the element number as the value indicated by ipl on S1416 and the value having the element number as the value indicated by ip2 on S1417 is stored in wk. In S1519, an exclusive logical ring of wk and a value having the value indicated by ip 3 as an element number on S1418 is taken and stored in wk.

[0151] In S1520, the exclusive OR of wk is substituted for the i-th data from the beginning of S1413 that stores the data to be converted. As a result, the S1413 conversion is performed by 1 byte.

[0152] In S1521, the stored value of the variable ipl is incremented by one. The value to be used next to the random number table S1416 is set.

In S1522, the stored value of variable ip2 is incremented by one. The value to be used next to the random number table S1417 is set.

In S1522A, the stored value of variable ip3 is increased by one. The value to be used next to the random number table S1418 is set.

[0155] In S1523, the stored value of the variable lwk is increased by one! lwk shows the converted position! /, the position from the beginning of the whole data.

[0156] In S1524, ipl and RND_SIZE are compared in size.

[0157] S1525 is a process to be performed when the stored value of ipl is equal to or larger than RND_SIZE. This determination is processing when the number of elements in the random number table S1416 is exceeded. ipl is set to zero, and the use of random number table S1416 is returned to the beginning.

In S1526, the stored value of variable ip2 is incremented by one. The value to be used next to the random number table S1417 is set. Since the random number table S1416 has been rotated, the procedure for shifting S1417 by 1 byte is performed.

[0159] In S1527, the remainder when lwk is divided by RND_SIZE2 is obtained. When the result is zero, lw k is an integer multiple of RND_SIZE2. This time is when all combinations of the random number tables S1416 and S1417 have been made. When the value is valid, all combinations of the random number tables S1416 and S1417 are not completed. [0160] In S1528, it is assumed that all combinations of random number tables S1416 and S1417 have been made.

Process to shift S1418 by 1 byte! Increase the value stored in the variable ip3 by one! /

[0161] In S1529, ip2 and RND_SIZE are compared in size.

[0162] In S1530, zero is assigned to the variable ip2. Since the used area of the random number table S1417 has reached the end, it is initialized and returned to the beginning.

[0163] In S1531, the size comparison between ip3 and RND_SIZE is performed.

[0164] In S1532, zero is assigned to the variable ip3. Since the used area of the random number table S1418 has reached the end, it is initialized and returned to the beginning.

In the present embodiment described above, similarly to the first embodiment, three random number tables S1310, S1311, and S1312 are generated through the processing of FIGS. 8 to 12, and these three random number tables are used. Then, data conversion (encryption or decryption) is performed by performing the processing of FIG. 14 and FIG. The description of the same part as Example 1 is omitted.

Now, generating random numbers at high speed is a problem for developers, but when increasing randomness, processing tends to increase and slow down. On the other hand, according to the present embodiment, a random number table used for encryption is generated by combining three previously generated random number tables. For this reason, a random number table can be generated by a simple memory operation. As a result, a random number table with high randomness can be obtained at high speed.

[Example 3]

[0168] Example 3 to be described next is a simple application program that performs encryption Z decryption. Encryption Z decryption processing itself uses the processing described in the first embodiment.

FIG. 16 describes the processing flow of this embodiment. This embodiment is executed from the basic control software, and designates a file to be converted (encrypted or decrypted). Read the file you want to convert, execute the conversion, and save the conversion result as a file in the storage device. Once it is applied to the application shown in this embodiment, encryption is performed. When the generated result is applied again to this application, decryption is performed.

[0170] S1610 performs initialization. The 4-byte variables ip, no, and i are reserved. In addition, the memory area used as S510 in Fig. 5 is secured. Also, allocate dat_tbl as a working memory area for reading and writing files. dat_tbl is the size of RND_SIZE. [0171] S1611 assigns zero to the variable ip.

In S1612, the storage area (computer specific information area) of S512 is cleared to zero. In the area of S512, it is avoided here that the conversion result becomes indefinite due to the indefinite memory initial value.

In S1613, the file name of the conversion source is input. This is an interactive question about the file name path on the disk. The file specified here is the target of conversion.

In S1614, the conversion source file name is opened in the binary read mode.

In S1615, the conversion destination file name is opened in the binary write mode. In this example, the file name at the time of opening is the one obtained by adding the character string “.enc” to the end of the file name acquired in S1613, and is saved in the same path as the S1613 conversion source file. And

[0176] In S1617, terminal information is acquired. Specifically, it is assumed that the specific information of the computer system on which this embodiment operates is acquired. Here, it is assumed that the HDD volume serial number S517 is stored in the computer-specific information area S512 shown in FIG.

In S1618, device information connected to the computer system is acquired. Execute the program shown in Fig. 12 and register the device information in the device specific information area S513. When the device is connected, the value cleared to zero shall be entered here.

[0178] In S1619, the creation time of the conversion source file acquired in S1613 is acquired. Tate time is the time information when the file was created. This time information is stored in the time information area S611 in FIG. The create time is used here, but the write time, that is, the last write time may be used. The important thing is to unify the time information used as the encryption key. In this embodiment, the creation time is unified.

[0179] In this embodiment, encryption keys other than those described above that constitute S510 are not used here.

. It is assumed that the unused area has a value of zero.

[0180] S1620 is an endless loop that configures i as a counter. The initial value of i is set to zero, and the value of i is incremented by 1 for each loop. [0181] In S1621, the conversion source file is read sequentially in the binary mode by the size of RND_SIZE. The read data is stored in daUbl. The remaining amount of data in the file is less than RND_SIZE! / Sometimes, only the amount that exists is read.

[0182] In S1622, it is determined whether reading of 1 byte or more has been established. Set to Yes if even 1 byte can be read. When reading is zero bytes, all file data is deemed to have been read and branch to No.

In S1623, the number of bytes successfully read in S1621 is assigned to the variable no.

[0184] In S1624, i is stored as a serial number in the serial number area S612. The dynamic encryption key in S510 that forms the seed of the random number is set here.

In S1625, the conversion program described in FIGS. 8 and 9 is executed. In FIG. 8, S810 is assumed to store the memory start address where S510 storing the seed information exists.

It is assumed that the memory start address of daUbl is stored in S811. S812 shall store the value of ip. S813 shall store the value of no.

In S1626, dat_tbl is written to the conversion destination file. Write sequentially in binary mode.

[0187] In S1627, the value of no is added to the value of ip in preparation for the next loop. In S1628, time information is set in the conversion destination file. This time information is the time information acquired in S1619. This time information is written as the create time for the conversion destination file.

By setting this time information, decoding can be performed the next time the conversion destination file is called in the present embodiment.

In S1629, the conversion source file is closed. In S1630, the conversion destination file is closed.

According to the present embodiment, encryption or decryption can be easily performed by file processing.

[0190] [Example 4]

[0191] This embodiment, which will be subsequently introduced, is also a simple application program for performing encryption key or decryption key. The encryption / decryption process itself uses an encryption device and a decryption device that execute the program of the second embodiment. FIG. 17 describes the processing flow of this embodiment. This embodiment is executed from the basic control software and designates a file to be converted. Read the file you want to convert, convert it, and save the conversion result as a file in the storage device. When it is applied once to the application shown in this embodiment, encryption is performed. When the generated result is applied to this application again, it is decrypted.

[0193] S1710 performs initialization. The 4-byte variables ip, no, and i are reserved. Similarly, the memory area used as S510 is secured. Similarly, secure dat_tbl as a working memory area for reading and writing files.

[0194] daUbl is the size of RND_SIZE. Similarly, rnd_tbl I, rnd_tbl2, and rnd_tbl3 are secured as array variables for storing the random number table. All three sizes are RND_SIZE.

[0195] S1711 assigns zero to the variable ip.

[0196] In S1712, the storage area of S512 is cleared to zero. In the S512 area, it is avoided here that the conversion result becomes indefinite due to the indefinite memory initial value.

[0197] In S1713, the file name of the conversion source is input. This asks the executor of the application interactively about the path and file name on the disk. The file specified here is the target of conversion. Also, the creation time (time information) of the file specified here is acquired and stored.

In S1714, the conversion source file name is opened in the binary read mode.

In S1715, the conversion destination file name is opened in the binary write mode. In this example, the file name at the time of opening is the same as the conversion source file specified in S1713, with the character string ".enc" added to the end of the file name acquired in S1713. Shall.

[0200] In S1716, terminal information is acquired. Specifically, it is assumed that the specific information of the computer system on which this embodiment operates is acquired. Here, it is assumed that the HDD volume serial number S517 is stored in the computer specific information area S512.

[0201] In S1717, a random number table is stored in rnd_tbll. Random numbers are generated by executing the programs in Fig. 10 and Fig. 11, and stored in rnd_tbll. That is, the memory address where S510 exists is stored in S1010 of FIG. In S1011, the memory address where rnd_tbll exists is stored. Then, execute the program in Fig. 11 to obtain a random number table in rnd_tbll.

[0202] In S1718, information on devices connected to the computer system is acquired. Execute the program shown in Fig. 12 and register the device information in the device specific information area S513. When no device is connected, this area shall be cleared to zero, and then the FFFF value of the hexadecimal code will be placed in the first 4 bytes. If this is zero, the overall value of S510 will be the same as S5 10 set in S1717, that is, the same seed will be given, and as a result, the random table contents of rnd_tbll and rnd_tbl2 will be the same, which is not preferable. It is. Therefore, FFFF is given so that it is non-zero when device information cannot be acquired.

[0203] In S1719, a random number table is stored in rnd_tbl2. Generates random numbers by executing the programs in Fig. 10 and Fig. 11 and stores them in rnd_tbl2. That is, the memory address where S510 exists is stored in S1010 of FIG. In addition, the memory address where rnd_tbl2 exists is stored in S1011. Then execute the program in Fig. 11 to obtain a random number table in rnd_tbl2.

[0204] In S1720, the creation time of the file acquired in S1713 is acquired. Create time is the time information when the file was created. This time information is stored in the time information area S611. The create time is used here, but the write time, that is, the last write time may be used. The important thing is to unify the time information used as the encryption key. In this embodiment, the creation time is unified.

In the present embodiment, the unset encryption key that constitutes S510 is not used here. Unused areas shall have a value of zero.

[0206] In S1721, a random number table is stored in rnd_tbl3. A random number is generated by executing the programs in Fig. 10 and Fig. 11, and stored in rnd_tbl3. That is, the memory address where S510 exists is stored in S1010 of FIG. Store the memory address where rnd_tbl3 exists in S1011. Then, execute the program in Fig. 11 to obtain a random number table in rnd_tbl3.

S1722 is a permanent loop that configures i as a counter. The initial value of i is set to zero, and the value of i is incremented by 1 for each loop.

[0208] In S1723, the conversion source file is read sequentially in the binary mode by the size of RND_SIZE. The read data is stored in daUbl. The remaining amount of data in the file is less than RND_SIZE! / Sometimes, only the amount that exists is read. [0209] In S1724, it is determined whether reading is successful even with one byte. Set to Yes if even 1 byte can be read. When reading is zero bytes, it is regarded as the end of reading all file data, and the process branches to N °.

[0210] In S1725, the number of bytes successfully read in S1723 is assigned to variable no.

[0211] In S1726, i is stored as a serial number in the serial number area S612. The dynamic encryption key in S510 that forms the seed of the random number is set here.

In S1727, the conversion program described in FIGS. 14 and 15 is executed. The settings for each input / output in Fig. 14 are described below.

[0213] The memory area start address where rnd_tbl3 exists is stored in S1410.

[0214] The memory area start address where rnd_tbl2 exists is stored in S1411.

[0215] The memory area start address where rnd_tbll exists is stored in S1412.

[0216] The memory start address of dat_tbl is stored in S1413. It is assumed that the value of ip is stored in S1414. S1415 shall store the value of no.

In S1728, dat_tbl is written to the conversion destination file. Write sequentially in binary mode.

[0218] In S1729, the value of no is added to the value of ip in preparation for the next loop.

[0219] In S1730, time information is set in the conversion destination file. This time information is the time information acquired in S1713. In addition, this time information is written as the create time for the conversion destination file. By setting this time information, decoding can be performed the next time the conversion destination file is called in this embodiment.

In S1731, the conversion source file is closed. In S1732, the conversion destination file is closed.

[0221] Even in this way, encryption or decryption can be easily performed by file processing. [0222] [Embodiment 5]

[0223] In the fifth embodiment to be described subsequently, the random number generated in the first embodiment is further influenced by time information, disturbing the random number table, and eliminating the possibility of duplication between the generated random number tables. It is. [0224] The Mersenne Twister, which is a random number generator premised on the first embodiment, has an internal memory of 624 words (one word is 4 bytes). If the code is different, it is guaranteed that at least one word out of 624 words (2496 bytes) belonging to the seed will generate a different random number table. In other words, it is guaranteed that a different random number table is generated in units of 2496 bytes. Conversely, in small tables below 2496, the same random number table may appear partially.

[0225] In this example, a mechanism that eliminates the possibility of partial duplication in the random number table by performing disturbance without duplication in accordance with time-series changes within the range of a small random number table of 2496 bytes or less. It is a squeaky thing.

FIG. 19 shows the mechanism realized by a program. FIG. 19 shows the extracted S1116 process (arbitrary black box process) described in FIG. The present embodiment is realized by incorporating the program of FIG. 19 into S1116 of the first embodiment.

[0227] S1910 checks the remainder of 3 of the value indicated by the loop counter i! /. If the remainder is zero, the process branches to S1911. If the remainder is 1, the process branches to S1912. If the remainder is 2, the process branches to S1913.

In S1911, the upper 4 bytes of time information S611 and the stored value 4 bytes of the memory at the address indicated by variable ptr are exclusive-ORed and stored in the address indicated by ptr.

[0229] In S1912, an exclusive OR of the lower 4 bytes of the time information S611 and the 4 bytes of the address indicated by the variable ptr is taken and stored in the address indicated by ptr.

[0230] In S1913, the exclusive OR of S612, that is, the 4-byte serial number and the 4 bytes of the address indicated by the variable ptr is taken and stored in the address indicated by ptr! /.

[0231] As described above, power is disturbed in units of 12 bytes (4 bytes x 3). This twelve-byte unit force disturbance can be performed without any overlap in the time series. As a result, random numbers that do not overlap can be generated at intervals of 3 bytes for the random numbers generated by the random number generator.

Brief Description of Drawings

[0232] [FIG. 1] An explanatory diagram showing a period of a pseudo-random number.

FIG. 2 is an explanatory diagram showing data encryption. FIG. 3 is a diagram showing a physical overview of the example.

FIG. 4 is a diagram illustrating a fingerprint authentication storage device.

FIG. 5 is a diagram illustrating n statically determined encryption keys.

FIG. 6 is a diagram illustrating a dynamic encryption key.

FIG. 7 is a diagram for explaining the concept of actual encryption / decryption.

FIG. 8 is a diagram for explaining the input / output of the encryption / decryption device and the function f. (Example 1)

FIG. 9 is a diagram for explaining processing of a conversion program. (Example 1)

FIG. 10 is an explanatory diagram showing input / output of a random number table generation program. (Example 1)

FIG. 11 is an explanatory diagram showing a random number table generation program. (Example 1)

FIG. 12 is an explanatory diagram of a program for acquiring a unique code of a unique device.

FIG. 13 is an explanatory diagram showing synthesis of a random number table using n random number tables.

FIG. 14 is an explanatory diagram showing input / output of the encryption key decryption program. (Example 2)

FIG. 15 is an explanatory diagram showing the flow of a conversion program. (Example 2)

FIG. 16 is an explanatory diagram showing a conversion application. (Example 3)

FIG. 17 is an explanatory diagram showing a conversion application. (Example 4)

FIG. 18 is an explanatory diagram showing a device as a host.

FIG. 19 is an explanatory diagram showing an example of S1116 processing. (Example 5)

Explanation of symbols

S1811: Central processing unit (CPU).

S1812- --ROMBIOS ₀

S1813 '"Memory device.

S1814, S1817, S1818 "'system bus.

S1815, S1816 "adapter.

S1820 "'Host I / F.

S1830 "-HDD.

S1819 "'Reader / Writer.

S 1840 · “USB device.

Claims

The scope of the claims

[1] A random number table generator by computer processing,

Means for generating a random number table that has a power of more than the limit number n (n is a positive number), an area for storing the generated random number table,

An area for storing the use limit number n;

Means for generating another random number table without using elements after n + 1 of the random number table when the random number table element is used up to the use limit number n;

A random number table generator characterized by comprising:

[2] A random number generator for computer processing,

Means for obtaining a plurality of encryption keys of different origins;

An area for storing a plurality of encryption keys of different origins;

Means for generating one random number table using a plurality of encryption keys of different origins as seeds; an area for storing the random number table;

A random number table generator characterized by comprising:

[3] The random number table generation device according to claim 1 or 2, wherein the random number table generation device generates the random number table by a pseudo random number generation method using Mersenne prime numbers or a pseudo random number generation method by a Mersenne twister. Table generator.

4. The random number table generation device according to claim 2, wherein time information is included as one of the encryption keys.

[5] In the random number table generator according to claim 4,

A random number table generating device comprising means for calculating a result of calculating the random number table and the time information as the random number table.

6. The random number table generating device according to claim 2, wherein one of the encryption keys includes unique information of a device connected to a computer system as the random number table generating device.

7. The random number table generating device according to claim 2, wherein one of the encryption keys includes unique information of the computer system itself as the random number table generating device.

[8] Built into the computer system as unique information of the computer system 12. The random number table generation device according to claim 11, wherein the serial number of the storage device is acquired.

9. The random number table generator according to claim 2, wherein one of the encryption keys includes user biometric information.

10. The random number table generator according to claim 2, wherein one of the encryption keys includes a keyword that is input or automatically set by an input device.

11. The random number table generating apparatus according to claim 2, further comprising means for giving a unique code such as a serial number as one of the encryption keys for each of the generated random number tables.

[12] In the random number table generator according to claim 1 or 2,

A random number table generating apparatus comprising means for generating a plurality of random number tables and generating a new random number sequence by combining elements of the plurality of random number tables.

[13] The random number table generator according to any one of claims 1 to 12,

An area for storing information to be encrypted or decrypted;

Means for encrypting or decrypting the information to be encrypted or decrypted using the random number table;

An area for storing the encrypted or decrypted information,

The means for encrypting or decrypting individually generates a random number table with different seeds for each information to be encrypted or decrypted, and encrypts it using a recently generated random number table. Or an encryption Z decryption device characterized by performing decryption.

[14] The random number table generator according to [4] or [5], wherein the time information is time information related to the information to be encrypted or decrypted. Encryption Z decryption device.

[15] In the encryption Z decryption device according to claim 13,

Means for storing the encrypted information in a storage device as a file by the file management system of the basic control software of the computer;

Means for storing the time information used for the encryption key in the file as a generation time or an update time of the file.

[16] In the random number table generator according to claim 11, a value indicating a recording unit of a storage device such as a sector and a block is given as the unique code.

The random number table used when encrypting or decrypting information recorded in a certain recording unit is characterized by comprising means for generating the unique code by giving a value indicating the recording unit to the unique code. 14. The encryption key decryption device according to claim 13.

[17] The device according to any one of claims 1 to 16,

A program for causing a computer to execute the operation of each means.

18. A computer-readable recording medium on which the program according to claim 17 is recorded.