Challenge-Response Authentication Using a Masked Response Value

    公开(公告)号:US20140156998A1

    公开(公告)日:2014-06-05

    申请号:US13690996

    申请日:2012-11-30

    Applicant: CERTICOM CORP.

    Abstract: Challenge-response authentication protocols are disclosed herein, including systems and methods for a first device to authenticate a second device. In one embodiment, the following operations are performed by the first device: (a) sending to the second device: (i) a challenge value corresponding to an expected response value known by the first device, and (ii) a hiding value; (b) receiving from the second device a masked response value; (c) obtaining an expected masked response value from the expected response value and the hiding value; and (d) determining whether the expected masked response value matches the masked response value received from the second device. The operations from the perspective of the second device are also disclosed, which in some embodiments include computing the masked response value using the challenge value, the hiding value, and secret information known to the second device.

    Public Key Encryption Algorithms for Hard Lock File Encryption
    13.
    发明申请
    Public Key Encryption Algorithms for Hard Lock File Encryption 有权
    用于硬锁文件加密的公钥加密算法

    公开(公告)号:US20170012946A1

    公开(公告)日:2017-01-12

    申请号:US14930179

    申请日:2015-11-02

    Abstract: In some aspects, an encryption method comprises encrypting a first portion of a message using a first secret key. The first secret key is generated based on the public key of an entity. A one-way function is used to generate a second secret key from the first secret key, and the first secret key is subsequently discarded. A second portion of the message is encrypted using the second secret key. The encrypted first portion of the message and the encrypted second portion of the message are provided to the entity.

    Abstract translation: 在一些方面,加密方法包括使用第一秘密密钥加密消息的第一部分。 第一个秘密密钥是根据实体的公钥生成的。 单向函数用于从第一秘密密钥生成第二秘密密钥,并且随后丢弃第一秘密密钥。 消息的第二部分使用第二秘密密钥进行加密。 将消息的加密的第一部分和消息的加密的第二部分提供给实体。

    Public key encryption algorithms for hard lock file encryption
    14.
    发明授权
    Public key encryption algorithms for hard lock file encryption 有权
    用于硬锁文件加密的公钥加密算法

    公开(公告)号:US09178699B2

    公开(公告)日:2015-11-03

    申请号:US14073379

    申请日:2013-11-06

    Abstract: In some aspects, an encryption method comprises encrypting a first portion of a message using a first secret key. The first secret key is generated based on the public key of an entity. A one-way function is used to generate a second secret key from the first secret key, and the first secret key is subsequently discarded. A second portion of the message is encrypted using the second secret key. The encrypted first portion of the message and the encrypted second portion of the message are provided to the entity.

    Abstract translation: 在一些方面,加密方法包括使用第一秘密密钥加密消息的第一部分。 第一个秘密密钥是根据实体的公钥生成的。 单向函数用于从第一秘密密钥生成第二秘密密钥,并且随后丢弃第一秘密密钥。 消息的第二部分使用第二秘密密钥进行加密。 将消息的加密的第一部分和消息的加密的第二部分提供给实体。

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

    公开(公告)号:US09148282B2

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

    申请号:US13920426

    申请日:2013-06-18

    Applicant: Certicom Corp.

    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平方根算法的修改版本的实现 ,找到素数的平方根模。 所得到的方法至少是用于在椭圆曲线上进行的平方根计算的标准方法的两倍。

Patent Agency Ranking