会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明公开
    • METHOD FOR GENERATING A PRIME NUMBER FOR A CRYPTOGRAPHIC APPLICATION
    • EP3364592A1
    • 2018-08-22
    • EP17305191.3
    • 2017-02-21
    • GEMALTO SAISSM SAS
    • BERZATI, AlexandreROUSSELLET, Mylène
    • H04L9/00H04L9/30G06F7/72
    • H04L9/3033G06F7/72G06F2207/7204H04L9/003
    • The present invention relates to a method for generating a prime number and using it in a cryptographic application, comprising the steps of:
      a) determining at least one binary base B with a small size b = log 2 (B) bits and for each determined base B at least one small prime p i such that B mod p i = 1, with i an integer,
      b) selecting a prime candidate Y P ,
      c) decomposing the selected prime candidate Y P in a base B selected among said determined binary bases : Y P = ∑ y j B i
      d) computing a residue y PB from the candidate Y P for said selected base such that y PB = ∑ y j
      e) testing if said computed residue y PB is divisible by one small prime p i selected among said determined small primes for said selected base B,
      f) while said computed residue y PB is not divisible by said selected small prime, iteratively repeating above step e) until tests performed at step e) prove that said computed residue y PB is not divisible by any of said determined small primes for said selected base B,
      g) when said computed residue y PB is not divisible by any of said determined small primes for said selected base B, iteratively repeating steps c) to f) for each base B among said determined binary bases,
      h) when, for all determined bases B, said residue y PB computed for a determined base is not divisible by any of said determined small primes for said determined base B, executing a known rigorous probable primality test on said candidate Y P , and when the known rigorous probable primality test is a success, storing said prime candidate Y P and using said stored prime candidate Y P in said cryptographic application.
    • 9. 发明公开
    • A PROTECTION METHOD AND DEVICE AGAINST A SIDE-CHANNEL ANALYSIS
    • 一种防止边道分析的保护方法和装置
    • EP3264668A1
    • 2018-01-03
    • EP16176721.5
    • 2016-06-28
    • ESHARD
    • WURCKER, AntoineTHIEBEAULD DE LA CROUEE, Hugues
    • H04L9/00
    • H04L9/003G09C1/00H04L2209/046H04L2209/12
    • The invention relates to a method for executing by a circuit a bit permutation operation (OPR) by which bits of an input data are mixed to obtain an output data comprising at least two words, the method comprising: generating a first mask set (U) comprising mask parameters (U[I]), the mask set comprising one word column (Ui) per word of the input data, each word column comprising a same number of occurrences of all possible values of one input data word in relation with a size of the input data word; generating an input set (PX) by combining the input data with each mask parameter of the first mask set by Exclusive OR (XOR) operations (⊕); and computing an output set (PR) comprising output data resulting from the application of the bit permutation operation to each data in the input set, the first mask set being generated such that the output set comprises columns of output words, each output word column comprising a same number of occurrences of all possible values of one output word in relation with a size of the output word.
    • 本发明涉及一种由电路执行比特置换操作(OPR)的方法,通过该比特置换操作(OPR)将输入数据的比特混合以获得包括至少两个单词的输出数据,所述方法包括:生成第一掩模集合(U) 包括掩码参数(U [I]),所述掩码集包括输入数据的每个字的一个字列(Ui),每个字列包括与一个输入数据字的大小相关的一个输入数据字的所有可能值的相同出现次数 的输入数据字; 通过将输入数据与通过异或(XOR)运算(⊕)设置的第一掩码的每个掩码参数组合来生成输入集合(PX); 并且计算输出集合(PR),该输出集合包括通过对输入集合中的每个数据应用比特置换操作而得到的输出数据,第一掩码集合被生成为使得输出集合包括输出字的列,每个输出字列包括 一个输出字的所有可能值的出现次数与输出字的大小相同。