公开(公告)号：EP2962185B1

公开(公告)日：2016-11-16

申请号：EP14705518.0

申请日：2014-02-20

申请人： Koninklijke Philips N.V.

发明人： GARCIA MORCHON, Oscar ,  KUMAR, Sandeep Shankaran ,  TOLHUIZEN, Ludovicus Marinus Gerardus Maria

IPC分类号： G06F7/58 ,  H04L9/06

CPC分类号： G06F7/586 ,  H04L9/0656

公开(公告)号：EP2884386B1

公开(公告)日：2016-01-13

申请号：EP14191819.3

申请日：2014-11-05

申请人： Nakazawa, Hiroshi

发明人： Nakazawa, Hiroshi ,  Nakazawa, Naoya

IPC分类号： G06F7/58

CPC分类号： G06F7/586

公开(公告)号：EP2304547A1

公开(公告)日：2011-04-06

申请号：EP09755645.0

申请日：2009-05-20

申请人： Harris Corporation

发明人： MICHAELS, Alan, J. ,  CHESTER, David, B.

IPC分类号： G06F7/58 ,  G06F7/72

CPC分类号： G06F7/586 ,  G06F7/72

摘要： A method for advancing or stepping back a chaotic sequence generation. The method involves selecting a plurality of polynomial equations. The method also involves selecting a value for the acc-dec variable v for advancing or stepping back a chaotic sequence generation by at least one cycle at a given time. The method further involves using residue arithmetic operations to respectively determine solutions for the polynomial equations using the acc-dec variable v. The solutions are iteratively computed and expressed as residue values. The method involves determining a series of digits in a weighted number system based on the residue values.

公开(公告)号：EP1360767A2

公开(公告)日：2003-11-12

申请号：EP01270019.1

申请日：2001-12-07

申请人： Cryptico A/S

发明人： PETERSEN, Mette Vesterager ,  SORENSEN, Hans, Martin, Boesgaard

IPC分类号： H03M1/00

CPC分类号： H04L9/001 ,  G06F7/586 ,  G06F17/10 ,  H04L9/0662 ,  H04L2209/26

摘要： A method of performing numerical computations in a mathematical system comprises expressing the mathematical system in discrete terms, using fixed-point variables in the computations, and extracting a sub-set of digits of a number. The sub-set of digits may represent a random or pseudo-random number. The mathematical system may be a system of non-linear differential equations, such as a chaotic system, for example a system with a positive Lyapunov exponent, or a discrete mapping, such as a logistic map, an Anosov or a Hénon map. The method is applicable to encryption and decryption algorithms, including stream ciphers and block ciphers, systems for generating a digital signature, Hash functions, and MAC (Message Authentication Code) functions. A test for periodical behaviour of a solution to the mathematical system is provided.

摘要翻译： 在数学系统中执行的数值计算的方法包括表达所述数学系统在离散的计算，在计算中使用定点变量，并提取子集的号码的数字。 的数字的子集可以表示一个随机或伪随机数。 的数学系统可以是非线性差分方程的系统，检查作为混沌系统，对于实施例以积极的Lyapunov指数，或离散的映射的系统中，检查作为逻辑映射到阿诺索夫或Henon映射。 该方法适用于加密和解密的算法，包括流密码和块密码，用于产生数字签名的系统中，散列函数，和MAC（消息认证码）功能。 提供了一种解决的数学系统的周期行为测试。

公开(公告)号：EP1031207A1

公开(公告)日：2000-08-30

申请号：EP98953144.7

申请日：1998-11-06

申请人： Telefonaktiebolaget L M Ericsson (Publ)

发明人： SMEETS, Ben

IPC分类号： H04L9/22 ,  G06F7/58

CPC分类号： G06F7/584 ,  G06F7/586 ,  G06F2207/581 ,  G06F2207/583 ,  H04L9/0662 ,  H04L2209/125

摘要： A pseudo-random number generator (10), and an associated method, generates a pseudo-random number. The pseudo-random number is a complex, linear combination of values of input sequences provided to the generator (10) and exhibits little correlation with such input values. The generator includes a summation combiner (12) and an IIR (infinite impulse response) filter (18) connected in a feedback connection with the summation combiner (12). Because of the low correlation of the pseudo-random number and input values provided to the generator (10), the pseudo-random number is less susceptible to cryptanalysis by an unauthorized party.

公开(公告)号：EP0864124A1

公开(公告)日：1998-09-16

申请号：EP96936951.0

申请日：1996-10-25

申请人： BELL COMMUNICATIONS RESEARCH, INC.

发明人： AIELLO, William, A. ,  VENKATESAN, Ramarathnam

IPC分类号： G06F7 ,  G09C1 ,  H04L9

CPC分类号： G06F7/586 ,  H04L9/0662 ,  H04L2209/12

