Abstract:
The invention concerns a graphic scene animation data signal, designed for means constructing images capable of being displayed on at least one screen, said graphic scene having probably been loaded in said means constructing images, in the form of a set of objects, some of said objects at least having its own particular identifier, said signal comprising: a single animation mask, delivered as preamble to said animation, and assigning at least one of said objects to an elementary mask comprising: said object identifier, as defined in said graphic scene to be animated; and the designation of at least one dynamic characterisation field of said object, representing a characteristic of said object capable of being modified; animation frames, comprising, according to the order defined by said mask, data updating said object dynamic characterisation fields, so as to modify them, said constructing means decoding said animation mask data, and initialising the animation on the basis thereof, and updating the scene on the basis of said animation fields.
Abstract:
The proof is provided by means of the following parameters: a public module n formed by the product of f prime factors pi, f>2; a public superscript v; m base numbers gi, m>1. The base numbers gi are such that the two equations: x gi mod n and x -gi mod n cannot de solved in x in the ring of integers modulo n, and such that the equation x gi mod n can be solved in x in the ring of integers modulo n in the case where the public superscript v is in the form v = 2 , wherein k is a security parameter.
Abstract translation:通过以下参数提供证明:由f因子pi,f> 2的乘积形成的公共模块n; 公开上标v m基数gi,m> 1。 基数gi使得在整数n的环中x不能在x中解决两个方程:x 2 gi mod n和x 2 -i mod mod n,并且使得方程式x≠gi 在公共上标v为v = 2 k的形式的情况下,可以在整数n的整数环中的x中求解mod n,其中k是安全参数。
Abstract:
The invention concerns a method for representing a three-dimensional scene on screen, whereby a user can move freely virtually. The inventive method comprises the following steps: (a) creating a three-dimensional geometric support delimiting virtually said three-dimensional scene; (b) generating a texture of said scene from two-dimensional images of the latter; (c) supplying said three-dimensional geometric support and said texture of said three-dimensional scene to a computer tool for three-dimensional representation; (d) applying the texture of said three-dimensional scene on said three-dimensional geometric support using said computer tool for three-dimensional representation; and (e) displaying on the screen an image representing part of said three-dimensional geometric support based on the orientation and position of said user relative to said part of said three-dimensional geometric support displayed on the screen.
Abstract:
The invention concerns a method enabling a personal computer (1) to be authenticated by a server (2). The method comprises the step, which consists for the user in launching the execution of a log-on procedure software, by introducing personal identifiers (21) providing access to a signature private key (14) for long-term use relative to the duration of the session. The log-on procedure software produces: identification data of the session Id, a public ephemeral module n (9), a public exponent v and at least a pair of ephemeral public numbers G (11) and ephemeral private numbers Q (12) related by a generic equation of the type: GQ (mod n) or GxQ 1 (mod n), an ephemeral certificate (13) linking, by means of said signature private key (14), Id (8) and n (9). The public ephemeral module n (9) is of reduced size relative to the signature private key (14). The method comprises the step which consists for said user (5) to launch the execution of an evidence software, the step which consists for the server (2) in launching the execution of a control software.
Abstract:
The proof is provided by the following parameters: m pairs of private values Qi and public values Pi, m>1; a public module n formed by the product of f first factors pi, f>2; a public exponent v, bound by the relationship of the type: Gi.Qi mod n or Gi Qi mod n.
Abstract translation:证明由以下参数提供:m对私有值Qi和公共值Pi,m> 1; 由第一因子pi,f> 2的乘积形成的公共模块n; 公共指数v,由类型:Gi.Qi mod n或Gi Qi mod n的关系约束。
Abstract:
A digital broadcasting process, suitable for digital audiobroadcast, comprises encoding the data in the form of binary words using a redundant code to obtain a sequence of modulation symbols and transmitting the symbols in a plurality of subchannels at different frequencies. The symbols are time interlaced with such a distribution that two adjacent symbols cannot be transmitted in time succession and at the same one of the frequencies. Preferably, a Viterbi decoder is used. Particular constructions of an emitter and a receiver are also described.
Abstract:
The invention relates to a method for estimating a propagation channel composed of successive symbols of a multicarrier signal, each comprising at least one reference pilot (513) and a plurality of data-carrying frequencies. Such a method comprises, in particular, at least one step consisting of correcting the at least one reference pilot (513) on the basis of a first estimation of a propagation channel (516), in order to provide a second, more precise estimation of said channel (516).
Abstract:
The invention relates to a radio broadcast method for a multi-carrier digital signal (51), occupying a first frequency band adjacent to at least one second frequency band, each allocated for a second signal (52, 53), said, or at least one of said second signals being an analogue radio broadcast signal. A pre-filtering (54, 55) is applied to the first signal before the transmission thereof, such as to attenuate the power of said first signal at least in a first portion of said first frequency band, adjacent to the second frequency band(s).
Abstract:
Data communication between a processing unit (UT) and external means may take place via a plurality of data streams (FXE1, FXE2, FXS1, FXS2). Means (GESi) check the mutual consistency of said streams and report and correct abnormalities. This self-synchronisation is achieved by inserting separators into the data streams to separate the data, and by means of a freezing mechanism (GL, FC) for freezing the internal operation of the processing unit.
Abstract:
The proof is provided by means of the following parameters: a public module n formed by the product of f prime factors p i , f>2; a public superscript v; m base numbers g i , m>1. The base numbers g i are such that the two equations: x 2 ≡g i mod n and x 2 ≡-g i mod n cannot de solved in x in the ring of integers modulo n, and such that the equation x v ≡g i 2 mod n can be solved in x in the ring of integers modulo n in the case where the public superscript v is in the form v=2 k , wherein k is a security parameter.
Abstract translation:证明是通过以下参数来提供的:由f因子p ,f> 2的乘积形成的公共模块n; 公开上标v m个碱基数m,m> 1。 基数g i i使得以下两个等式:x 2 mod n和x 2 在模n的整数环中,不能在x中求解≡-g≠mod n,并且使得等式x≡g< 在公共上标v的形式为v = 2K的情况下,可以在整数n的整数环中的x中求解,其中k是 安全参数。