专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20140149744A1 METHOD FOR OBTAINING ENCRYPTION KEYS CORRESPONDING TERMINALS, SERVER AND COMPUTER PROGRAM PRODUCTS 有权
标题翻译：用于获取加密终端，服务器和计算机程序产品的方法
公开(公告)号：US20140149744A1
公开(公告)日：2014-05-29
申请号：US13699043
申请日：2011-05-16
申请人： Eric Brier , Thomas Peyrin
发明人： Eric Brier , Thomas Peyrin
IPC分类号： H04L9/08
CPC分类号： H04L9/0819 , H04L9/0838 , H04L9/0869 , H04L2209/38
摘要： 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: —of the number of available registers R, by performing at most N calls to a pseudo-random function F and —of the data structure; so that the at least one encryption key can be obtained from a combination of at most T=CR+NN−1 encryption keys based on a secret previously shared between the server and client.
摘要翻译：一种用于获得从客户端发送到服务器的数据项的加密密钥的方法和装置。该方法包括：确定客户端内可用的寄存器数量R，以执行加密密钥的多个计算; 确定在所述服务器处获得至少一个加密密钥所需的迭代的最大数量N; 获得表示在R可用寄存器内实现的密钥计算状态的数据结构; 通过对伪随机函数F和数据结构执行至多N个调用来计算至少一个加密密钥作为可用寄存器R的数量的函数; 使得可以基于先前在服务器和客户端之间共享的秘密从最多T = CR + NN-1加密密钥的组合中获得至少一个加密密钥。

2. 发明授权

US08966266B2 Method for obtaining encryption keys corresponding terminals, server and computer program products 有权
标题翻译：用于获取对应终端，服务器和计算机程序产品的加密密钥的方法
公开(公告)号：US08966266B2
公开(公告)日：2015-02-24
申请号：US13699043
申请日：2011-05-16
申请人： Eric Brier , Thomas Peyrin
发明人： Eric Brier , Thomas Peyrin
IPC分类号： H04L9/32 , H04L9/08
CPC分类号： H04L9/0819 , H04L9/0838 , H04L9/0869 , H04L2209/38
摘要： 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: —of the number of available registers R, by performing at most N calls to a pseudo-random function F and —of the data structure; so that the at least one encryption key can be obtained from a combination of at most T=CR+NN−1 encryption keys based on a secret previously shared between the server and client.
摘要翻译：一种用于获得从客户端发送到服务器的数据项的加密密钥的方法和装置。该方法包括：确定客户端内可用的寄存器数量R，以执行加密密钥的多个计算; 确定在所述服务器处获得至少一个加密密钥所需的迭代的最大数量N; 获得表示在R可用寄存器内实现的密钥计算状态的数据结构; 通过对伪随机函数F和数据结构执行至多N个调用来计算至少一个加密密钥作为可用寄存器R的数量的函数; 使得可以基于先前在服务器和客户端之间共享的秘密从最多T = CR + NN-1加密密钥的组合中获得至少一个加密密钥。

3. 发明申请

US20140105384A1 CRYPTOGRAPHIC METHOD USING A NON-SUPERSINGULAR ELLIPTIC CURVE E IN CHARACTERISTIC 3 有权
标题翻译：特征3中的非超级电路曲线E的折射方法
公开(公告)号：US20140105384A1
公开(公告)日：2014-04-17
申请号：US12964382
申请日：2010-12-09
申请人： Eric Brier
发明人： Eric Brier
IPC分类号： H04L9/28
CPC分类号： H04L9/28 , H04L9/002 , H04L9/3066
摘要： A cryptographic method is provided of a type with public key over a non-supersingular elliptic curve E, determined by the simplified Weirstrass equation y2=x3+a.x2+b over a finite field GF(3n), 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 η on GF(3n); obtaining a pre-determined point P=(zP, yP) belonging to a conic C defined by the following equation: a.η.z2−y2+b=0; obtaining a point Q=(zQ, yQ), distinct from the point P belonging to the conic C and a straight line D defined by the following equation: y=t.z+yP−t.zP; obtaining the element ξ of GF(3n) verifying the following linear equation over GF(3): ξ3−η.ξ=(η2.zQ)/a; and associating, with the element t of the finite field, the point P′ of the elliptic curve, for which the coordinates are defined by the pair (η.zQ/ξ, yQ).
摘要翻译：提供了一种具有公钥的类型的密码方法，该公钥在非超椭圆曲线E上，由有限域GF（3n）上的简化Weirstrass方程y2 = x3 + a.x2 + b确定，其中n是更大的整数该方法包括将所述有限域的元素t与椭圆场的点P'相关联。关联的步骤包括：获得预定的二次非残基和eegr; 在GF（3n）上; 获得属于由以下等式定义的圆锥C的预定点P =（zP，yP）：a。＆eegr;。z2-y2 + b = 0; 获得与属于圆锥C的点P不同的点Q =（zQ，yQ）和由以下等式定义的直线D：y = t.z + yP-t.zP; 获取元素＆xgr; GF（3n）验证GF（3）上的以下线性方程：＆xgr; 3-＆egrgr。。＆xgr; =（＆eegr; 2.zQ）/ a; 并且与有限域的元素t相关联的椭圆曲线的点P'，其坐标由对（＆eegr; .zQ /＆xgr; yQ）定义。

