会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Computing isogenies between genus-2 curves for cryptography
    • 计算加密的第2类曲线之间的等值线
    • US08300807B2
    • 2012-10-30
    • US12350222
    • 2009-01-07
    • Reinier M. BrokerKristin E. LauterDavid Gruenewald
    • Reinier M. BrokerKristin E. LauterDavid Gruenewald
    • H04L9/00
    • H04L9/3006
    • This cryptographic curve generation technique provides a faster way of constructing a genus 2 curve. The technique provides a procedure to compute isogenies between genus 2 curves over finite fields. Instead of looping over possible roots, as is typically done when solving Igusa class polynomials, the technique only finds one root and then applies the isogenies to find the others. The technique computes a set of polynomials that define all isogenies. To do this, for a given root of an Igusa class polynomial over a finite field, the technique computes a value of a small modular function ƒ. To the value of this function ƒ, the technique applies an isogeny to find an isogenous ƒ-value. The technique then transforms the ƒ-value back into an Igusa value. Once the Igusa class polynomials are solved they can be used to generate a genus 2 curve which can be used in cryptographic applications.
    • 这种加密曲线生成技术提供了构建第2类曲线的更快速的方法。 该技术提供了一种在有限域上计算第2类曲线之间的等值线的过程。 而不是循环可能的根,如通常在解决Igusa类多项式时完成的,该技术只找到一个根,然后应用等基因来找到其他根。 该技术计算一组定义所有等代的多项式。 为了做到这一点,对于有限域上的Igusa类多项式的给定根,该技术计算小的模块函数ƒ的值。 对于此函数ƒ的值,该技术应用等值线来找到一个均匀的ƒ值。 然后,该技术将ƒ值转换为Igusa值。 一旦解决了Igusa类多项式,就可以使用它们来生成可用于密码应用的第2类曲线。
    • 2. 发明申请
    • Computing Isogenies Between Genus-2 Curves for Cryptography
    • 计算密码学二级曲线之间的等代
    • US20100172491A1
    • 2010-07-08
    • US12350222
    • 2009-01-07
    • Reinier M. BrokerKristin E. LauterDavid Gruenewald
    • Reinier M. BrokerKristin E. LauterDavid Gruenewald
    • H04L9/28
    • H04L9/3006
    • This cryptographic curve generation technique provides a faster way of constructing a genus 2 curve. The technique provides a procedure to compute isogenies between genus 2 curves over finite fields. Instead of looping over possible roots, as is typically done when solving Igusa class polynomials, the technique only finds one root and then applies the isogenies to find the others. The technique computes a set of polynomials that define all isogenies. To do this, for a given root of an Igusa class polynomial over a finite field, the technique computes a value of a small modular function ƒ. To the value of this function ƒ, the technique applies an isogeny to find an isogenous ƒ-value. The technique then transforms the ƒ-value back into an Igusa value. Once the Igusa class polynomials are solved they can be used to generate a genus 2 curve which can be used in cryptographic applications.
    • 这种加密曲线生成技术提供了构建第2类曲线的更快速的方法。 该技术提供了一种在有限域上计算第2类曲线之间的等值线的过程。 而不是循环可能的根,如通常在解决Igusa类多项式时完成的,该技术只找到一个根,然后应用等基因来找到其他根。 该技术计算一组定义所有等代的多项式。 为了做到这一点,对于有限域上的Igusa类多项式的给定根,该技术计算小的模块函数ƒ的值。 对于此函数ƒ的值,该技术应用等值线来找到一个均匀的ƒ值。 然后,该技术将ƒ值转换为Igusa值。 一旦解决了Igusa类多项式,就可以使用它们来生成可用于密码应用的第2类曲线。
    • 4. 发明授权
    • Cryptographic applications of efficiently evaluating large degree isogenies
    • 有效评估大规模同位素的密码学应用
    • US08250367B2
    • 2012-08-21
    • US12242801
    • 2008-09-30
    • Reinier M. BrokerDenis X CharlesKristin E. Lauter
    • Reinier M. BrokerDenis X CharlesKristin E. Lauter
    • H04L9/30
    • H04L9/3073H04L9/3247H04L2209/60H04L2209/80
    • Techniques are disclosed for representing and evaluating large prime degree isogenies for use in cryptographic signature and encryption schemes. An isogeny of prime degree 1 may be represented as an ideal in the form (1, A*alpha+B), where 1 comprises the degree of a prime number, the prime number is split into integers a and b, and alpha is a known endomorphism. For a given degree 1, integers a and b define a unique isogeny, allowing the isogeny to be stored with 3 log(1) bits of information. Techniques are also disclosed to evaluate the isogeny at a given point by decomposing the isogeny into an integer and a plurality of smaller degree isogenies, evaluating the smaller degree isogenies at the point with traditional means, and multiplying the results of the evaluations together and with the integer.
    • 公开了用于表示和评估用于加密签名和加密方案的大质量等值基因的技术。 素数1的均匀性可以表示为形式(1,A *α+ B)的理想,其中1包含质数的程度,素数被分解为整数a和b,而α是 已知的同态 对于给定的程度1,整数a和b定义了一个独特的等同原子,允许使用3个(1)位信息存储等值原理。 还公开了通过将均质分解成整数和多个较小程度的同基物质来评估给定点的同位素的技术,以传统方法评估较小程度的同基性,并将评估结果与 整数。
    • 5. 发明授权
    • Trapdoor pairings
    • Trapdoor配对
    • US08180047B2
    • 2012-05-15
    • US11275560
    • 2006-01-13
    • Kristin E. LauterDenis CharlesAnton Mityagin
    • Kristin E. LauterDenis CharlesAnton Mityagin
    • H04L9/00
    • H04L9/3073
    • Systems and methods are described for trapdoor pairing. In one implementation, a trapdoor pairing is a cryptographic primitive generated by determining a bilinear pairing between an elliptic curve group and another group and selecting a parameter of the bilinear pairing, such as a group order or an isogeny between curves, to be a key for generating and evaluating the bilinear pairing. Trapdoor pairing allows construction of a group in which the Decisional Diffie-Hellman (DDH) problem is computationally infeasible given only the description of the group, but is easy given the secret key. Exemplary trapdoor pairing constructions have general applicability to cryptography and also lend themselves more specifically to certain special practical implementations, such as public key cryptography and certificate authority infrastructures.
    • 描述了用于陷门配对的系统和方法。 在一个实现中,陷门配对是通过确定椭圆曲线组和另一组之间的双线性配对并且选择双线性配对的参数(诸如曲线之间的组次序或等值线)来生成的密码原语作为关键 生成和评估双线性配对。 陷阱配对允许建立一个组,其中决策Diffie-Hellman(DDH)问题在计算上是不可行的,只给出该组的描述,但是很容易给出秘密密钥。 示例性的门锁配对结构具有对密码学的一般适用性,并且还更具体地涉及某些特殊的实际实现,例如公共密钥加密和证书颁发机构的基础设施。