MESSAGE GENERATION FOR A CRYPTOGRAPHIC KEY GENERATION TEST
    1.
    发明申请
    MESSAGE GENERATION FOR A CRYPTOGRAPHIC KEY GENERATION TEST 有权
    消息生成用于生成密钥生成测试

    公开(公告)号:US20170078089A1

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

    申请号:US15122822

    申请日:2015-03-03

    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,在原语测试期间执行第一或第二搜索。

    Generation of cryptographic keys
    2.
    发明申请
    Generation of cryptographic keys 有权
    生成加密密钥

    公开(公告)号:US20160072627A1

    公开(公告)日:2016-03-10

    申请号:US14572163

    申请日:2014-12-16

    CPC classification number: H04L9/0861 H04L9/004 H04L9/30

    Abstract: Method for generating a pair of public and private cryptographic keys in the additive group of integers modulo n, where n is the product of two prime numbers p and q, the method including the following steps: calculating a public exponent e for the public key, and calculating a private exponent d for the private key from the public exponent and the public modulus, where d·e=1 mod λ(n), λ(n) being the least common multiple between p-1 and q-1, characterized in that the method furthermore includes a step: of checking to check that λ(n)=0 mod (p-1) and λ(n)=0 mod (q-1).

    Abstract translation: 用于在n个整数的加法组中生成一对公共密钥和私有密钥的方法,其中n是两个素数p和q的乘积,所述方法包括以下步骤:计算公钥的公用指数e, 并且从公共指数和公共模数计算私钥的专用指数d,其中d·e = 1 modλ(n),λ(n)是p-1和q-1之间的最小公倍数,其特征在于 因为该方法还包括检查以检查λ(n)= 0mod(p-1)和λ(n)= 0mod(q-1)的步骤。

    INTEGRITY VERIFICATION OF CRYPTOGRAPHIC KEY PAIRS
    3.
    发明申请
    INTEGRITY VERIFICATION OF CRYPTOGRAPHIC KEY PAIRS 有权
    CRYPTOGRAPHIC主要对的完整性验证

    公开(公告)号:US20150172052A1

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

    申请号:US14572318

    申请日:2014-12-16

    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,涉及候选因子的验证步骤。

    INTEGRITY VERIFICATION OF CRYPTOGRAPHIC KEY PAIRS
    5.
    发明申请
    INTEGRITY VERIFICATION OF CRYPTOGRAPHIC KEY PAIRS 有权
    CRYPTOGRAPHIC主要对的完整性验证

    公开(公告)号:US20150172051A1

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

    申请号:US14572233

    申请日:2014-12-16

    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次。

    SMART CARD READER
    6.
    发明申请
    SMART CARD READER 有权
    智能卡读卡器

    公开(公告)号:US20140158764A1

    公开(公告)日:2014-06-12

    申请号:US13712843

    申请日:2012-12-12

    CPC classification number: G06K7/0008 G06F21/755 G06K7/0095

    Abstract: A smart card reader (1) capable of transmitting a power signal to a smart card (2) to determine a duration WT called Waiting Time in keeping with the standard ISO 7816 and sending commands to said smart card (2), the reader (1) comprising a detector for detecting a malfunctioning condition of the smart card (2) and being configured to cut said power signal when the malfunctioning condition is fulfilled. This reader is remarkable in that said malfunctioning condition is different to reaching, by a counter configured to be incremented with the time from the sending of a command to the smart card (2), of a value corresponding to the duration WT elapsed from the sending of the command or reinitialisation of the counter in response to the receipt of a protocol message of the smart card (2).

    Abstract translation: 一种智能卡读卡器(1),其能够将功率信号发送到智能卡(2)以根据标准ISO 7816确定称为等待时间的持续时间WT,并向所述智能卡(2)发送命令,读取器(1) )包括用于检测智能卡(2)的故障状况的检测器,并且被配置为当满足故障条件时切断所述电力信号。 该读取器是显着的,因为所述故障条件不同于通过配置为随着从发送命令到智能卡(2)的时间递增的计数器与对应于从发送所经过的持续时间WT相对应的值 响应于接收到智能卡(2)的协议消息,计数器的命令或重新初始化。

    METHOD OF EXECUTING A PROGRAM BY A PROCESSOR AND ELECTRONIC ENTITY COMPRISING SUCH A PROCESSOR
    8.
    发明申请
    METHOD OF EXECUTING A PROGRAM BY A PROCESSOR AND ELECTRONIC ENTITY COMPRISING SUCH A PROCESSOR 审中-公开
    由处理者执行程序的方法和包含处理器的电子实体

    公开(公告)号:US20160171214A1

    公开(公告)日:2016-06-16

    申请号:US14965203

    申请日:2015-12-10

    CPC classification number: G06F21/54 G06F21/556 G06F21/629 G06F2221/033

    Abstract: A method of executing a program by a processor, and an electronic entity including such a processor, the method includes the following steps: a calling program calling a subprogram and passing at least one parameter; the subprogram determining a return status indicator; the subprogram determining a return word by using a predetermined function to combine at least the return status indicator and the parameter; returning to the calling program with the determined return word as a result; and the calling program comparing the return word and a determined word determined by using the predetermined function to combine at least one possible value of the return status indicator and the parameter passed when calling the subprogram.

    Abstract translation: 一种由处理器执行程序的方法和包括这种处理器的电子实体,该方法包括以下步骤:调用子程序并传递至少一个参数的调用程序; 子程序确定返回状态指示器; 所述子程序通过使用预定功能来确定返回字,以至少组合所述返回状态指示符和所述参数; 作为结果返回到具有确定的返回字的调用程序; 并且所述呼叫程序将所述返回字与通过使用所述预定函数确定的确定字进行比较,以组合所述返回状态指示符的至少一个可能值和在调用所述子程序时传递的参数。

Patent Agency Ranking