DESIGN OF A CIRCUIT SUITABLE FOR GENERATING RANDOM BITS AND CIRCUIT FOR GENERATING RANDOM BITS

摘要

The invention relates to a method and an apparatus for designing a circuit suitable for generating random bits and to a circuit for generating random bits. A random bit string which is used as a binary random number is generated, for example. The proposed method and the apparatus as well as the circuit are used to implement random number generators, for example. A jth specific function from a set of bijective mappings is selected as the jth function, wherein the jth specific function carries out a jth fixed-point-free mapping. At least one ith mapping device is then selected. An ith specific function from a set of bijective mappings is assigned to the ith function, with the result that an ith concatenation of the i functions carries out an ith fixed-point-free mapping.

主权项

1. A method for designing a circuit suitable for generating random bits, wherein the circuit comprises a number m of mapping devices, wherein each of the mapping devices is supplied a number n of input bits, where n is a value greater than 1, and wherein each of the mapping devices uses a respective function to carry out a bijective mapping of the n input bits to n output bits, the method comprising:
(a) selecting a j-th mapping device from a first of the mapping devices to the m-th mapping device and prescribing a j-th specific function from a set of bijective mappings as the j-th function, wherein a j-th concatenation of the j functions carries out a j-th fixed-point-free mapping when the j-th specific function is prescribed as the j-th function; applying, by the j-th concatenation, the j functions in an ascending order starting with the first function; selecting at least one i-th mapping device from the first mapping device to the m-th mapping device, where i is not equal to j, and prescribing an i-th specific function from a set of bijective mappings as the i-th function, wherein an i-th concatenation of the i functions carries out an i-th fixed-point-free mapping when the i-th specific function is prescribed as the i-th function; and applying, by the i-th concatenation, the i functions in an ascending order starting with the first function.