Patents by Inventor David Lefranc

David Lefranc 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).

  • Patent number: 9654320
    Abstract: A method of transmitting information between a plurality of radioelectric stations and an associated transmission network are disclosed. In one aspect, the method transmits information between radioelectric stations, each station including a transmitter and a receiver, the information including NbMot words of data, NbMot being an integer >1.
    Type: Grant
    Filed: March 19, 2015
    Date of Patent: May 16, 2017
    Assignee: THALES
    Inventors: Eric Garrido, David Lefranc, Thibault De Moegen
  • Publication number: 20150256371
    Abstract: A method of transmitting information between a plurality of radioelectric stations and an associated transmission network are disclosed. In one aspect, the method transmits information between radioelectric stations, each station including a transmitter and a receiver, the information including NbMot words of data, NbMot being an integer >1.
    Type: Application
    Filed: March 19, 2015
    Publication date: September 10, 2015
    Inventors: Eric GARRIDO, David LEFRANC, Thibault DE MOEGEN
  • Patent number: 7991151
    Abstract: A technique for secure delegation of calculation of a value f(X,Y) of a bilinear application in a computational server. The technique comprises selection of two secret parameters a and b; calculation of the numbers Xa and Yb; supply of the two numbers Xa and Yb to the computational server; calculation of f(Xa, Yb) by said server; receipt of the value of f(Xa,Yb) from the server; extraction of the abth root of f(Xa,Yb).
    Type: Grant
    Filed: October 21, 2005
    Date of Patent: August 2, 2011
    Assignee: France Telecom
    Inventors: David Lefranc, Marc Girault
  • Publication number: 20110142226
    Abstract: Method for generating pseudo-random bit strings in a system in which the data interchanges between a first user and a second user are protected, characterized in that it comprises at least the following steps: using an application fk of output size n bits, determining a value x and, from this value x and by applying the application fk, generating t values vi, from the t values vi and, from u*t coefficients, determining u blocks Si containing pseudo-random characters. Applicable to the coding or authentication domain.
    Type: Application
    Filed: May 12, 2008
    Publication date: June 16, 2011
    Applicant: THALES
    Inventors: David Lefranc, Philippe Painchault
  • Patent number: 7822199
    Abstract: A method and device for performing a cryptographic operation by a device controlled by a security application executed outside thereof in which a cryptographic value (y) is produced a calculation comprising at least one multiplication between first and second factors containing a security key (s) associated with the device and a challenge number (c) provided by the security application. The first multiplication factor comprises a determined number of bits (L) in a binary representation and the second factor is constrained in such a way that it comprises, in a binary representation, several bits at 1 with a sequence of at least L?1 bits at 0 between each pair of consecutive bits to 1 while the multiplication is carried out by assembling the binary versions of the first factor shifted according to positions of the bits at 1 of the second factor, respectively.
    Type: Grant
    Filed: February 24, 2005
    Date of Patent: October 26, 2010
    Assignee: France Telecom
    Inventors: Marc Girault, David Lefranc
  • Publication number: 20080137844
    Abstract: A method and device for performing a cryptographic operation by a device controlled by a security application executed outside thereof in which a cryptographic value (y) is produced a calculation comprising at least one multiplication between first and second factors containing a security key (s) associated with the device and a challenge number (c) provided by the security application. The first multiplication factor comprises a determined number of bits (L) in a binary representation and the second factor is constrained in such a way that it comprises, in a binary representation, several bits at 1 with a sequence of at least L?1 bits at 0 between each pair of consecutive bits to 1 while the multiplication is carried out by assembling the binary versions of the first factor shifted according to positions of the bits at 1 of the second factor, respectively.
    Type: Application
    Filed: February 24, 2005
    Publication date: June 12, 2008
    Applicant: France Telecom
    Inventors: Marc Girault, David Lefranc
  • Publication number: 20070260882
    Abstract: A technique for secure delegation of calculation of a value f(X,Y) of a bilinear application in a computational server. The technique comprises: selection of two secret parameters a and b; calculation of the numbers Xa and Yb; supply of the two numbers Xa and Yb to the computational server; calculation of f(Xa,Yb) by said server; receipt of the value of f(Xa,Yb) from the server; extraction of the abth root of f(Xa,Yb).
    Type: Application
    Filed: October 21, 2005
    Publication date: November 8, 2007
    Inventors: David Lefranc, Marc Girault