摘要： Methodology and concomitant circuitry to generate cryptographically strong pseudo-random bit streams utilize secure block cypher encoders. Each block cypher encoder (550) has a random key (540) and a first seed (510) as an input, and the output of each encoder is fed back to connect to its input. The first seed serves as the initial input, and each subsequent input is the immediate output of the block cypher encoder. Each bit in the cryptographically strong pseudo-random bit stream is related to a first inner product between input to the block cypher encoder and a second seed (520) and a second inner product (560) between the random key and a third seed (570).

公开(公告)号：EP0388131B1

公开(公告)日：1996-03-06

申请号：EP90302630.0

申请日：1990-03-13

申请人： Oki Electric Industry Co., Ltd.

发明人： Tanagawa, Kouji, c/o Oki Electric Ind. Co. Ltd.

IPC分类号： G06F7/58

CPC分类号： G06F7/588 ,  G06F7/586

公开(公告)号：EP0529512A2

公开(公告)日：1993-03-03

申请号：EP92114216.2

申请日：1992-08-20

申请人： FUJITSU LIMITED

发明人： Fujisaki, Masahide, c/o Fujitsu Limited ,  Okuda, Motoi, c/o Fujitsu Limited

IPC分类号： G06F7/58

CPC分类号： G06F7/584 ,  G06F7/586 ,  G06F2207/581 ,  G06F2207/583

摘要： In a parallel computer system comprising a plurality of processor elements, a parent processor element (1) generates random-number initial values, and distributes the random-number initial values to child processor elements (2-1, ... 2-i, ... 2-k) using a communication mechanism (4) or a shared memory (5); and the child processor elements (5) conduct processing to generate random-number sequences in accordance with a maximum length shift register sequence (M-sequence) method using the distributed random-number initial values as seeds. Long-period random-number sequences can be generated which are not correlated with each other.

摘要翻译： 在包括多个处理器元件的并行计算机系统中，父处理器元件（1）产生随机数初始值，并将随机数初始值分配给子处理器元件（2-1，... 2-i， ... 2-k），使用通信机制（4）或共享存储器（5）; 并且子处理器元件（5）进行处理以根据使用分布随机数初始值作为种子的最大长度移位寄存器序列（M序列）方法生成随机数序列。 可以生成不相关的长周期随机数序列。

公开(公告)号：EP3245628A1

公开(公告)日：2017-11-22

申请号：EP16707200.8

申请日：2016-01-15

申请人： AD2014 S.r.l.

发明人： PERNA, Amedeo ,  ABRATE, Marco ,  BARBERO, Stefano ,  CERRUTI, Umberto ,  MURRU, Nadir

IPC分类号： G06Q30/06

CPC分类号： G06F17/30598 ,  G06F7/586 ,  G06F7/721 ,  G06F17/30876 ,  G06Q30/0623

摘要： A method for managing virtual objects (O) corresponding to real objects (R), said virtual objects (O) comprising a set (OP) of information or data representing said real object (R), said virtual objects (0) residing in a management system (20), which comprises a computer system (21) accessible by user terminals (13) through a telecommunication network to enable operations to be carried out on said virtual objects (O) in a database (22a) in said computer system (21), said method comprising the operations of: generating (100), in response to a request of a requesting subject (C) to create one or more virtual objects (O) that represent respective real objects (R), corresponding unique identifier codes (Z, zx, c, i) that enable a user terminal (13) to carry out operations on the respective virtual object (O). According to the invention, said unique identifier codes (zx, c, i) enable a user terminal (13) to carry out a procedure of activation of the respective virtual object (O) by associating in the database (22a) comprised in said computer system (21) a unique identifier code (Z, (Z, zx, c, i) to a first basic set (BP) of information supplied by said owning subject (C) at the moment of the request, said identifier code (zx, c, i) being calculated on the basis of: a first value (X) identifying a class to which the virtual object belongs (O); a second value (C) identifying said requesting subject; and a third value (i) representing a label that identifies said virtual object (0) in said class (X).

公开(公告)号：EP2965193A1

公开(公告)日：2016-01-13

申请号：EP14716054.3

申请日：2014-03-04

申请人： Qualcomm Incorporated

发明人： XIAO, Lu ,  ANSARI, Binjan

IPC分类号： G06F7/72 ,  H04L9/30

CPC分类号： G06F7/58 ,  G06F7/586 ,  G06F7/72 ,  G06F2207/7204 ,  H04L9/3033

摘要： One feature pertains to a method that reduces the computational delay associated with generating prime numbers. The method includes generating a first random number having a plurality of bits. A first primality test is then executed on the first random number. Then, it is determined whether the first random number generated fails or passes the first primality test. If the first random number fails the primality test then a portion but not all of the plurality of bits of the first random number are replaced with an equal number of randomly generated bits to generate a second random number. Next, a primality test is again executed on the second random number. This process is repeated until a prime number is detected.