4. 发明授权

US07856099B2 Secure data transmission between two modules 失效
标题翻译：两个模块之间的数据传输安全
公开(公告)号：US07856099B2
公开(公告)日：2010-12-21
申请号：US10557904
申请日：2004-05-14
申请人： Eric Brier , Jacques Fournier , Pascal Moitrel , Olivier Benoit , Philippe Proust
发明人： Eric Brier , Jacques Fournier , Pascal Moitrel , Olivier Benoit , Philippe Proust
IPC分类号： H04K1/00 , H04L9/00 , H04L9/28
CPC分类号： H04L9/004 , H03M13/05 , H03M13/51 , H04L9/003 , H04L2209/125
摘要： 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.
摘要翻译：本发明涉及一种用于在电子单元的两个功能模块之间的连接中的安全数据传输的方法。 n位的字代码中的k位的消息的第一模块以恒定的汉明权重w进行注入编码。代码字被传送到第二个模块。当由第二模块接收到的n位的码字的汉明权重与w不同时，产生错误信号。在没有错误的情况下，代码字被解码，其中k，w和n是整数。本发明还涉及相应的电子电路。

5. 发明申请

US20090154710A1 Method for the Secure Deposition of Digital Data, Associated Method for Recovering Digital Data, Associated Devices for Implementing Methods, and System Comprising Said Devices 审中-公开
标题翻译：用于数字数据的安全沉积的方法，用于恢复数字数据的相关方法，用于实现方法的相关设备以及包括所述设备的系统
公开(公告)号：US20090154710A1
公开(公告)日：2009-06-18
申请号：US12084301
申请日：2006-10-27
申请人： Eric Brier , Mathieu Ciet
发明人： Eric Brier , Mathieu Ciet
IPC分类号： H04L9/32 , H04L9/00
CPC分类号： H04L9/0825 , G06F21/6227 , H04L9/083 , H04L9/321 , H04L2209/42 , H04L2209/80
摘要： The invention relates to a method for the secure deposition of data, according to which a depositor encrypts the data with a transfer key and encrypts the transfer key with a key of a third party, then deposits the encrypted data and the encrypted transfer key on a storage support. The invention also relates to a method for recovering data, during which an addressee of the data recovers the content of the storage support, authenticates him/herself to the third party, and transmits the encrypted transfer key thereto. After having authenticated the addressee, the third party returns the decrypted transfer key. The addressee can then recover the data. The invention further relates to devices for implementing the foregoing methods.
摘要翻译：本发明涉及一种用于数据安全存储的方法，根据该方法，存储器使用传送密钥对数据进行加密，并用第三方的密钥加密转移密钥，然后将加密的数据和加密的传输密钥存储在存储支持。本发明还涉及一种用于恢复数据的方法，在该方法中，数据的收件人恢复存储支持的内容，将其自己认证给第三方，并向其发送加密的传送密钥。通过验证收件人后，第三方返回解密的传输密钥。收件人可以恢复数据。本发明还涉及用于实现上述方法的装置。

6. 发明申请

US20070183636A1 Method of encrypting digital data, a method of masking a biometric print, and application to making a security document secure 有权
公开(公告)号：US20070183636A1
公开(公告)日：2007-08-09
申请号：US11596560
申请日：2005-05-11
申请人： Cedric Cardonnel , Eric Brier , David Naccache , Jean-Sebastien Coron
发明人： Cedric Cardonnel , Eric Brier , David Naccache , Jean-Sebastien Coron
IPC分类号： G06K9/00
CPC分类号： G07C9/00087
摘要： 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, bi is the bit at position i of plain datum b, and qi is the prime number at position i in a set of prime numbers (q1, . . . , qn) 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+1 bits, such that, for any i: bi=1 if position i corresponds to a real minutia, and bi=0 if position i corresponds to a false minutia. The invention can be used to secure a security document such as a bank cheque. m = ∏ i = 1 n ⁢ ⁢ q i b i ⁢ mod ⁢ ⁢ p ( I )

