Abstract: A method of establishing authentication keys at both a network and mobile equipment are provided. The authentication key generated by the mobile equipment is based on both mobile keys and network keys, which are each calculated by the mobile equipment. The authentication key generated by the network is based on both mobile keys and network keys, which are each calculated by the network. The mobile keys are calculated from a challenge generated by the mobile equipment and the network keys generated by the mobile based on a challenge generated by network.

Abstract: Described is a method by mobile equipment to communicate with a network. The method includes receiving a network authentication token having a first message authentication code, an authentication message field and a first extended sequence number that includes a first hardware identifier and first sequence number, and authenticating the network based on the first message authentication code, the first hardware identifier, and the first sequence number.

Abstract: Example embodiments of the present invention disclose a method for processing an application packet for transmission includes receiving a plurality of segments of the application packet in a byte stream, the byte stream including a plurality of blocks, creating a plurality of superblocks within the byte stream by grouping a number of the plurality of blocks within the byte stream, and creating first pseudorandom bits for the plurality of superblocks. The method also includes determining a block number and a superblock number for a beginning of each of the plurality of segments, determining a block number and a superblock number for an ending of each of the plurality of segments in the byte stream.

Abstract: One example embodiment of the present invention discloses a method for processing an application packet for transmission, includes breaking the application packet into a plurality of segments, creating first pseudorandom bits, and generating partial tags based on each of the plurality of segments and portions of the first pseudorandom bits associated with each of the plurality of segments. The method further including combining the partial tags including a last partial tag associated with a last segment of the application packet to create an accumulated tag, generating an authentication tag based on the accumulated tag and second pseudorandom bits, storing the authentication tag, and transmitting the plurality of segments including the authentication tag.

Abstract: In an encryption method, an input block of data is reversibly processed to produce a string that is at least partially randomized. The randomized string is then encrypted by a block cipher. In decryption, the input block of encrypted data is first decrypted with respect to the block cipher. Then the randomization is reversed.

Abstract: 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.

Abstract: 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.

Abstract: The present invention provides a method for encrypting data for transmission over a wireless link. The method includes encrypting at least one block of data, at an air-interface application layer, using an encryption algorithm that receives a cryptosynch as input. The value of the cryptosynch is based on an order of the at least one block of data relative to other blocks of data. The value of the cryptosynch is recoverable by a receiver based on the ordering of the ordering of the blocks of data. The at least one encrypted block of data is transmitted to a receiver that is operable to preserve the order of the at least one block of data relative to the other blocks of data.

Abstract: An efficient hashing technique uses w 2 + w 2 operations to hash a string “w” words long rather than the w2 operations of the prior art. This efficiency is achieved by squaring the sum of the key and the string to be hashed rather than forming a product of the key and the string to be hashed h(m)=((m+a)2 mod p)mod 21.

Abstract: 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.

Abstract: The present invention provides a method of key material generation for authenticating communication with at least one network application function. The method includes determining first key material in response to a bootstrapping key request and determining second key material in response to determining the first key material. The second key material corresponds to third key material, which is determined and provided to the at least one network application function in response to determining the first key material.

Abstract: The present invention provides a method of key material generation in which the key material is used to authenticate communication for user equipment and at least one network application function. The method includes providing a bootstrapping identifier associated with first key material and a first random number, receiving information indicative of a second random number, and forming second key material based upon the first key material, the first random number, and the second random number.

Abstract: Secure communication protocols are disclosed in which two parties generate a shared secret which may be used as a secure session key for communication between the parties. The protocols are based on Diffie-Hellman type key exchange in which a Diffie-Hellman value is combined with a function of at least a password using the group operation such that the Diffie-Hellman value may be extracted by the other party using the inverse group operation and knowledge of the password. In one embodiment, each of the parties explicitly authenticates the other party, while in another embodiment, the parties utilize implicit authentication relying on the generation of an appropriate secret session key to provide the implicit authentication. Typically, the parties will be a client computer and a server computer.

Abstract: 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.

Abstract: In the method, a value of a first cryptosync for a communication session is derived based on a value of a second cryptosync. The second cryptosync has a longer life than the first cryptosync.

Abstract: According to the two party authentication method, a first party generates and transfers a random number to a second party as a first challenge. The second party increments a count value in response to the first challenge, generates a first challenge response by performing a keyed cryptographic function (KCF) on the first challenge and the count value using a first key, and transfers the count value, as a second challenge, and the first challenge response to the first party. The first party verifies the second party based on the first challenge, the second challenge and the first challenge response. The first party also generates a second challenge response by performing the KCF on the second challenge using the first key, and transfers the second challenge response to the second party. The second party verifies the first party based on the second challenge and the second challenge response. For instance, the first and second parties can be a network and mobile, respectively, in a wireless system.

Abstract: A method is provided for determining a private key for a first network based on at least one security value associated with a second network. The method further includes establishing a plurality of sessions between a mobile terminal and the first network based on the private key.

Abstract: A method and apparatus are provided. The method comprises defining a geographical position of a base station by a first coordinate value and a second coordinate value; modifying the first coordinate value based on the second coordinate value; and generating an identifier based on at least the modified first coordinate value.

Abstract: The present invention is a key conversion system for deterministically and reversibly converting a first key value of a first communications system into a second key value of a second communication system. For example, the key conversion system generates a first intermediate value from at least a portion of the first key value using a first random function. At least a portion of the first intermediate value is provided to a second random function to produce a second value. An exclusive-or is performed on at least a portion of the first key value and at least a portion of the second value to generate a second intermediate value. At least a portion of the second intermediate value is provided to a third random function to produce a third value.

Abstract: In the method a code mask for coding transmission over a traffic channel is generated based on a base station differentiator and a traffic channel differentiator. Base station differentiators are used to differentiate between different base stations and traffic channel differentiators are used by a base station to differentiate between different traffic channels assigned by a base station.