Patents by Inventor Jean-Jacques Quisquater

Jean-Jacques Quisquater has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20200183973
    Abstract: A new watermarking concept is presented. The method exploits audio fingerprinting in order to reuse the same watermark payloads between audio copies originating from different audio masters. This is achieved by using fingerprints of audio master to derive unique watermarking zones for its associated copies, therefore obviating the need of adding overhead synchronization bits to locate watermark positions. Thanks to a shorter watermark payload enabling a higher repetition rate of the watermark within the host media, the present methods have been validated via simulations to be robust against typical audio attacks such as MP3 compression, cropping, jittering, and zeros inserting.
    Type: Application
    Filed: May 21, 2018
    Publication date: June 11, 2020
    Inventors: Youri Balcers, Jimmy Nsenga, Jean-Jacques Quisquater
  • Patent number: 7680271
    Abstract: A cryptography method involving a keyholder having a number m?1 of private keys Q1, Q2, . . . , Qm and respective public keys G1, G2, . . . , Gm, each pair of keys (Qi, Gi) (where i=1, . . . , m) satisfying either the relationship G1=Qiv mod n or the relationship Gi×Qiv=1 mod n, where n is a public integer equal to the product of f (where f>1) private prime factors p1, . . . , pf, at least two of which are separate, and the exponent v is a public integer equal to a power of 2. Disclosed is what mathematical structure may be imparted to the public keys for it to be impossible to calculate said private keys from said public parameters in a reasonable time unless said prime factors are known. Devices adapted to implement the method are also disclosed.
    Type: Grant
    Filed: January 24, 2005
    Date of Patent: March 16, 2010
    Inventors: Louis Guillou, Jean-Jacques Quisquater
  • Patent number: 7386122
    Abstract: Proof is established by means of the following parameters: m pairs of private values Q1 and public values G1 m>1, a public module n made of the product of f first factors pj, f>2, a public exponent v, linked to each other by relations of the type: G1.Qiv=1 mod n or G1=Q1v mod n. Said exponent v is such that v=2k where k>1 is a security parameter. Public value G1 is the square g12 of a base number gi that is lower than f first factors pj, so that the two equations: x2=gi mod n and x2=?g1 mod n do not have a solution in x in the ring of the modulo n integers and such that the equation xv=g12 mod n has solutions in x in the ring of the modulus n integers.
    Type: Grant
    Filed: January 27, 2000
    Date of Patent: June 10, 2008
    Assignees: France Telecom, TDF, Math Rizk
    Inventors: Louis Guillou, Jean-Jacques Quisquater
  • Patent number: 7382875
    Abstract: The invention concerns a cryptographic method whereby a second entity (B) verifies by means of a public key, a proof provided by a first entity (A), which consists in the generation by the first entity (A) of a first random number r much higher than any first integer s included in a private key kept secret by the first entity (A). The first entity (A) generates a first element of proof resulting from a modulo n exponentiation of a first integer G included or not in said public key and whereof the exponent is the first random number r. In combination with the first element of proof, a so-called common number, is generated so that the second entity (B) and the first entity (A) should have knowledge of the common number. The first entity (A) generates an image y of said private key by linear combination of the first random number r and of at least a first private key integer s. At least a multiplicative coefficient of the linear combination is said common number.
    Type: Grant
    Filed: December 16, 2002
    Date of Patent: June 3, 2008
    Assignees: France Telecom, Math Riszk
    Inventors: Marc Girault, Jean-Jacques Quisquater
  • Patent number: 7266197
    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.
    Type: Grant
    Filed: January 27, 2000
    Date of Patent: September 4, 2007
    Assignees: France Telcom, TDF, Math Rizk
    Inventors: Louis Guillou, Jean-Jacques Quisquater
  • Publication number: 20070121936
    Abstract: A cryptography method involving a keyholder having a number m?1 of private keys Q1, Q2, . . . , Qm and respective public keys G1, G2, . . . , Gm, each pair of keys (Qi, Gi) (where i=1, . . . , m) satisfying either the relationship Gi=Qiv mod n or the relationship Gi×Qiv=1 mod n, where n is a public integer equal to the product of f (where f>1) private prime factors p1, . . . , pf, at least two of which are separate, and the exponent v is a public integer equal to a power of 2. Disclosed is what mathematical structure may be imparted to the public keys for it to be impossible to calculate said private keys from said public parameters in a reasonable time unless said prime factors are known. Devices adapted to implement the method are also disclosed.
    Type: Application
    Filed: January 24, 2005
    Publication date: May 31, 2007
    Inventors: Louis Guillou, Jean-Jacques Quisquater
  • Patent number: 7080254
    Abstract: The invention concerns a method whereby the proof is established by: m(?1) pairs of private Qi and public Gi=gi2 values; a public module n formed by the product of f(?2) prime factors; an exponent v=2k(k>1), linked by the relationships of the type: Gi?Qiv?1. mod n or Gi?Qiv mod n. Among the m numbers obtained by increasing Qi or its inverse modulo n to modulo n square, k?1 times rank, at least one of them is different from ±gi. Among the 2m equations: x2?gi mod n, x2??gi mod n, at least one of them has solutions in x in the ring of modulo n integers.
    Type: Grant
    Filed: September 29, 2000
    Date of Patent: July 18, 2006
    Assignee: France Telecom
    Inventors: Louis Guillou, Jean-Jacques Quisquater
  • Publication number: 20050220298
    Abstract: The invention concerns a cryptographic method whereby a second entity (B) verifies by means of a public key, a proof provided by a first entity (A), which consists in the generation by the first entity (A) of a first random number r much higher than any first integer s included in a private key kept secret by the first entity (A). The first entity (A) generates a first element of proof resulting from a modulo n exponentiation of a first integer G included or not in said public key and whereof the exponent is the first random number r. In combination with the first element of proof, a so-called common number, is generated so that the second entity (B) and the first entity (A) should have knowledge of the common number. The first entity (A) generates an image y of said private key by linear combination of the first random number r and of at least a first private key integer s. At least a multiplicative coefficient of the linear combination is said common number.
    Type: Application
    Filed: December 16, 2002
    Publication date: October 6, 2005
    Applicant: France Telecom
    Inventors: Marc Girault, Jean-Jacques Quisquater
  • Patent number: 6032169
    Abstract: In order to enable calculation of the square of a number comprising many digits by means of an arithmetic circuit which is arranged for the parallel processing of numbers having a substantially smaller number of digits, the number to be squared is subdivided into sub-numbers having a number of digits which is compatible with the arithmetic circuit, the individual sub-numbers being successively processed. For faster processing in the case of squaring operations, the multiplier circuit provided in the arithmetic circuit includes a position shift circuit capable of performing a shift of one position to the left in the case of multiplication of given pairs of sub-numbers, which shift corresponds to a multiplication by the factor 2. As a result, squaring can be performed while using fewer technical means. A method operating on the basis thereof so as to form the square of a large number modulo another large number is also disclosed.
    Type: Grant
    Filed: March 5, 1998
    Date of Patent: February 29, 2000
    Assignee: U.S. Philips Corporation
    Inventors: Ralf Malzahn, Jean-Jacques Quisquater
  • Patent number: 5351300
    Abstract: For dynamically modifying pseudo-random sequences of a pseudo-random sequence generator which is re-initialized at each start of the packet of information components, the information component itself is derived, delayed and combined with one of the series of bits present in the pseudo-random sequence generator. After having delayed the derived information component by a given delay (20), the component is modified by passing it through an EXCLUSIVE-OR gate (23) and by delaying the output signal of said gate with a delay (21) equal to that (20) used for said derived information component, and by feeding it back to the input of the gate.
    Type: Grant
    Filed: July 6, 1993
    Date of Patent: September 27, 1994
    Assignee: U.S. Philips Corporation
    Inventors: Jean-Jacques Quisquater, Issa Rakhodai
  • Patent number: 5305383
    Abstract: Method of electronic payment by chip card.According to the invention, each token carries a number making it possible to check its authenticity.The invention is used for electronic payment.
    Type: Grant
    Filed: August 16, 1993
    Date of Patent: April 19, 1994
    Assignees: France Telecom, Telediffusion de France S.A., U.S. Philips Corporation
    Inventors: Louis-Claude Guillou, Jean-Jacques Quisquater
  • Patent number: 5285403
    Abstract: A processing module for performing an operation of the type B=a.X+T in which B, X and T are high value integers, and a is an operand having a format restricted to m bits, in sequences constituted from computing steps consisting in combining the operand a with operands x.sub.i and t.sub.i, of restricted format, extracted from the data X and T, at the rank of significance i and in storing a partial result b.sub.i of the same significance rank, this processing module including a static multiplier and two adders and a resistor for storing and recycling the most significant portion of a previous computing step. The processing module includes k inputs for operands a (l . . . k) of successive ranks, for successively applying, in work cycles k steps the said operands a (l . . .
    Type: Grant
    Filed: February 12, 1993
    Date of Patent: February 8, 1994
    Assignee: U.S. Philips Corporation
    Inventors: Jean-Jacques Quisquater, Jean-Pierre Bournas, Dominique De Waleffe
  • Patent number: 5218637
    Abstract: According to the invention, the chip card issues a first certificate comprising its letter of credentials (Crc), an exponential (X), an optional message (M), these quantities being signed. The security module verifies the signature and in return issues a second certificate containing its letter of credentials (Crm), an exponential (Y), an optional message (M'), a cryptogram (C), these quantities being signed. A common secret key is constituted between the card and the security module by the exponentials and allows the card to interpret the cryptogram addressed to it and to act in accordance therewith.
    Type: Grant
    Filed: June 11, 1991
    Date of Patent: June 8, 1993
    Assignee: L'Etat Francais represente par le Ministre des Postes, des Telecommunications et de l'Espace
    Inventors: Didier Angebaud, Jean-Luc Giachetti, Louis Guillou, Jean-Jacques Quisquater
  • Patent number: 5214701
    Abstract: This method of processing data protected by a coding is particularly suitable to be used in microcircuit cards utilizing the method of processing data of the DES type. In the DES method, a step SP of transformation of compression S is included, which is followed by an irregular permutation P. According to the method, the transformation of compression S is effected in such a manner that the data to be stored are subjected beforehand to a permutation P, while a masking system is calculated specifically to permit the execution of the said step SP by recuperating only the desired bits, the latter then being automatically present at the predetermined storage locations.
    Type: Grant
    Filed: July 24, 1990
    Date of Patent: May 25, 1993
    Assignee: U.S. Philips Corporation
    Inventors: Jean-Jacques Quisquater, Xavier Delaporte, Benoit Leterrier
  • Patent number: 5166978
    Abstract: A digital message M is transformed by means of an operation to modulo-N exponentiate M by a number e all these numbers being large-length integers, having n bits, which uses a sequence of two successive operations, the first in the form of:B.sub.i =a.sub.i.X+T.2.sup.mwhere B.sub.i and X are calculation variables, where a.sub.i is an extract of m bits of a second calculation variable A whose value results from a previous operation, which extract is taken in the decreasing order of weight of A, of rank i, and where T is a summing variable used for the calculation of the variable A, and the second operation consists of reducing the length of the variable B.sub.i. A modulo-N quasi-reduction is used because it is approximative (to the nearest small multiple of N), and may be applied systematically and without a sign test during a given number of successive operations which are chosen, after which a supplementary and systematic reduction is performed according to the same method.
    Type: Grant
    Filed: February 21, 1991
    Date of Patent: November 24, 1992
    Assignee: U.S. Philips Corp.
    Inventor: Jean-Jacques Quisquater
  • Patent number: 5163154
    Abstract: Microcontroller comprising in particular a central processing unit (10), a set of memories (11, 12), a specialized processing module (13) for performing, in sequence, operations on v variable operands and k operands of parameter type (constant during the sequence), and an arrangement of internal buses (20, 21) for the exchange of addresses and data.
    Type: Grant
    Filed: December 21, 1990
    Date of Patent: November 10, 1992
    Assignee: U.S. Philips Corp.
    Inventors: Jean-Pierre Bournas, Jean-Jacques Quisquater, Dominique De Waleffe, Peter Klapproth
  • Patent number: 5140634
    Abstract: A method and system for authentication of accreditations and of messages with zero-knowledge proof and for the signing of messages, and a station for use in such system, in particular executed as a smart card station.Instead of using multiple accreditations and an iterative process of verification, use is made of a comprehensve accreditation (high exponent p) and a number D is drawn at random, which number is within the range between 0 and p-1. The operations of verifiction proceed by the computation of the D-th power of the inverse accreditation B.Application in particular, to smart cards and, more specifically, to bank cards.
    Type: Grant
    Filed: October 9, 1991
    Date of Patent: August 18, 1992
    Assignee: U.S Philips Corporation
    Inventors: Louis C. Guillou, Jean-Jacques Quisquater
  • Patent number: 5079733
    Abstract: The arrangement includes two basic shift registers (1, 3) which are arranged as multipliers whose initial content is predetermined by an internal key, and which are fed back to each other via a modifying member inserted in the loop. The modifying member (5) is an AND-gate controlled by a signal obtained from an OR-gate (8) to whose two inputs the bits which each come from two shift registers (33, 34) which are independent of the two first registers, are applied. These independent registers are modified one by the other, and this modification is effected by inserted bistable counters (10, 11). In addition, the two basic registers (1, 3) are linearly modified by insertion of bits originating from a source (28, 33, 34) which is external to the register to be modified. Each modifier bit is obtained more specifically from an AND-gate (21-25) to whose inputs the bits coming from the two above-mentioned independent registers (33, 34) are conveyed.
    Type: Grant
    Filed: April 9, 1991
    Date of Patent: January 7, 1992
    Assignee: U.S. Philips Corporation
    Inventors: Patrick Antoine, Jean-Jacques Quisquater
  • Patent number: 5001753
    Abstract: The subject of the present invention is a cryptographic system, having two inverse permutations, which can be implemented in a (micro) computer whose data processing resources are relatively limited. The two inverse permutations are processed with one and the same table, and the data zones, before and after permutation, occupy only one and the same memory zone. Applied to the DES cryptographic system, this can in particular be implemented in the memory card for the purpose of ensuring the security of transmissions between the card and a communication system; in particular the card reader of this system.
    Type: Grant
    Filed: March 7, 1988
    Date of Patent: March 19, 1991
    Assignee: U.S. Philips Corporation
    Inventors: Marc Davio, Philippe Gautier, Willem Isphording, Jean-Jacques Quisquater, Herve/ Sizabuire