会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • METHOD OF AND APPARATUS FOR THE REDUCTION OF A POLYNOMIAL IN A BINARY FINITE FIELD, IN PARTICULAR IN THE CONTEXT OF A CRYPTOGRAPHIC APPLICATION
    • 用于在二进制有限域中减少多边形的方法和装置,特别是在CRYPTOGRAPHIC应用的背景下
    • US20100061547A1
    • 2010-03-11
    • US12225357
    • 2007-03-21
    • Peter LangendörferSteffen Peter
    • Peter LangendörferSteffen Peter
    • H04L9/28G06F7/483G06F7/72
    • G06F7/724
    • A method of reducing a first data word corresponding to a polynomial C(x) and having a length of a maximum of 2n−1 to a second data word of a length of a maximum m which in a binary finite field GF(2m) whose elements are of a maximum length m corresponds to a polynomial C″0(x) equivalent to C(x), wherein m is smaller than or equal to n, includes partitioning of the first data word into a binary first sub-data word C0 and a binary second sub-data word C1, repeated right-shift of C1 to form summand terms until a respective summand term is associated with each non-disappearing term of a reduction trinomial or pentanomial which is not the term xm, adding the summand terms formed to the first sub-data word to form a sum data word and applying the partitioning step to the summand data word formed until the ascertained sum data word is of a length of a maximum m and forms the desired second data word.
    • 一种减少与多项式C(x)对应的第一数据字,并且具有最大值为2n-1的长度的第二数据字的长度为最大值m的二进制有限域GF(2m)中的第二数据字, 元素最大长度m对应于等价于C(x)的多项式C“0(x),其中m小于或等于n,包括将第一数据字划分为二进制第一子数据字C0 和二进制第二子数据字C1,C1的重复右移以形成求和项,直到相应的求和项与不是术语xm的还原三项式或者五项式的每个不消失项相关联,并将加和项 形成为第一子数据字以形成和数据字,并将划分步骤应用于形成的求和数据字,直到所确定的和数据字的长度为最大m并形成期望的第二数据字。