Abstract:
A method enabling a personal computer to be authenticated by a server is provided. The method comprises the step, which includes for the user in launching the execution of a log-on procedure software, introducing personal identifiers providing access to a signature private key 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, a public exponent and at least a pair of ephemeral pubic numbers and ephemeral private numbers related by a generic equation of the type: G=Qv (mod n) or G×Qv=1 (mod n), an ephemeral certificate linking, by means of said signature private key, Id and public ephemeral module. The public ephemeral module is of reduced size relative to the signature private key.
Abstract:
A method enabling a personal computer to be authenticated by a server is provided. The method comprises the step, which includes for the user in launching the execution of a log-on procedure software, introducing personal identifiers providing access to a signature private key 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, a public exponent and at least a pair of ephemeral pubic numbers and ephemeral private numbers related by a generic equation of the type: G=Qv (mod n) or G×Qv=1 (mod n), an ephemeral certificate linking, by means of said signature private key, Id and public ephemeral module. The public ephemeral module is of reduced size relative to the signature private key.
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: x2≡gi mod n and x2≡−gi mod n cannot de solved in x in the ring of integers modulo n, and such that the equation xv≡gi2 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=2k, 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是 安全参数。
Abstract:
One chip microprocessor, which is more particularly designed to execute culation algorithms of a public code encoding system formed by a public function and a secret inverse function of the type comprising at least one programmable read-only memory, a processing unit and an input/output device, wherein it comprises a memory, in which is recorded at least one algorithm corresponding to the performance of said secret function, and wherein the programmable read-only memory contains the secret parameters constituting the secret code and recorded in an area of the read-only memory which is inaccesible from the outside, the processing unit including the multiplying circuits necessary for the execution of the algorithm.