公开(公告)号：US20150172051A1

公开(公告)日：2015-06-18

申请号：US14572233

申请日：2014-12-16

Applicant: OBERTHUR TECHNOLOGIES

Inventor： Alberto BATTISTELLO ,  Christophe GIRAUD ,  Guillaume DABOSVILLE ,  Laurie GENELLE

IPC: H04L9/14 ,  H04L9/30

CPC classification number: H04L9/14 ,  H04L9/002 ,  H04L9/30 ,  H04L9/302 ,  H04L2209/24 ,  H04L2209/26

Abstract: Method of integrity verification of cryptographic key pairs, the method including an integrity test with: at least one first step implementing one of the private and public keys and an initial test datum, the first step making it possible to generate a first result, at least one second step implementing at least the first result and the key not used during the at least one first step, the second step making it possible to generate a second result, and a comparison of the second result and of the initial test datum, characterized in that the test is re-executed upon each positive comparison, and in that the test is executed at least 2 times.

Abstract translation: 密码密钥对的完整性验证方法，该方法包括完整性测试，其具有：实现私钥和公钥之一的至少一个第一步骤和初始测试数据，第一步骤至少可以产生第一结果，至少 至少实现第一结果的第二步骤和在至少一个第一步骤期间未使用的密钥，第二步骤可以产生第二结果，以及第二结果与初始测试数据的比较，其特征在于 在每次正面比较后重新执行测试，并且测试至少执行2次。

公开(公告)号：US20170078089A1

公开(公告)日：2017-03-16

申请号：US15122822

申请日：2015-03-03

Applicant: OBERTHUR TECHNOLOGIES

Inventor： Alberto BATTISTELLO ,  Christophe GIRAUD ,  Guillaume DABOSVILLE ,  Laurie GENELLE

IPC: H04L9/08 ,  H04L9/00

CPC classification number: H04L9/08 ,  G06F7/72 ,  G06F2207/7204 ,  H04L9/004 ,  H04L9/302

Abstract: Generation of a message m of order λ(n) for a test of the integrity of the generation of a pair of cryptographic keys within the multiplicative group of integers modulo n=p·q, including: —key pair generation including, to generate p and q: a random selection of candidate integers; and a primality test; —a first search of the multiplicative group of integers modulo p for a generator a; —a second search of the multiplicative group of integers modulo q for a generator b; —a third search for a number y, as message m, verifying: 1≦γ≦n−1, where γ=a mod p and γ=b mod q, the first or second search being performed during the primality test.

Abstract translation: 生成订单λ（n）的消息m，用于测试在模n = p·q的乘法乘法组中产生一对加密密钥的完整性，包括： - 密钥对生成包括生成p 和q：候选整数的随机选择; 和原始测试; - 对于生成器a首先搜索模p的乘法乘法组; - 对发生器b进行模q的乘法乘积组的第二次搜索; - 第三次搜索数字y作为消息m，验证：1≤γ≤n-1，其中γ= a mod p和γ= b mod q，在原语测试期间执行第一或第二搜索。

公开(公告)号：US20150172052A1

公开(公告)日：2015-06-18

申请号：US14572318

申请日：2014-12-16

Applicant: OBERTHUR TECHNOLOGIES

Inventor： Alberto BATTISTELLO ,  Christophe GIRAUD ,  Guillaume DABOSVILLE ,  Laurie GENELLE

IPC: H04L9/14 ,  H04L9/00

CPC classification number: H04L9/14 ,  H04L9/002 ,  H04L9/004 ,  H04L2209/12 ,  H04L2209/24

Abstract: Method of integrity verification of public and private cryptographic key pairs in the additive group of integers modulo n, with n being the product of two prime numbers p and q, the method including the following steps: of computation (201), on the basis of the number n, of a public exponent e of the public key, and of a private exponent d of the private key, of two candidate factors p′ and q′ corresponding respectively to the numbers p and q, of verification (206) so as to verify the consistency of the private exponent with respect to the public exponent and to the number n, the verification step involving the candidate factors.

Abstract translation: 在n个整数的加法组中的公私密钥对的完整性验证方法，其中n是两个素数p和q的乘积，该方法包括以下步骤：计算（201），基于 公开密钥的公开指数e的数目n和私钥的私有指数d分别对应于验证（206）的数字p和q的两个候选因子p'和q'，以便 验证私有指数相对于公众指数的一致性和数字n，涉及候选因子的验证步骤。

公开(公告)号：US20130218775A1

公开(公告)日：2013-08-22

申请号：US13773298

申请日：2013-02-21

Applicant: OBERTHUR TECHNOLOGIES

Inventor： Guillaume DABOSVILLE ,  Emmanuelle Dottax ,  Yannick Sierra ,  Elder Dos Santos ,  Olivier Condemine ,  Omar Laazimani

IPC: G06Q20/40

CPC classification number: G06Q20/40 ,  G06F1/1694 ,  G06F3/0346 ,  G06F3/04847 ,  G06F21/316 ,  G06F2221/2133 ,  G06Q20/10 ,  G06Q20/32 ,  G06Q20/3229 ,  G06Q20/3274 ,  G06Q20/3278 ,  G06Q20/401 ,  G06Q20/4012 ,  G06Q20/4016 ,  G06Q20/42

Abstract: A method for determining the presence of a human being, comprising: measuring (S6) a movement (MOV) of a first device (4) by a sensor (44) of said first device (4), determining the presence of a human being on the basis of the measured movement (MOV).

Abstract translation: 一种用于确定人的存在的方法，包括：通过所述第一装置（4）的传感器（44）来测量（S6）第一装置（4）的移动（MOV），确定人的存在 基于测量的运动（MOV）。

公开(公告)号：US20160335433A1

公开(公告)日：2016-11-17

申请号：US15032098

申请日：2014-10-27

Applicant: OBERTHUR TECHNOLOGIES

Inventor： Guillaume DABOSVILLE ,  Michele SARTORI

IPC: G06F21/55 ,  G06F21/74

CPC classification number: G06F21/552 ,  G06F21/52 ,  G06F21/74 ,  H04L9/0618

Abstract: Intrusion detection systems dedicated to an operating system, and an intrusion detection system in a device implementing at least a first operating system and a second operating system. The intrusion detection systems includes: a listening module (1110) configured to be executed in the first operating system in order to listen to the activity of this first operating system; a collecting module (1120) configured to be executed in the first operating system in order to collect data characterizing the activity of the first operating system; and an analysis and detection module (1150) configured to be executed in the second operating system in order to analyze the data collected in the first operating system and detect a suspicious activity in the first operating system depending on the analysis.

Abstract translation: 专用于操作系统的入侵检测系统以及实现至少第一操作系统和第二操作系统的设备中的入侵检测系统。 入侵检测系统包括：侦听模块（1110），被配置为在第一操作系统中执行以监听该第一操作系统的活动; 收集模块（1120），被配置为在第一操作系统中执行，以便收集表征第一操作系统的活动的数据; 以及被配置为在所述第二操作系统中执行的分析和检测模块（1150），以便分析在所述第一操作系统中收集的数据，并根据所述分析来检测所述第一操作系统中的可疑活动。