Encryption method for secure packet transmission
    1.
    发明授权
    Encryption method for secure packet transmission 有权
    用于安全分组传输的加密方法

    公开(公告)号:US08583929B2

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

    申请号:US11441969

    申请日:2006-05-26

    IPC分类号: H04L9/32

    摘要: Methods are provided for securely transmitting a packet between endpoints of a network. In one aspect, there is provided a method for establishing an end-to-end key using extant hop-by-hop security associations. In a second aspect, there is provided a method in which a packet-specific encryption key PEK is used to encrypt a packet p. A signature of the key PEK is independently computed at each of two nodes, using an integrity key shared by the two nodes. The signature is sent from one of the two nodes to the other in association with the packet p. The receiving node uses the signature to verify that the packet p was originated by an entity having possession of the PEK.

    摘要翻译: 提供了用于在网络的端点之间安全地传送分组的方法。 一方面,提供了一种使用现有的逐跳安全关联来建立端对端密钥的方法。 在第二方面,提供了一种方法,其中使用分组专用加密密钥PEK来加密分组p。 使用两个节点共享的完整性密钥,在两个节点的每一个上独立地计算密钥PEK的签名。 签名从两个节点之一发送到另一个节点,与分组p相关联。 接收节点使用签名来验证分组p是由拥有PEK的实体发起的。

    Encryption method for secure packet transmission
    2.
    发明申请
    Encryption method for secure packet transmission 有权
    用于安全分组传输的加密方法

    公开(公告)号:US20070277035A1

    公开(公告)日:2007-11-29

    申请号:US11441969

    申请日:2006-05-26

    IPC分类号: H04L9/00

    摘要: Methods are provided for securely transmitting a packet between endpoints of a network. In one aspect, there is provided a method for establishing an end-to-end key using extant hop-by-hop security associations. In a second aspect, there is provided a method in which a packet-specific encryption key PEK is used to encrypt a packet p. A signature of the key PEK is independently computed at each of two nodes, using an integrity key shared by the two nodes. The signature is sent from one of the two nodes to the other in association with the packet p. The receiving node uses the signature to verify that the packet p was originated by an entity having possession of the PEK.

    摘要翻译: 提供了用于在网络的端点之间安全地传送分组的方法。 一方面,提供了一种使用现有的逐跳安全关联来建立端对端密钥的方法。 在第二方面,提供了一种方法,其中使用分组专用加密密钥PEK来加密分组p。 使用两个节点共享的完整性密钥,在两个节点的每一个上独立地计算密钥PEK的签名。 签名从两个节点之一发送到另一个节点,与分组p相关联。 接收节点使用签名来验证分组p是由拥有PEK的实体发起的。

    Constructions of variable input length cryptographic primitives for high efficiency and high security
    3.
    发明授权
    Constructions of variable input length cryptographic primitives for high efficiency and high security 有权
    可变输入长度加密原语的构造,用于高效率和高安全性

    公开(公告)号:US07221756B2

    公开(公告)日:2007-05-22

    申请号:US10113666

    申请日:2002-03-28

    IPC分类号: H04L9/00

    摘要: A hash function is applied to a prefix of a VIL input. The output is added to a suffix of the input. A block cipher is applied to results of the addition. An encryption function is performed on the prefix. The final output is the output of the block cipher and the encryption function. In a second encryption technique, a hash function is applied to an input, and the output of the hash function has first and second portions. A block cipher is applied to the second portion. The output of the block cipher is added to the first portion, and a second function is applied to the result of this first addition. The output of the second function is added to the second portion. An inverse hash function is then applied to the output of the first and second additions, creating an encrypted output.

    摘要翻译: 散列函数应用于VIL输入的前缀。 输出被添加到输入的后缀。 将块密码应用于添加的结果。 在前缀上执行加密功能。 最终输出是块密码和加密函数的输出。 在第二加密技术中,将哈希函数应用于输入,并且散列函数的输出具有第一和第二部分。 块密码被应用于第二部分。 将块密码的输出添加到第一部分,并且将第二函数应用于该第一次添加的结果。 第二功能的输出被添加到第二部分。 然后将逆散列函数应用于第一和第二加法的输出,创建加密输出。

    Method for generating pseudo-random numbers
    4.
    发明授权
    Method for generating pseudo-random numbers 失效
    用于产生伪随机数的方法

    公开(公告)号:US06285761B1

    公开(公告)日:2001-09-04

    申请号:US09034829

    申请日:1998-03-04

    IPC分类号: H04L928

    摘要: The present invention is a method for outputting larger bit size pseudo-random number zi that is cryptographically secure. Since larger bit size pseudo-random numbers are being outputted, larger bit size segments of messages may be encrypted resulting in a speedier encryption process than encryption processes of the prior art. In one embodiment, the present invention is a pseudo-random number generator defined by a modular exponential function xi=gxi−1 mod p. The output of the pseudo-random number generator being a pseudo-random number zi comprising a j−1 bit size segment of xi. The value of j being less than or equal to m−2c (i.e., j≦m−2c). In an embodiment of the present invention, the pseudo-random number zi includes the j least significant bits of xi excluding the least significant bit of xi.

    摘要翻译: 本发明是用于输出密码安全的较大位大小的伪随机数zi的方法。 由于正在输出较大的比特大小的伪随机数,所以消息的较大的比特大小的段可能被加密,导致比现有技术的加密处理更快的加密过程。 在一个实施例中,本发明是由模数指数函数定义的伪随机数发生器。伪随机数发生器的输出是包含xi的j-1位大小段的伪随机数zi。 j的值小于或等于m-2c(即,j <= m-2c)。 在本发明的一个实施例中,伪随机数zi包括不包括xi的最低有效位的xi的j个最低有效位。

    METHOD FOR AUTHENTICATING A MOBILE UNIT ATTACHED TO A FEMTOCELL THAT OPERATES ACCORDING TO CODE DIVISION MULTIPLE ACCESS
    7.
    发明申请
    METHOD FOR AUTHENTICATING A MOBILE UNIT ATTACHED TO A FEMTOCELL THAT OPERATES ACCORDING TO CODE DIVISION MULTIPLE ACCESS 有权
    用于认证移动单元连接到根据代码段多功能访问的FEMTOCELL的方法

    公开(公告)号:US20120184249A1

    公开(公告)日:2012-07-19

    申请号:US13428192

    申请日:2012-03-23

    IPC分类号: H04W12/04

    CPC分类号: H04W12/06 H04W84/045

    摘要: The present invention provides a method involving a femtocell in communication with an Internet Protocol Multimedia Subsystem (IMS) network. In one embodiment, the femtocell operates according to code division multiple access (CDMA) standards. The method includes receiving, from the femtocell and at a first secure entity in the IMS network, first authentication information generated by the mobile unit using a first random number broadcast by the femtocell in a global challenge. The method also includes receiving, from a second secure entity in the secure network, at least one security key formed based on the global challenge and second authentication information for uniquely challenging the mobile unit. In one embodiment, the second secure entity is a CDMA-based authentication server. The method further includes providing the security key(s) to the femtocell in response to authenticating the mobile unit based upon the second authentication information.

    摘要翻译: 本发明提供一种涉及与因特网协议多媒体子系统(IMS)网络通信的毫微微小区的方法。 在一个实施例中,毫微微小区根据码分多址(CDMA)标准进行操作。 该方法包括从毫微微小区和IMS网络中的第一安全实体接收移动单元使用在全球挑战中由毫微微小区广播的第一随机数生成的第一认证信息。 该方法还包括从安全网络中的第二安全实体接收基于全局挑战形成的至少一个安全密钥和用于唯一挑战移动单元的第二认证信息。 在一个实施例中,第二安全实体是基于CDMA的认证服务器。 所述方法还包括响应于基于所述第二认证信息认证所述移动单元向所述毫微微小区提供所述安全密钥。

    Method of generating a public long code mask
    9.
    发明授权
    Method of generating a public long code mask 失效
    生成公共长码掩码的方法

    公开(公告)号:US07577086B2

    公开(公告)日:2009-08-18

    申请号:US10824216

    申请日:2004-04-14

    IPC分类号: H04J11/00

    CPC分类号: H04W36/16 H04B7/2637

    摘要: The present invention provides a method of generating a public long code mask. The method includes generating a code mask for coding transmissions over a traffic channel based on at least one frequency differentiator indicative of a frequency range, at least one band class differentiator indicative of a band class, and at least one traffic channel differentiator indicative of a traffic channel.

    摘要翻译: 本发明提供一种生成公共长码掩码的方法。 该方法包括:基于指示频率范围的至少一个频率微分器,指示频带类别的至少一个频带类微分器,以及指示业务量的至少一个业务信道微分器,生成业务信道上用于编码传输的码掩码 渠道。

    Performing authentication in a communications system

    公开(公告)号:US20070021105A1

    公开(公告)日:2007-01-25

    申请号:US11526959

    申请日:2006-09-26

    申请人: Sarvar Patel

    发明人: Sarvar Patel

    IPC分类号: H04M1/66

    摘要: A method and apparatus for performing authentication in a communications system is provided. The method includes receiving a request for authentication from a server, the request for authentication including a first and a second random challenge, and comparing the first random challenge and the second random challenge. The method further includes denying the request for authentication in response to determining that the first random challenge is substantially the same as the second random challenge, and transmitting an encoded value to the server in response to determining that the first random challenge is different from the second random challenge, wherein the encoded value is generated based on the first and second random challenge and a key that is not shared with the server.