中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

187 records (took 0.018 seconds)

    Method and apparatus for verifiable generation of public keys
    21.
    发明授权
    Method and apparatus for verifiable generation of public keys 有权
    用于验证公钥生成的方法和装置

    公开(公告)号：US09160530B2

    公开(公告)日：2015-10-13

    申请号：US14203079

    申请日：2014-03-10

    Applicant: Certicom Corp.

    Inventor： Daniel Richard L. Brown

    IPC: H04L9/32 ,  H04L29/06 ,  H04L9/08 ,  H04L9/30

    CPC classification number: H04L63/045 ,  H04L9/0861 ,  H04L9/3066 ,  H04L9/321 ,  H04L9/3236 ,  H04L9/3247 ,  H04L9/3252 ,  H04L9/3263 ,  H04L63/0823

    Abstract: The invention provides a method of verifiable generation of public keys. According to the method, a self-signed signature is first generated and then used as input to the generation of a pair of private and public keys. Verification of the signature proves that the keys are generated from a key generation process utilizing the signature. A certification authority can validate and verify a public key generated from a verifiable key generation process.

    Abstract translation: 本发明提供了可验证地生成公钥的方法。 根据该方法，首先生成自签名签名，然后将其用作生成一对私钥和公钥的输入。 签名的验证证明密钥是利用签名的密钥生成过程产生的。 认证机构可以验证和验证从可验证密钥生成过程产生的公钥。

    Method to calculate square roots for elliptic curve cryptography
    22.
    发明授权
    Method to calculate square roots for elliptic curve cryptography 有权
    计算椭圆曲线密码学平方根的方法

    公开(公告)号：US09148282B2

    公开(公告)日：2015-09-29

    申请号：US13920426

    申请日：2013-06-18

    Applicant: Certicom Corp.

    Inventor： Robert John Lambert

    IPC: H04L9/30 ,  G06F7/72

    CPC classification number: H04L9/3066 ,  G06F7/72 ,  G06F7/725

    Abstract: A method is presented to compute square roots of finite field elements from the prime finite field of characteristic p over which points lie on a defined elliptic curve. Specifically, while performing point decompression of points that lie on a standardized elliptic curve over a prime finite field of characteristic 2224−296+1, the present method utilizes short Lucas sub-sequences to optimize the implementation of a modified version of Mueller's square root algorithm, to find the square root modulo of a prime number. The resulting method is at least twice as fast as standard methods employed for square root computations performed on elliptic curves.

    Abstract translation: 提出了一种从特征p的主有限域计算有限域元素的平方根的方法，其中点位于定义的椭圆曲线上。 具体来说，当在特征2224-296 + 1的主要有限域上执行位于标准化椭圆曲线上的点的点解压缩时，本方法利用短Lucas子序列来优化Mueller平方根算法的修改版本的实现 ，找到素数的平方根模。 所得到的方法至少是用于在椭圆曲线上进行的平方根计算的标准方法的两倍。

    Elliptic curve random number generation
    24.
    发明授权
    Elliptic curve random number generation 有权
    椭圆曲线随机数生成

    公开(公告)号：US08948388B2

    公开(公告)日：2015-02-03

    申请号：US13770533

    申请日：2013-02-19

    Applicant: Certicom Corp.

    Inventor： Daniel Richard L. Brown ,  Scott Alexander Vanstone

    IPC: H04L9/00 ,  H04L9/08 ,  G06F7/58 ,  H04L9/30 ,  H04L9/06 ,  G06F7/72

    CPC classification number: H04L9/0869 ,  G06F7/582 ,  G06F7/588 ,  G06F7/725 ,  H04L9/0662 ,  H04L9/0816 ,  H04L9/0894 ,  H04L9/3066 ,  H04L2209/20 ,  H04L2209/24 ,  H04L2209/26

    Abstract: An elliptic curve random number generator avoids escrow keys by choosing a point Q on the elliptic curve as verifiably random. An arbitrary string is chosen and a hash of that string computed. The hash is then converted to a field element of the desired field, the field element regarded as the x-coordinate of a point Q on the elliptic curve and the x-coordinate is tested for validity on the desired elliptic curve. If valid, the x-coordinate is decompressed to the point Q, wherein the choice of which is the two points is also derived from the hash value. Intentional use of escrow keys can provide for back up functionality. The relationship between P and Q is used as an escrow key and stored by for a security domain. The administrator logs the output of the generator to reconstruct the random number with the escrow key.

    Abstract translation: 椭圆曲线随机数发生器通过选择椭圆曲线上的点Q可以无限次地避免代管钥匙。 选择一个任意的字符串，并计算该字符串的散列。 然后将散列转换为所需场的场元素，将该场元素视为椭圆曲线上的点Q的x坐标，并且在期望的椭圆曲线上测试x坐标的有效性。 如果有效，则将x坐标解压缩到点Q，其中，从哈希值得出两个点的选择。 意向使用代管键可以提供备份功能。 P和Q之间的关系用作托管密钥，并由安全域存储。 管理员记录生成器的输出，用代管密钥重构随机数。

    Accelerated Verification of Digital Signatures and Public Keys
    26.
    发明申请
    Accelerated Verification of Digital Signatures and Public Keys 审中-公开
    加速验证数字签名和公钥

    公开(公告)号：US20140344579A1

    公开(公告)日：2014-11-20

    申请号：US14318313

    申请日：2014-06-27

    Applicant: Certicom Corp.

    Inventor： Marinus STRUIK ,  Daniel Richard L. BROWN ,  Scott Alexander VANSTONE ,  Robert Philip GALLANT ,  Adrian ANTIPA ,  Robert John LAMBERT

    IPC: H04L9/30 ,  H04L9/32

    CPC classification number: H04L9/3066 ,  G06F7/725 ,  H04L9/30 ,  H04L9/3252

    Abstract: Accelerated computation of combinations of group operations in a finite field is provided by arranging for at least one of the operands to have a relatively small bit length. In a elliptic curve group, verification that a value representative of a point R corresponds the sum of two other points uG and vG is obtained by deriving integers w,z of reduced bit length and that v=w/z. The verification equality R=uG+vQ may then be computed as −zR+(uz mod n)+wQ=O with z and w of reduced bit length This is beneficial in digital signature verification where increased verification can be attained.

    Abstract translation: 通过将至少一个操作数布置成具有相对较小的比特长度来提供有限域中的组操作的组合的加速计算。 在椭圆曲线组中，验证表示点R的值对应于两个其他点uG和vG的和是通过导出减小位长度的整数w，z以及v = w / z获得的。 然后，验证等式R = uG + vQ可以被计算为-zR +（uz mod n）+ wQ = 0，其中z和w为减少的比特长度这对于可以获得增加的验证的数字签名验证是有益的。

    Assessing Cryptographic Entropy
    27.
    发明申请
    Assessing Cryptographic Entropy 审中-公开
    评估密码熵

    公开(公告)号：US20140301547A1

    公开(公告)日：2014-10-09

    申请号：US14318005

    申请日：2014-06-27

    Applicant: Certicom Corp.

    Inventor： Daniel Richard L. Brown

    IPC: H04L9/00

    CPC classification number: H04L9/001 ,  H04L9/0869 ,  H04L2209/26

    Abstract: Systems, methods, software, and combinations thereof for evaluating entropy in a cryptography system are described. In some aspects, sample values are produced by an entropy source system. A typicality can be determined for each of the sample values. A grading is determined for preselected distributions based on the typicalities of the sample values. A subset of the preselected distributions are selected based on the gradings. An entropy of the entropy source system is calculated based on the subset of the plurality of distributions.

    Abstract translation: 描述了用于评估加密系统中的熵的系统，方法，软件及其组合。 在某些方面，样本值由熵源系统产生。 可以为每个样本值确定典型性。 根据样本值的典型值确定预选分布的分级。 基于分级选择预选分布的子集。 基于多个分布的子集来计算熵源系统的熵。

    HTTP Layer Countermeasures Against Blockwise Chosen Boundary Attack
    28.
    发明申请
    HTTP Layer Countermeasures Against Blockwise Chosen Boundary Attack 有权
    HTTP层对抗边界选择边界攻击的对策

    公开(公告)号：US20140136834A1

    公开(公告)日：2014-05-15

    申请号：US13676730

    申请日：2012-11-14

    Applicant: RESEARCH IN MOTION LIMITED ,  CERTICOM CORP.

    Inventor： Alexander SHERKIN ,  Gregory Marc ZAVERUCHA ,  Alexander TRUSKOVSKY ,  Michael MATOVSKY ,  Osman Zohaib ARFEEN

    IPC: H04L29/06

    CPC classification number: H04L63/0428 ,  H04L63/0823 ,  H04L63/166

    Abstract: A client application, when executed by a processor, is operative to create a HyperText Transfer Protocol (HTTP) request containing a target header that includes a confidential value. The HTTP request is to be sent over a Secure Sockets Layer (SSL) 3.0 connection or a Transport Layer Security (TLS) 1.0 connection to a web server. The client application implements at its HTTP layer a countermeasure to a blockwise chosen-boundary attack. The client application generates an additional header having a header name that is not recognizable by the web server and inserts the additional header into the HTTP request ahead of the target header, thus creating a modified HTTP request. The modified HTTP request is to be sent, instead of the unmodified HTTP request, over the SSL 3.0 connection or the TLS 1.0 connection to the web server.

    Abstract translation: 当由处理器执行时，客户端应用程序可操作以创建包含包含机密值的目标报头的超文本传输​​协议（HTTP）请求。 HTTP请求将通过安全套接字层（SSL）3.0连接或传输层安全（TLS）1.0连接发送到Web服务器。 客户端应用程序在其HTTP层实现了对块选择边界攻击的对策。 客户机应用程序生成一个额外的标头，其标题名称不能由Web服务器识别，并将附加标头插入到目标标题之前的HTTP请求中，从而创建修改的HTTP请求。 修改的HTTP请求将通过SSL 3.0连接或与服务器的TLS 1.0连接发送，而不是未修改的HTTP请求。

    Method and System for Generating Implicit Certificates and Applications to Identity-Based Encryption (IBE)
    29.
    发明申请
    Method and System for Generating Implicit Certificates and Applications to Identity-Based Encryption (IBE) 有权
    用于生成隐式证书和应用程序到基于身份的加密（IBE）的方法和系统

    公开(公告)号：US20130318342A1

    公开(公告)日：2013-11-28

    申请号：US13887120

    申请日：2013-05-03

    Applicant: Certicom Corp.

    Inventor： Scott A. VANSTONE

    IPC: H04L9/32

    CPC classification number: H04L9/3263 ,  H04L9/3073

    Abstract: The invention relates to a method of generating an implicit certificate and a method of generating a private key from a public key. The method involves a method generating an implicit certificate in three phases. The public key may be an entity's identity or derived from an entity's identify. Only the owner of the public key possesses complete information to generate the corresponding private key. No authority is required to nor able to generate an entity's private key.

    Abstract translation: 本发明涉及一种生成隐式证书的方法和一种从公开密钥生成私钥的方法。 该方法涉及三个阶段生成隐式证书的方法。 公钥可以是实体的身份，也可以来自实体的身份。 只有公钥的所有者拥有完整的信息才能生成相应的私钥。 不需要权限，也不能生成实体的私钥。

Patent Agency Ranking