7. 发明授权

US08380574B2 Method and system for validating a transaction, corresponding transactional terminal and program 有权
标题翻译：验证交易的方法和系统，相应的交易终端和程序
公开(公告)号：US08380574B2
公开(公告)日：2013-02-19
申请号：US13069035
申请日：2011-03-22
申请人： David Naccache , Eric Brier
发明人： David Naccache , Eric Brier
IPC分类号： G06Q20/00
CPC分类号： H04L9/3226 , G06Q20/206 , H04L63/107 , H04L63/18 , H04L2209/56 , H04L2209/80 , H04W12/06
摘要： 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.
摘要翻译：提供了一种用于验证交易终端上的交易的方法和装置，该交易与用户相关联。该方法包括对由事务终端预先生成和显示的由用户在确认消息中输入并由用户的移动设备发送到电信网络的实体的验证码的步骤，移动设备和所述交易终端连接。

8. 发明授权

US08165285B2 Process for generating an elliptic curve, application in a cryptographic process, and cryptographic process using such a curve 有权
标题翻译：用于生成椭圆曲线的过程，加密处理中的应用以及使用这样的曲线的密码处理
公开(公告)号：US08165285B2
公开(公告)日：2012-04-24
申请号：US11336816
申请日：2006-01-23
申请人： Eric Brier
发明人： Eric Brier
IPC分类号： H04K1/00
CPC分类号： G06F7/725 , H04L9/3073 , H04L2209/08
摘要： 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.
摘要翻译：本发明主要涉及使用由包含第一和第二参数（a，b）的方程表示的椭圆曲线的密码处理，双线性匹配以及围绕至少一个第一简化规则构造的有限整数组中的计算将每个整数除以整数除以构成第三参数的第一素数（p），将有限组的元素与椭圆曲线上选择的点相对应，并将其数量与第四个参数（q），其中该过程使用公钥和私钥，其中每一个由椭圆曲线的给定点或该曲线的两个点之间的乘积因子表示。根据本发明，第一简化规则是实现的唯一的减少规则，并且椭圆曲线通过逐步构造过程获得，直接分配给椭圆曲线中的有限群q * q q个点。

9. 发明申请

US20110238513A1 METHOD AND SYSTEM FOR VALIDATING A TRANSACTION, CORRESPONDING TRANSACTIONAL TERMINAL AND PROGRAM 有权
标题翻译：交易交易的方法和系统，相应的交易终端和程序
公开(公告)号：US20110238513A1
公开(公告)日：2011-09-29
申请号：US13069035
申请日：2011-03-22
申请人： David Naccache , Eric Brier
发明人： David Naccache , Eric Brier
IPC分类号： G06Q20/00
CPC分类号： H04L9/3226 , G06Q20/206 , H04L63/107 , H04L63/18 , H04L2209/56 , H04L2209/80 , H04W12/06
摘要： 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.
摘要翻译：提供了一种用于验证交易终端上的交易的方法和装置，该交易与用户相关联。该方法包括对由事务终端预先生成和显示的由用户在确认消息中输入并由用户的移动设备发送到电信网络的实体的验证码的步骤，移动设备和所述交易终端连接。

10. 发明申请

US20070189513A1 Process for generating an elliptic curve, application in a cryptographic process, and cryptographic process using such a curve 有权
标题翻译：用于生成椭圆曲线的过程，加密处理中的应用以及使用这样的曲线的密码处理
公开(公告)号：US20070189513A1
公开(公告)日：2007-08-16
申请号：US11336816
申请日：2006-01-23
申请人： Eric Brier
发明人： Eric Brier
IPC分类号： H04L9/28
CPC分类号： G06F7/725 , H04L9/3073 , H04L2209/08
摘要： 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.
摘要翻译：本发明主要涉及使用由包含第一和第二参数（a，b）的方程表示的椭圆曲线的密码处理，双线性匹配以及围绕至少一个第一简化规则构造的有限整数组中的计算将每个整数除以整数除以构成第三参数的第一素数（p），将有限组的元素与椭圆曲线上选择的点相对应，并将其数量与第四个参数（q），其中该过程使用公钥和私钥，其中每一个由椭圆曲线的给定点或该曲线的两个点之间的乘积因子表示。根据本发明，第一简化规则是实现的唯一的减少规则，并且椭圆曲线通过逐步构造过程获得，直接分配给椭圆曲线中的有限群q * q q个点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式