Compagnie Industrielle Et Financiere D'ingenierie Ingenico

Gemalto Sa

Ingenico Group

Eric Brier

David Naccache

Jean-Sébastien Coron

Pierre Quentin

Philippe Proust

Olivier Benoit

Jean-Louis Sarradin

Jacques Fournier

Pascal Moitrel

Cédric Cardonnel

Thomas Peyrin

Patrice Le Marre

Pierre Martinez

Jean-Marie Aubanel

Dorina Ghiliotto-Young

Leonard De Haro

A method is provided for encrypting a code of a computer program using an encryption key selected from among at least two encryption keys. Such a method includes: obtaining a descriptive grammar of the language of the code to be encrypted; encoding the code by using the descriptive grammar delivering a character string within which at least one start instruction of the code is encoded as a representation in the character string; encryption of the character string by using the encryption key belonging to the set of encryption keys, delivering an encrypted string. A method of decryption includes the inverse steps and also makes use of the descriptive grammar of the code.

Method of encryption, method for decrypting, devices and programs

An antitheft protection device that includes an electronic antitheft element. The device also includes an element for deactivating the electronic antitheft element; an energy supply at least indirectly powering said element for deactivating the electronic antitheft element; and an element to receive a command to deactivate the electronic antitheft element.

Device for protection against theft, corresponding method and computer program

The invention concerns a method for deactivating a payment module attachable to a communications terminal, comprising:

Method for deactivating a payment module, corresponding computer program product, storage medium and payment module

A method and apparatus for obtaining an encryption key for an item of data transmitted from a client to a server. The method includes: determining a number R of registers available within the client for carrying out a plurality of calculations of encryption keys; determining a maximum number N of iterations necessary for obtaining at least one encryption key at the server; obtaining a structure of data representative of a key calculation state effected within the R available registers; calculating the at least one encryption key as a function: &#x2014;of the number of available registers R, by performing at most N calls to a pseudo-random function F and &#x2014;of the data structure; so that the at least one encryption key can be obtained from a combination of at most T=C&#x2212;1 encryption keys based on a secret previously shared between the server and client.

Method for obtaining encryption keys corresponding terminals, server and computer program products

A cryptographic method is provided of a type with public key over a non-supersingular elliptic curve E, determined by the simplified Weirstrass equation y=x+a&#xb7;x+b over a finite field GF(3), with n being an integer greater than or equal to 1. The method includes associating an element t of said finite field with a point P' of the elliptic field. The step of associating includes: obtaining a pre-determined quadratic non-residue &#x3b7; on GF(3); obtaining a pre-determined point P=(z, y) belonging to a conic C defined by the following equation: a&#xb7;&#x3b7;&#xb7;z+b =0; obtaining a point Q=(z, y), distinct from the point P belonging to the conic C and a straight line D defined by the following equation: y=t&#xb7;z+y&#x2212;t&#xb7;z; obtaining the element &#x3be; of GF(3) verifying the following linear equation over GF(3):&#x2212;&#x3b7;&#xb7;&#x3be;=(&#x3b7;&#xb7;z)/a; and associating, with the element t of the finite field, the point P&#x2032; of the elliptic curve, for which the coordinates are defined by the pair (&#x3b7;&#xb7;z/&#x3be;, y).

Cryptographic method using a non-supersingular elliptic curve E in characteristic 3

A method and apparatus are provided for reducing the energy consumption of an electronic terminal. The method implements a step of modifying the timeout-before-standby duration for said terminal after an action performed by and/or on said terminal at a current instant, depending on the membership of the current instant in a given temporal category, from among at least two predefined temporal categories.

Method for reducing the energy consumption of an electronic terminal by modifying timeout-before-standby duration, corresponding terminal and computer program

A method and apparatus are provided for validating a transaction on a transactional terminal, the transaction being associated with a user. The method includes a step of decoding a validation code preliminarily generated and displayed by the transactional terminal, entered by the user in a validation message, and transmitted by a mobile device of the user to an entity of a telecommunications network to which the mobile device and said transactional terminal are connected.

Method and system for validating a transaction, corresponding transactional terminal and program

The invention relates, mainly to a cryptographic process using an elliptic curve represented by means of an equation containing first and second parameters (a, b), a bilinear matching, and calculations in a finite group of integers constructed around at least one first reduction rule reducing each integer to its remainder in a whole division by a first prime number (p) that constitutes a third parameter, the elements of the finite group being in bijection with points selected on the elliptic curve, and the number of which is linked to a fourth parameter (q), where this process uses public and private keys, each of which is represented by a given point of the elliptic curve or by a multiplication factor between two points of this curve. According to the invention, the first reduction rule is the only reduction rule implemented, and the elliptic curve is obtained through a step-by-step construction process, directly allocating to the finite group q*q q-order points in the elliptic curve.

Process for generating an elliptic curve, application in a cryptographic process, and cryptographic process using such a curve

The invention relates to a method of masking a plain datum b having n bits. The inventive method is characterised in that a masked datum m is produced using the following masking function: (I), wherein p is a prime number, bis the bit at position i of plain datum b, and qis the prime number at position i in a set of prime numbers (q, . . . , q). The invention also relates to a method of masking a biometric print, consisting in: determining a set of s real minutiae which are characteristic of the print; mixing and arranging the real minutiae with t false minutiae; and forming a mixed biometric datum b having n=s+t bits, such that, for any i: b=1 if position i corresponds to a real minutia, and b=0 if position i corresponds to a false minutia. The invention can be used to secure a security document such as a bank cheque. 

Method of encrypting digital data, a method of masking a biometric print, and application to making a security document secure

The invention relates to a method for secure data transmission in connections between two functional modules of an electronic unit. A first module of a message of k bits in a word code of n bits is injection coded with a constant Hamming weight of w. The word of code is transmitted to a second module. An error signal is generated when the Hamming weight of the word of code of n bits, received by the second module, is different from w. In the absence of error, the code word is decoded, where k, w and n are whole numbers. The invention further relates to a corresponding electronic circuit.

Growing community of inventors

Valence, France

Eric Brier