摘要:
An electronic device for processing digital data has an input for receiving data to be processed and processor means suitable for transforming the input data in non-falsifiable manner into a result condensed data block. The processor means tools that are simple and fast, such as arrays and logic operators, to provide an elementary anti-collision operation for use in condensing the digital data.
摘要:
This invention relates to an authentication process with an access control and/or payment system that maintains anonymity of the customer towards a third party, characterized in that a single-directional authentication protocol is used to send an authentication sequence that is completely different for each transaction, so that it is impossible for a third party to determine the identity of this customer, or even to determine which transactions are sent by a particular customer.
摘要:
A process for controlling communication between a first and a second smart card using key-based cryptography is provided. In the disclosed process, a first identity code is stored in the first smart card and a second identity code is stored in the second smart card. The smart cards are customized by writing into each of the smart cards an identical group secret key and respective algorithms for processing the identical group secret key and the first and second identity codes stored in the first and second smart cards, respectively. The smart cards are used by transmitting the first identity code to the second smart card, transmitting the second identity code to the first smart card, and calculating using the respective processing algorithms stored in the smart cards, first and second session keys for the first and second smart cards, respectively.
摘要:
A traceable method for encrypting and/or decrypting data broadcast by at least one transmitter towards several decoders includes the steps: during encryption of broadcast data, the transmitter implements (in 86) at least one first secret function to transform an unencrypted message into an encrypted message; and during decryption of the broadcast data, all the decoders implement (in 92) at least one common second secret function, each decoder using therefor a mathematical description of the second function stored in a memory (21), the mathematical description of the second function being different from one decoder to another or from one group of decoders to another such that the mathematical description used identifies exclusively the particular decoder or group of decoders.
摘要:
A process for the identification of a claimant by a verifier. The process is of the public key type, where the public exponent is equal to 3. The claimant draws at random a first exponent .alpha., calculates r=g.sup..alpha. mod n and transmits R=r.sup.3. The verifier draws at random a second exponent .beta., calculates t=g.sup..beta. mod n, calculates T=t.sup.3 mod n and h=H.sub.1 (Z), where H.sub.1 is a hash function, and calculates Z=R.sup.3 mod n. The verifier transmits to the claimant the numbers T and h. The claimant calculates Y=T.sup..alpha. mod n, verifies the result H.sub.1 (Y), calculates H=H.sub.2 (Y), where H.sub.2 is another hash function, calculates z=rS mod n, and transmits z and H. The claimant also has a secret number S equal to the modulo n cubic root of a number I deduced from its identity so that the number S verifies S.sup.3 =I mod n. The verifier verifies that H received is equal to H.sub.2 (Z) and that z.sup.3 is equal to RI mod n.
摘要翻译:验证者识别索赔人的过程。 该过程是公钥类型,其中公共指数等于3.索赔人随机抽取第一指数α,计算r = g alpha mod n并发送R = r3。 验证者随机抽取第二指数β,计算t = g beta mod n,计算T = t3 mod n和h = H1(Z),其中H1是散列函数,并计算Z = R3 mod n。 验证者向索赔人传送号码T和h。 索赔人计算Y = Tαmod n,验证结果H1(Y),计算H = H2(Y),其中H2是另一个哈希函数,计算z = rS mod n,并发送z和H.索赔人也有 秘密数S等于从其身份推断的数字的模n立方根,使得数S验证S3 = I mod n。 验证者验证H接收等于H2(Z),并且z3等于RI mod n。
摘要:
A cryptographic process is for protection against fraud. An allocation of a secret key K is made to a card and to an application and an input value R is defined. The card and application calculate the modulo 2 scalar product of binary vectors constituted by words of R and words of K. The application checks whether the result obtained by the card is in agreement with its own result. An exemplary application is low cost cards.
摘要:
The present invention relates to a cryptographic method of protecting an electronic chip against fraud and a device including an electronic chip which is adapted to protect the electronic chip against fraud. The method includes: mixing some or all of the input parameters (Em) to supply an output data item E′=(e′1, e′2, . . . , e′n, . . . , e′N), changing the state of a finite state automaton from an old state to a new state as a function of the data item E′=(e′1, e′2, . . . , e′n, . . . , e′N), and calculating a certificate (S) by means of an output function having at least one state of the automaton as an input argument. The device includes: mixing means, a finite state automaton, and output means for calculating a certificate (S).
摘要:
A method and apparatus are provided to perform a cryptographic task on at least one numerical datum in an electronic hardware component. The method includes a step of at least partial use of an encryption function. This encryption function includes a basic encryption function obtained by the addition between an intermediate function arising from composition of a coding function with a first function, and a second function. This method can be applied to the encryption of a datum or to the decryption of a datum. Also, a method is provided for generating a public key and a device able to implement one of these methods.
摘要:
A method of generating a pseudorandom sequence of terms belonging to a finite body K of cardinal q≧2 intended to be used in a cryptographic procedure, said method comprising the iterative calculation, from an initialization n-tuple X(0)=(X(0)1, X(0)2, . . . , X(0)n), where n≧2, of elements of K, of n-tuples X(i)=(X(i)1, X(i)2, . . . , X(i)n) of elements of K (where i=1, 2, . . . ), each n-tuple X(i) being obtained on iteration number i in a predetermined manner at least from certain components Y(i)k of an m-tuple Y(i)=(Y(i)1, Y(i)2, . . . , Y(i)m), where m≧n, of elements of K and the terms of said pseudorandom sequence being extracted in a predetermined manner from the n-tuples X and/or the m-tuples Y. For at least one value of i, among said components Y(i)k of the m-tuple Y(i) that are used to obtain the multiplet X(i), at least E(n/2) of them are each represented by a predetermined second degree polynomial function, with coefficients in K, of the components of the n-tuple X(i−1).
摘要:
The invention relates to a secure communication between an electronic label (A) and a reader (B), in particular for the authentication of the label by the reader, in which: the reader (31) transmits at least one datum (Ch) to the label, the label calculates a combination comprising at least the datum from the reader (Ch)) and a secret (Si) specific to the label, and the label communicates (32) the result (C(Si, Ch)) of the combination to the reader (B) for verification purposes. The aforementioned combination (C(Si, Ch)) is preferably calculated using a current secret value (Si) delivered by a pseudo-random number generator (33). The reader (B) is also provided with a homologous pseudo-random generator.