公开(公告)号：US20040153291A1

公开(公告)日：2004-08-05

申请号：US10712988

申请日：2003-11-12

Applicant: STMicroelectronics S.r.l.

Inventor： Ljupco Kocarev ,  Paolo Amato ,  Gianguido Rizzotto

IPC: H03F001/26

CPC classification number: H04L9/001 ,  G06F7/582 ,  H04L9/0662 ,  H04L2209/20

Abstract: A method for generating cryptographically secure (or unpredictable) pseudo-random numbers uses simple functions whose inverse is not a well-defined function and has a large number of branches, although the inverse could be easily computed on each particular branch. In this way the sequence of numbers is practically unpredictable and at the same time may be generated using very simple functions. A generator of such a pseudo-random bit sequence comprises circuit means for storing bit strings representing integer numbers of the pseudo-random sequence; a shift register coupled to the circuit means; a command circuit generating shift commands for the shift register; second circuit means for storing the bits output by the shift register; an adder modulo 2 summing the bits stored in the second circuit means, generating a bit of the chaos-based pseudo-random bit sequence; a second adder summing up the bit strings currently stored in the shift register and in the first circuit means, generating a bit string representing a successive number of the pseudo-random sequence.

Abstract translation: 用于生成加密安全（或不可预测）伪随机数的方法使用简单函数，其逆并不是明确定义的函数，并且具有大量的分支，尽管可以在每个特定分支上容易地计算逆。 以这种方式，数字序列实际上是不可预测的，同时可以使用非常简单的功能来产生。 这种伪随机比特序列的生成器包括用于存储表示整数个伪随机序列的比特串的电路装置; 耦合到所述电路装置的移位寄存器; 产生移位寄存器的移位指令的指令电路; 第二电路装置，用于存储由移位寄存器输出的位; 加法器模2将存储在第二电路装置中的比特相加，产生基于混沌的伪随机比特序列的比特; 第二加法器对当前存储在移位寄存器和第一电路装置中的位串进行相加，生成表示连续数量的伪随机序列的比特串。

公开(公告)号：US20030149511A1

公开(公告)日：2003-08-07

申请号：US10167058

申请日：2002-06-11

Applicant: STMicroelectronics S.r.l.

Inventor： Gianguido Rizzotto ,  Paolo Amato ,  Domenico Porto

IPC: G05B015/00 ,  G05B019/00

CPC classification number: G06N99/002 ,  B82Y10/00

Abstract: A quantum gate performs the superposition operation of a Grover's or of a Deutsch-Jozsa's quantum algorithm in a very fast manner. This is done by performing all multiplications by using logic gates that immediately outputs the result. The superposition operation includes performing the Hadamard rotation over an input set of vectors for producing a set of rotated vectors, and calculating the tensor product of all the rotated vectors for outputting a linear superposition set of vectors. The tensor product of all the rotated vectors is carried out by the logic gates.

Abstract translation: 量子门以非常快的速度执行Grover或Deutsch-Jozsa的量子算法的叠加操作。 这是通过使用立即输出结果的逻辑门执行所有乘法来完成的。 叠加操作包括在矢量的输入集上执行Hadamard旋转以产生一组旋转矢量，以及计算用于输出矢量的线性叠加集合的所有旋转矢量的张量乘积。 所有旋转矢量的张量积由逻辑门执行。