FR2566152A1 - Method for identification and authentication, by anti-fraud mathematical code, which can be affixed to documents or objects and provides absolute protection against false use and protection for lost or stolen items - Google Patents

Abstract

It relates to a method for identification and authentication, by anti-fraud mathematical code, which can be affixed to documents or objects and provides absolute protection against false use and protection for lost or stolen items. It consists in making public (printed or etched with the explanatory symbols) on the item to be protected a ''TEST NUMBER'' which is the partial result of multiplication between a multiplicand and this same factor reversed; the latter is known only to the holder and serves as key. The partial product (the first figures) of the result of this operation is the ''TEST NUMBER'' which is made public, which can be reconstituted only by the bearer of the key. This coding is particularly intended for cheques, credit cards, Treasury bills, etc., or objects of value, paintings, etc.

Description

 The present invention relates to a method of identification and authentication, by anti-fraud code affixable to documents or objects and providing a rigorous protection against the use of f @@ x and lost or stolen coins.

 Currently some documents and objects, lost or lost, are used frequently by third parties despite (ineffective) controls. On the other hand fakes circulate without it being. possible to detect them at the presentation.

This coding according to the invention makes the mathematical control,
That is rigorous; It makes it possible to immediately detect any fraudulent use of the coded piece by an unauthorized third party.

 It can also detect false, even perfect; moreover, the signature control, often random (whether manual or electronic) is no longer necessary.

 The principle consists in making public on the part to be protected (printed or engraved, with the explanatory symbols) a "NUMBER TEST", partial product of a multiplication of which the multiplicande (number of digits according to the security sought) and the multiplier , which is the inverted multiplicand, are known only to the holder and serve as a key.

The first figures of the result (number identical to the multiplicand) represent the public "TEST NUMBER", which can only be reconstituted by the holder of the key (\ multiplicand) following the result not being revealed *
Example Fe formula made public:

<tb> A <SEP> (8 <SEP> digits) <SEP> x <SEP> A <SEP> (inverted) <SEP> =
<tb> The test; identification consists for the recipient g, respecting the indications above, to "calculate the identity" of the carrier, performing the operation with the key provided by the latter; that is, in the example above ((the key being a telephone number; 7255 10 36):

<tb> 7255 <SEP> 10 <SEP> 36 <SEP> x <SEP> 63 <SEP> 01 <SEP> 5527
<tb> then check that its result is identical to "NOMBR
TEST "public, (total test time 15 seconds).

As for the control of authenticity, it is automatic, by the fact that a false piece can carry me its "NUMBER
TEST "original, because it would then be unusable, the control is therefore rigorous and could be made by the recipient, provided to be in direct contact with the issuer of the trap.

 This "NUMBER TEST" can be composed by the holder, with a personal key, which peimet an excellent memorization and ensures a total security, because in this case, even the bank issuing a checkbook for example, ignores the key of the holder .

 The degree of security (number of possible combinations) can be determined according to the number of digits used; in the example cited it is 100 million, with a 10-digit key it would be 10 billion, but could as well reach an undecipherable level even for the most powerful computers.

The only way to decrypt this code is the trial of all your possible combinations;
This coding according to the invention relates primarily to checks and credit cards, particularly affected by this type of fraud, but also treasury bills, booklets Savings, identity cards etc ...... , ainst that some valuables, table @@ etc .........

Claims (6)

 I) Method of identification and authentication by anti fraud fraud code, affixable on documents or objects and providing rigorous protection against the use of forgery and lost or stolen coins.  Characterized by the fact that a "TEST NUMBER", partial product of a mat @ ematic operation against fraud (multiplication), is made public on the part to be protected (printed or engraved with the use symbols). NUMBER TEST "can only be reconstituted by the holder of the key (multiplicand and multiplicatur).  2) Method according to claim I, characterized in that the anti-fraud mathematical operation consists of a multiplication between a multiplicand (whose number of digits depends on the security sought) and a multiplier which is the inverted multiplicand.  3) A method according to any one of claims 1 and 2, characterized in that the "NUMBER TEST" public representemlement semlement the first half of the result of the multiplication (# ê number of digits than the multiplicande) the others being me not deviate.  4) Method according to any one of claims 1 to 3, characterized in that the symbols of use and the "NUMBER: TEST "are made public as follows:

<Tb> <tb> A <SEP> (8 <SEP> digits) <SEP> x <SEP> A <SEP> (inverted) <SEP> = <SEP> 457 <SEP> 18 <SEP> 417 ...... "A" being the key multiplicand, with the number of digits used; the control must respect these indications.  5) Method according to any one of claims 1 to 4, characterized in that the control consists for the recipient, to find the "NUMBER TEST" public by performing the multiplication

 thanks to the key communicated by the wearer.  6) Method according to any one of claims 1 to 3, characterized in that the "NUMBER TEST" can be composed by the sole holder, with a personal key g, which. allows excellent memorization and ensures total secrecy.