利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

11 条记录 (耗时 0.202 秒)

    Method for Securely Handling Data During the Running of Cryptographic Algorithms on Embedded Systems
    5.
    发明申请
    Method for Securely Handling Data During the Running of Cryptographic Algorithms on Embedded Systems 审中-公开
    在嵌入式系统运行加密算法期间安全处理数据的方法

    公开(公告)号：US20100042851A1

    公开(公告)日：2010-02-18

    申请号：US12084487

    申请日：2006-10-27

    申请人： Benoit Chevallier-Mames ,  Mathieu Ciet ,  Karine Villegas ,  Jacques Fournier

    发明人： Benoit Chevallier-Mames ,  Mathieu Ciet ,  Karine Villegas ,  Jacques Fournier

    IPC分类号： G06F12/14

    CPC分类号： H04L9/002 ,  G06F21/755

    摘要： The invention relates to a method for handling data between two memory areas of an electronic component having at least one working memory area for carrying out operations on the component, which bring into play at least some of the data. The same memory areas are used for executing an operation, whatever the operation to be executed is, in such a manner that each operation has a hidden signal trace that is identical in terms of location leakage outside the component.

    摘要翻译： 本发明涉及一种用于处理具有至少一个工作存储区域的电子部件的两个存储区域之间的数据的方法，所述工作存储器区域用于对所述部件执行操作，这使得至少一些数据发挥作用。 相同的存储区域用于执行操作，无论执行的操作如何，每个操作具有在组件外部的位置泄漏方面相同的隐藏信号迹线。

    Integer division method which is secure against covert channel attacks
    6.
    发明申请
    Integer division method which is secure against covert channel attacks 有权
    整数分割方法，可以防范隐蔽通道攻击

    公开(公告)号：US20060133603A1

    公开(公告)日：2006-06-22

    申请号：US10534873

    申请日：2003-11-13

    申请人： Marc Joye ,  Karine Villegas

    发明人： Marc Joye ,  Karine Villegas

    IPC分类号： H04L9/28 ,  H04L9/00

    CPC分类号： G06F7/535 ,  G06F7/72 ,  G06F2207/7261 ,  H04L9/003 ,  H04L9/302

    摘要： The invention relates to a cryptographic method involving an integer division of type q=a div b and r=a mod b, wherein a is a number of m bits, b is a number of n bits, with n being less than or equal to m, and bn−1 being non-null and the most significant bit of b. In addition, each iteration of a loop subscripted by i, which varies between 1 and m−n+1, involves a partial division of a word A of n bits of number a by number b in order to obtain one bit of quotient q. According to the invention, the same operations are performed with each iteration, regardless of the value of the quotient bit obtained. In different embodiments of the invention, one of the following is also performed with each iteration: the addition and subtraction of number b to/from word A; the addition of number b or a complementary number /b of b to word A; or a complement operation at 2n of an updated datum (b or /b) or a dummy datum (c or /c) followed by the addition of the datum updated with word A.

    摘要翻译： 本发明涉及一种包含类型为q = a div b和r = a mod b的整数除法的密码方法，其中a是m比特数，b是n比特数，n小于或等于 m和b n-1 1是非空的，b的最高有效位。 另外，在i和m-n + 1之间变化的由i下标的循环的每次迭代都涉及到数字a的n位的字A的部分划分，以便获得一个位q。 根据本发明，与每个迭代执行相同的操作，而不管获得的商位的值如何。 在本发明的不同实施例中，每次迭代还执行以下之一：对于字A的数字b的加和减; 在字A中添加数字b或补数b / b; 或更新的数据（b或/ b）或虚拟数据（c或/ c）的2“的补码操作，然后添加用字A更新的数据。

    Integer division method secure against covert channel attacks
    8.
    发明授权
    Integer division method secure against covert channel attacks 有权
    整数分割法可以防范隐蔽通道攻击

    公开(公告)号：US08233614B2

    公开(公告)日：2012-07-31

    申请号：US10534873

    申请日：2003-11-13

    申请人： Marc Joye ,  Karine Villegas

    发明人： Marc Joye ,  Karine Villegas

    IPC分类号： H04K1/00 ,  H04L9/00 ,  H04L9/28

    CPC分类号： G06F7/535 ,  G06F7/72 ,  G06F2207/7261 ,  H04L9/003 ,  H04L9/302

    摘要： The invention relates to a cryptographic method involving an integer division of type q=a div b and r=a mod b, wherein a is a number of m bits, b is a number of n bits, with n being less than or equal to m, and bn−1 being non-null and the most significant bit of b. In addition, each iteration of a loop subscripted by i, which varies between 1 and m−n+1, involves a partial division of a word A of n bits of number a by number b in order to obtain one bit of quotient q. According to the invention, the same operations are performed with each iteration, regardless of the value of the quotient bit obtained. In different embodiments of the invention, one of the following is also performed with each iteration: the addition and subtraction of number b to/from word A; the addition of number b or a complementary number /b of b to word A; or a complement operation at 2n of an updated datum (b or /b) or a dummy datum (c or /c) followed by the addition of the datum updated with word A.

    摘要翻译： 本发明涉及一种包含类型为q = a div b和r = a mod b的整数除法的密码方法，其中a是m比特数，b是n比特数，n小于或等于 m和bn-1是非空的，b的最高有效位。 另外，在i和m-n + 1之间变化的由i下标的循环的每次迭代都涉及到数字a的n位的字A的部分划分，以便获得一个位q。 根据本发明，与每个迭代执行相同的操作，而不管获得的商位的值如何。 在本发明的不同实施例中，每次迭代还执行以下之一：对于字A的数字b的加和减; 在字A中添加数字b或补数b / b; 或在更新的数据（b或/ b）或虚拟数据（c或/ c）的2n处的补码操作，随后添加用词A更新的数据。