会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Two way authentication protocol
    • 双向认证协议
    • US06487660B1
    • 2002-11-26
    • US09432166
    • 1999-11-02
    • Scott Alexander VanstoneDonald B. JohnsonRobert J. LambertAshok Vadekar
    • Scott Alexander VanstoneDonald B. JohnsonRobert J. LambertAshok Vadekar
    • G06F124
    • G07F7/1008G06Q20/341G06Q20/40975H04L9/0841H04L9/3066H04L9/3273
    • A method of authenticating a pair of correspondents C,S to permit the exchange of information therebetween, each of the correspondents having a respective private key, e, d and a public key, Qu, and Qs derived from a generator element of a group and a respective ones of the private keys e,d, the method comprising the steps of: a first of the correspondents C generating a session value x; the first correspondent generating a private value t, a public value derived from the private value t and the generator and a shared secret value derived from the private value t and the public key Qs of the second correspondent; the second correspondent generating a challenge value y and transmitting the challenge value y to the first correspondent; the first correspondent in response thereto computing a value h by applying a function H to the challenge value y, the session value x, the public value an of the first correspondent; the first correspondent signing the value h utilizing the private key e; the first correspondent transmitting to the second correspondent the signature including the session value x, and the private value t; and the second correspondent verifying the signature utilizing the public key Qu of the first correspondent and whereby verification of the signature authenticates the first correspondent to the second correspondent.
    • 一种认证一对记者C,S以允许它们之间的信息交换的方法,每个通信对象具有从组的发生器元素导出的相应私钥,e,d和公钥Qu和Q,以及 相应的私钥e,d,该方法包括以下步骤:生成会话值x的通信对象C中的第一个; 生成私有值t的第一通信对象,从私有值t和生成器导出的公有值和从私有值t和第二通信对方的公钥Qs导出的共享秘密值; 第二记者产生质询值y并将询问值y发送给第一通讯员; 响应于第一记者通过将函数H应用于质询值y,会话值x,第一记者的公开值a来计算值h; 第一个记者利用私钥e签名值h; 第一记者向第二记者发送包括会话值x和私有值t的签名; 以及第二记者利用第一记者的公钥Qu验证签名,由此签名的验证对第二通信对象的第一对应者进行认证。
    • 6. 发明授权
    • Finite field inverse circuit
    • 有限域反向电路
    • US6009450A
    • 1999-12-28
    • US997943
    • 1997-12-24
    • James Douglas DworkinP. Michael GlaserMichael John TorlaAshok VadekarRobert John LambertScott Alexander Vanstone
    • James Douglas DworkinP. Michael GlaserMichael John TorlaAshok VadekarRobert John LambertScott Alexander Vanstone
    • G06F7/72G06F7/00
    • G06F7/726
    • A finite field inverse circuit has a finite field data unit (1112) and an inverse control unit (1110). The inverse control unit includes (1110) a k.sub.l and k.sub.u decrementer pair (1108, 1122), a k.sub.l -k.sub.u difference unit (1106), an inverse control finite state machine (1102), and a one-bit memory (1104) coupled to the inverse control finite state machine (1102). The finite field data unit (1112) includes four m bit wide registers that are shift registers designated as B (1120), A (1118), M (1114), and C (1116), where B- is a first register, A- is a second register, M- is a irreducible polynomial register, and C- is a field element register. An the irreducible polynomial is loaded left justified in the M-register, a field element to be inverted is loaded left justified in the C-register, and a single "1" is loaded in an LSB bit of the B-register. The field element is then inverted in 2n+2 system clock cycles where n is a field size associated with the field element.
    • 有限域逆电路具有有限场数据单元(1112)和逆控制单元(1110)。 逆控制单元包括(1110)kl和ku减量器对(1108,1122),kl-ku差分单元(1106),逆控制有限状态机(1102)和耦合到一个比特存储器(1104)的一位存储器 到反向有限状态机(1102)。 有限域数据单元(1112)包括四个m位宽的寄存器,它们是指定为B(1120),A(1118),M(1114)和C(1116)的移位寄存器,其中B-是第一寄存器,A - 是第二寄存器,M-是不可约多项式寄存器,C是场元素寄存器。 在M寄存器中左对齐加载不可约多项式,在C寄存器中左对齐加载要反相的场元素,并在B寄存器的LSB位中加载单个“1”。 然后,在2n + 2个系统时钟周期中,场元素被反转,其中n是与场元素相关联的场大小。
    • 7. 发明申请
    • RESILIENT CRYPTOGRAPHIC SCHEME
    • 灵活的CRYPTOGRAPHIC计划
    • US20100284540A1
    • 2010-11-11
    • US12840008
    • 2010-07-20
    • Donald B. JohnsonScott Alexander Vanstone
    • Donald B. JohnsonScott Alexander Vanstone
    • H04L9/08
    • H04L9/3242H04L9/3249
    • A system and method are provided for enabling a symmetric key to be derived, the method comprising: obtaining a plurality of key parts, wherein the plurality of key parts when combined equal the symmetric key; encrypting a first of the key parts using a first cryptographic algorithm to generate a first encrypted value; encrypting one or more remaining key parts of the plurality of key parts using respective cryptographic algorithms to generate one or more additional encrypted values, wherein each key part encrypted is encrypted using a different cryptographic algorithm; and providing the first encrypted value and the one or more additional encrypted values to an other entity to enable the other entity to derive the symmetric key.
    • 提供了一种用于使得能够导出对称密钥的系统和方法,所述方法包括:获得多个密钥部分,其中所述多个密钥部分在组合时等于所述对称密钥; 使用第一密码算法加密第一密钥部分以生成第一加密值; 使用相应的密码算法加密所述多个密钥部分中的一个或多个剩余的关键部分以生成一个或多个附加的加密值,其中使用不同的加密算法加密加密的每个密钥部分; 以及将第一加密值和所述一个或多个附加加密值提供给另一实体以使所述另一实体能够导出所述对称密钥。
    • 8. 发明授权
    • Masked digital signatures
    • 蒙面的数字签名
    • US08359468B2
    • 2013-01-22
    • US13172138
    • 2011-06-29
    • Scott Alexander VanstoneDonald B. JohnsonMinghua Qu
    • Scott Alexander VanstoneDonald B. JohnsonMinghua Qu
    • H04L9/00
    • H04L9/3247G06Q20/341G06Q20/40975G07F7/1008H04L9/3066H04L9/3252H04L2209/04
    • The present invention relates to digital signature operations using public key schemes in a secure communications system and in particular for use with processors having limited computing power such as ‘smart cards’. This invention describes a method for creating and authenticating a digital signature comprising the steps of selecting a first session parameter k and generating a first short term public key derived from the session parameter k, computing a first signature component r derived from a first mathematical function using the short term public key, selecting a second session parameter t and computing a second signature component s derived from a second mathematical function using the second session parameter t and without using an inverse operation, computing a third signature component using the first and second session parameters and sending the signature components (s, r, c) as a masked digital signature to a receiver computer system. In the receiver computer system computing a recovered second signature component s′ by combining a third signature component with the second signature component to derive signature components (s′, r) as an unmasked digital signature. Verifying these signature components as in a usual EIGamal or ECDSA type signature verification.
    • 本发明涉及在安全通信系统中使用公共密钥方案的数字签名操作,特别是与智能卡等计算能力有限的处理器一起使用。 本发明描述了一种用于创建和认证数字签名的方法,包括以下步骤:选择第一会话参数k并生成从会话参数k导出的第一短期公钥,使用从第一数学函数导出的第一签名组件 短期公钥,选择第二会话参数t并且使用第二会话参数t计算从第二数学函数导出的第二签名组件,并且不使用反向操作,使用第一和第二会话参数来计算第三签名组件 并将签名组件(s,r,c)作为掩蔽的数字签名发送到接收机计算机系统。 在接收机计算机系统中,通过将第三签名组件与第二签名组件组合来计算恢复的第二签名组件s',以将签名组件(s',r)导出为未被屏蔽的数字签名。 验证这些签名组件,如通常的EIGAMAL或ECDSA类型的签名验证。
    • 10. 发明授权
    • Hybrid signature scheme
    • 混合签名方案
    • US07877610B2
    • 2011-01-25
    • US11812811
    • 2007-06-21
    • Scott Alexander VanstoneRobert GallantRobert J. LambertLeon A. PintsovFrederick W. Ryan, Jr.Ari Singer
    • Scott Alexander VanstoneRobert GallantRobert J. LambertLeon A. PintsovFrederick W. Ryan, Jr.Ari Singer
    • H04L9/00
    • H04L9/3247H04L9/3252
    • A signature scheme is provided in which a message is divided into a first portion which is hidden and is recovered during verification, and a second portion which is visible and is required as input to the verification algorithm. A first signature component is generated by encrypting the first portion alone. An intermediate component is formed by combining the first component and the visible portion and cryptographically hashing them. A second signature component is then formed using the intermediate component and the signature comprises the first and second components with the visible portion. A verification of the signature combines a first component derived only from the hidden portion of the message with the visible portion and produces a hash of the combination. The computed hash is used together with publicly available information to generate a bit string corresponding to the hidden portion. If the required redundancy is present the signature is accepted and the message reconstructed from the recovered bit string and the visible portion.
    • 提供了一种签名方案,其中消息被分成在验证期间被隐藏并被恢复的第一部分,以及作为验证算法的输入可见并被要求的第二部分。 通过单独加密第一部分来产生第一签名组件。 通过组合第一组件和可见部分并对其进行加密散列来形成中间组件。 然后使用中间部件形成第二签名部件,并且签名包括具有可见部分的第一和第二部件。 签名的验证将仅从消息的隐藏部分导出的第一组件与可见部分组合,并产生组合的散列。 所计算的散列与公开可用的信息一起使用以产生对应于隐藏部分的位串。 如果存在所需的冗余,则签名被接受,并且从恢复的位串和可见部分重建消息。