Method and apparatus for finite field basis conversion
    1.
    发明授权
    Method and apparatus for finite field basis conversion 有权
    用于有限域转换的方法和装置

    公开(公告)号:US07190789B2

    公开(公告)日:2007-03-13

    申请号:US09933720

    申请日:2001-08-22

    IPC分类号: H04L9/00

    摘要: A method and systems provided for basis conversion in a cryptographic system. The method comprises the steps of a first correspondent transmitting an element represented in the first basis to an intermediate processor, the intermediate processor converting the element into a second basis representation and forwarding the converted element to the first correspondent who then uses the converted element in a cryptographic operation. A further embodiment of the invention provides for the intermediate processor to perform the basis conversion on a field element and then forward the converted element to a second correspondent. A still further embodiment of the invention provides for the correspondents in a cryptographic scheme making use of a bit string as a function of a sequence of traces of a field element, wherein the bit string is a shared secret for performing certain cryptographic operations.

    摘要翻译: 提供用于密码系统中基础转换的方法和系统。 该方法包括以下步骤:第一通信对象将第一基础中表示的元素发送到中间处理器,中间处理器将元素转换为第二基本表示,并将转换的元素转发到第一通信对象,然后使用转换后的元素 加密操作。 本发明的另一实施例提供了中间处理器对场元素执行基础转换,然后将转换后的元素转发到第二通讯对象。 本发明的另一个实施例提供了使用位串作为场元素的轨迹序列的函数的加密方案中的通信对象,其中该位串是用于执行某些加密操作的共享秘密。

    Method for accelerating cryptographic operations on elliptic curves
    2.
    发明授权
    Method for accelerating cryptographic operations on elliptic curves 有权
    加速椭圆曲线加密操作的方法

    公开(公告)号:US07110538B2

    公开(公告)日:2006-09-19

    申请号:US09885959

    申请日:2001-06-22

    IPC分类号: H04K1/00 H04L9/00 H04L9/28

    CPC分类号: G06F7/725

    摘要: This invention provides a method for accelerating multiplication of an elliptic curve point Q(x,y) by a scalar k, the method comprising the steps of selecting an elliptic curve over a finite field Fq where q is a prime power such that there exists an endomorphism Ψ, where Ψ(Q)=λ.Q for all points Q(x,y) on the elliptic curve: and using smaller representations ki of the scalar k in combination with the mapping Ψ to compute the scalar multiple of the elliptic curve point Q.

    摘要翻译: 本发明提供了一种用于加速椭圆曲线点Q(x,y)乘以标量k的方法,所述方法包括以下步骤:在有限域Fq上选择椭圆曲线,其中q是素数,使得存在 同构Psi,其中对于椭圆曲线上的所有点Q(x,y),Psi(Q)= lambda.Q;以及使用标量k的较小表示k i i与映射Psi至 计算椭圆曲线点Q的标量倍数。

    Arithmetic processor for finite field and module integer arithmetic operations
    3.
    发明授权
    Arithmetic processor for finite field and module integer arithmetic operations 有权
    用于有限域和模块整数运算的算术处理器

    公开(公告)号:US06349318B1

    公开(公告)日:2002-02-19

    申请号:US09418217

    申请日:1999-10-14

    IPC分类号: G06F700

    摘要: The present disclosure provides an arithmetic processor having an arithmetic logic unit having a plurality of arithmetic circuits each for performing a group of associated arithmetic operations, such as finite field operations, or modular integer operations. The arithmetic logic unit has an operand input data bus, for receiving operand data thereon and a result data output bus for returning the results of the arithmetic operations thereon. A register file is coupled to the operand data bus and the result data bus. The register file is shared by the plurality of arithmetic circuits. Further a controller is coupled to the ALU and the register file, the controller selecting one of the plurality of arithmetic circuits in response to a mode control signal requesting an arithmetic operation and for controlling data access between the register file and the ALU and whereby the register file is shared by the arithmetic circuits.

    摘要翻译: 本公开提供了具有算术逻辑单元的算术处理器,该算术逻辑单元具有多个运算电路,每个运算电路用于执行一组相关联的算术运算,例如有限场运算或模数整数运算。 算术逻辑单元具有用于在其上接收操作数数据的操作数输入数据总线和用于返回其上的算术运算结果的结果数据输出总线。 寄存器文件耦合到操作数数据总线和结果数据总线。 寄存器文件由多个运算电路共享。 此外,控制器耦合到ALU和寄存器文件,控制器响应于请求算术运算的模式控制信号和用于控制寄存器文件和ALU之间的数据访问来选择多个算术电路中的一个,由此寄存器 文件由算术电路共享。

    Signatures with confidential message recovery

    公开(公告)号:US09455832B2

    公开(公告)日:2016-09-27

    申请号:US12230799

    申请日:2008-09-04

    IPC分类号: H04L9/30 H04L9/32

    摘要: A portion of the signed message in an ECPVS is kept truly confidential by dividing the message being signed into at least three parts, wherein one portion is visible, another portion is recoverable by any entity and carries the necessary redundancy for verification, and at least one additional portion is kept confidential. The additional portion is kept confidential by encrypting such portion using a key generated from information specific to that verifying entity. In this way, any entity with access to the signer's public key can verify the signature by checking for a specific characteristic, such as a certain amount of redundancy in the one recovered portion, but cannot recover the confidential portion, only the specific entity can do so. Message recovery is also provided in an elliptic curve signature using a modification of the well analyzed ECDSA signing equation instead of, e.g. the Schnorr equation used in traditional PV signature schemes.

    One way authentication
    7.
    发明授权
    One way authentication 有权
    单向认证

    公开(公告)号:US08938617B2

    公开(公告)日:2015-01-20

    申请号:US13618358

    申请日:2012-09-14

    摘要: A cryptosystem prevents replay attacks within existing authentication protocols, susceptible to such attacks but containing a random component, without requiring modification to said protocols. The entity charged with authentication maintains a list of previously used bit patterns, extracted from a portion of the authentication message connected to the random component. If the bit pattern has been seen before, the message is rejected; if the bit pattern has not been seen before, the bit pattern is added to the stored list and the message is accepted.

    摘要翻译: 密码系统防止现有认证协议中的重放攻击,容易受到这种攻击但包含随机组件,而不需要修改所述协议。 充电认证的实体维护从连接到随机组件的认证消息的一部分中提取的先前使用的位模式的列表。 如果之前已经看到位模式,则消息被拒绝; 如果以前没有看到位模式,则将位模式添加到存储的列表中,并且该消息被接受。

    Implicit certificate scheme
    9.
    发明授权
    Implicit certificate scheme 有权
    隐性证书制度

    公开(公告)号:US08705735B2

    公开(公告)日:2014-04-22

    申请号:US13527060

    申请日:2012-06-19

    IPC分类号: H04L9/08

    摘要: A method of generating a public key in a secure digital communication system, having at least one trusted entity CA and subscriber entities A. The trusted entity selects a unique identity distinguishing each entity A. The trusted entity then generates a public key reconstruction public data of the entity A by mathematically combining public values obtained from respective private values of the trusted entity and the entity A. The unique identity and public key reconstruction public data of the entity A serve as A's implicit certificate. The trusted entity combines the implicit certificate information with a mathematical function to derive an entity information ƒ and generates a value kA by binding ƒ with private values of the trusted entity. The trusted entity transmits the value kA to the entity to permit A to generate a private key from kA, A's private value and A's implicit certificate.

    摘要翻译: 一种在具有至少一个可信实体CA和订户实体A的安全数字通信系统中生成公共密钥的方法。可信实体选择区分每个实体A的唯一标识。然后,可信实体生成公共密钥重建公共数据 实体A通过数学地组合从可信实体的相应私有值和实体A获得的公共值。实体A的唯一身份和公钥重建公共数据用作A的隐式证书。 可信实体将隐式证书信息与数学函数组合以导出实体信息ƒ并通过将ƒ与可信实体的私有值绑定来生成值kA。 可信实体将值kA发送给实体,以允许A从kA,A的私有值和A的隐式证书生成私钥。

    Aggregate signature schemes
    10.
    发明授权

    公开(公告)号:US08582772B2

    公开(公告)日:2013-11-12

    申请号:US13461586

    申请日:2012-05-01

    IPC分类号: H04K1/00 G05B11/01 G08C19/12

    摘要: An authenticated RFID system is provided that uses elliptic curve cryptography (ECC) to reduce the signature size and read/write times when compared to traditional public key implementations such as RSA. Either ECDSA or ECPVS can be used to reduce the signature size and ECPVS can be used to hide a portion of the RFID tag that contains sensitive product identifying information. As a result, smaller tags can be used or multiple signatures can be written at different stages in a manufacturing or supply chain. A key management system is used to distribute the verification keys and aggregate signature schemes are also provided for adding multiple signatures to the RFID tags, for example in a supply chain.