会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 65. 发明申请
    • Method for making secure a secret quantity
    • 确保秘密数量的方法
    • US20050021990A1
    • 2005-01-27
    • US10488630
    • 2002-09-04
    • Pierre-Yvan LiardetHerve Chabanne
    • Pierre-Yvan LiardetHerve Chabanne
    • H04L9/10H04L9/06G06F12/14H04L9/00
    • H04L9/0625G06F2207/7219H04L9/004
    • The invention concerns a method and a system for making secure a secret quantity, contained in an electronic device, and used at least partly in an encryption algorithm of at least part of an input data executing a predetermined number (N) of successive iterations of a common function and producing at least part of an output data, which consists in: storing (14), after a first number (X) (of iterations, an intermediate result; applying, to the output data, a function inverse to that of the encryption for a number (N−X) of iterations corresponding to the difference between the total number of iterations and the first number, comparing (18) the intermediate result with the result of iterations of the inverse function; and validating the encryption only if the two results are identical.
    • 本发明涉及一种用于使电子设备中包含的安全的秘密数量的方法和系统,并且至少部分地使用至少部分输入数据的加密算法,所述加密算法执行预定数量(N)个连续迭代的输入数据 共同功能并且产生输出数据的至少一部分,其包括:在第一数字(X)(迭代)之后存储(14)中间结果;将与输出数据相反的函数应用于输出数据 对于与迭代总数和第一个数字之间的差异相对应的数字(NX)的迭代的加密,将中间结果与反函数的迭代结果进行比较(18);以及仅当两个结果 是相同的
    • 66. 发明授权
    • Method of performing multiplication with accumulation in a Galois body
    • 在伽罗瓦身体中进行累积的乘法的方法
    • US06609142B1
    • 2003-08-19
    • US09621891
    • 2000-07-20
    • Pierre-Yvan Liardet
    • Pierre-Yvan Liardet
    • G06F772
    • G06F7/724
    • A method is provided for performing multiplication with accumulation in a Galois Field on a first data, a second data, and a third data, with each of the data being coded on 2 n bits. A first multiplication, in the sense of the arithmetic of a Galois Field, is performed on the first data and the n lowest weight bits of the second data to produce a first intermediate result coded on 3 n bits, and a first addition, in the sense of the arithmetic of a Galois Field, is performed on the third data and the first intermediate result to produce a second intermediate result on 3 n bits. A second multiplication, in the sense of the arithmetic of a Galois Field, is performed on the first data and the n highest weight bits of the second data to produce a third intermediate result on 3 n bits, and a second addition, in the sense of the arithmetic of a Galois Field, is performed on the 2 n highest weight bits of the second intermediate result and the third intermediate result to produce a fourth intermediate result coded on 3 n bits. In a preferred embodiment, the 2 n highest weight bits of the second intermediate result are stored in an intermediate register and the n lowest weight bits of the second intermediate result in an output register.
    • 提供了一种用于在第一数据,第二数据和第三数据上执行与伽罗瓦域中的累加相乘的方法,其中每个数据被编码为2 n位。 在Galois域的算术意义上的第一乘法对第一数据和第二数据的n个最低加权比特执行,以产生以3 n比特编码的第一中间结果,并且在第 对第三数据和第一中间结果执行Galois域的算术感,以产生3 n比特的第二中间结果。 在Galois域的算术意义上的第二乘法对第二数据的第一数据和n个最高加权比特执行,以在3n比特上产生第三中间​​结果,并且在该意义上产生第二加法 在第二中间结果和第三中间结果的2 n个最高权重位上执行Galois域的算术,以产生以3 n比特编码的第四中间结果。 在优选实施例中,第二中间结果的2 n个最高权重位被存储在中间寄存器中,并且第二中间值的n个最低权重位产生输出寄存器。