公开(公告)号：CA2280488A1

公开(公告)日：2000-04-20

申请号：CA2280488

申请日：1999-08-19

Applicant: LUCENT TECHNOLOGIES INC

Inventor： RAMZAN ZULFIKAR AMIN ,  PATEL SARVAR

IPC: H03M7/40 ,  G06F7/60 ,  G06F17/10 ,  G09C1/00 ,  H03M7/30 ,  H04L9/28

Abstract: An efficient hashing technique uses (see above formula) 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 z,

公开(公告)号：AU4476099A

公开(公告)日：2000-03-16

申请号：AU4476099

申请日：1999-08-26

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR

IPC: H04L9/32 ,  H04W12/02 ,  H04W88/02 ,  H04Q7/32

Abstract: In the method for protecting mobile anonymity, the network sends a temporary mobile identifier (TID) update request to the mobile along with a challenge. In response, the mobile encrypts its permanent ID through public key encryption using the public key of the network, and sends the encryption result to the network. Also, the mobile generates a second challenge, and a first challenge response. The first challenge response is generated by performing a keyed cryptographic function (KCF) on the first and second challenges using a key. The mobile sends the second challenge and the first challenge response to the network with the encrypted permanent ID. After decrypting the permanent ID, the network accesses the key associated with mobile using the permanent ID. Next, using the key, the network authenticates the mobile using the second challenge and the first challenge response. If authenticated, the network calculated a TID for the mobile using the first and second challenges. The network further generates and sends a second challenge response to the mobile. If the mobile authenticates the network based on the second challenge response, then the mobile calculates the TID in the same manner as did the network.

公开(公告)号：AU4462699A

公开(公告)日：2000-03-16

申请号：AU4462699

申请日：1999-08-20

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR

IPC: H04L9/08 ,  H04L9/14 ,  H04W12/04 ,  H04W12/06 ,  H04W88/02 ,  H04L9/32 ,  H04Q7/20

Abstract: In the method for establishing a session key, a network and a mobile transfer codes between one another. The mobile and the network perform mutual authentication based on the codes. Besides performing this mutual authentication, the mobile and the network to establish the session key based on the codes. In one embodiment, the messages forming part of the intended session are sent with the codes, and form a basis upon which the codes for authentication have been derived.

公开(公告)号：CA2277761A1

公开(公告)日：2000-01-31

申请号：CA2277761

申请日：1999-07-20

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR

IPC: G09C1/00 ,  H04L9/00 ,  H04L9/32 ,  H04L29/06 ,  H04W12/06 ,  H04L9/20

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. Also, based on the first and second challenges, both the first and second parties may generate another key.

公开(公告)号：WO2008064153A3

公开(公告)日：2008-09-04

申请号：PCT/US2007085092

申请日：2007-11-19

Applicant: LUCENT TECHNOLOGIES INC ,  PATEL SARVAR

Inventor： PATEL SARVAR

IPC: H04L9/00

CPC classification number: H04L9/0643 ,  H04L9/0631 ,  H04L9/0656 ,  H04L2209/80

Abstract: Disclosed is a method for processing an application packet for transmission, comppsmg receiving a plurality of segments of the application packet in a byte stream, creating a plurality of superblocks within the byte stream by grouping a number of the plurality of blocks within the byte stream, creating first pseudorandom bits for the plurality of superblocks, determining a block number and a superblock number for a beginning and ending of each of the plurality of segments, generating a partial tag for each of the segments based on the first pseudorandom bits associated with the block numbers and superblock numbers between the determined beginning and ending of the of the plurality of segments in the byte stream, combining the partial tags 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 segments including the authentication tag.

Abstract translation: 公开了一种用于处理用于传输的应用分组的方法，包括在字节流中接收应用分组的多个分段，通过对字节流内的多个块的数量进行分组，在该字节流内创建多个超级块， 为所述多个超级块创建第一伪随机比特，为所述多个片段中的每一个的开始和结束确定块号码和超级块号码，基于与所述块相关联的所述第一伪随机比特生成所述片段中的每一个片段的部分标签 在字节流中确定的多个段的开始和结束之间的数字和超级块号，组合部分标签以创建累积标签，基于累积标签和第二伪随机比特生成认证标签，存储认证标签 并且发送包括认证标签的段。

公开(公告)号：ES2414616T3

公开(公告)日：2013-07-22

申请号：ES08836867

申请日：2008-10-08

Applicant: LUCENT TECHNOLOGIES INC ,  ALCATEL LUCENT

Inventor： PATEL SARVAR

IPC: H04L29/06 ,  H04W12/04

Abstract: Procedimiento realizado por el equipo móvil (100) para autenticar una red (400), comprendiendo el procedimiento:recibir información de autenticación a partir de dicha red, incluyendo dicha información de autenticación unprimer número aleatorio, RANDU, generado por un servidor de suscripción local, HSS (400), de dicha red;extraer dicho primer número aleatorio, RANDU, de la información de autenticación recibida; generar (S610) al menos una clave de red, KEYSNME, a partir del primer número aleatorio, RANDU,utilizando la autenticación celular y la encriptación de voz; generar (S630) una clave de autenticación basada en la clave de red, KEYSNME, y un segundo valor;generar (S640) un mensaje de código de autenticación de red esperado, XMAC, sobre la base de la clavede autenticación y al menos una parte de la información de autenticación recibida de acuerdo con elprotocolo de autenticación y de acuerdo con la clave de seguridad; y autenticar (S650, S660, S680) la red (400) basado en el mensaje de código de autenticación de redesperado, XMAC, caracterizado porque dicho procedimiento comprende además: obtener un segundo número aleatorio, RANDMHSS, siendo el segundo número aleatorio un númeroaleatorio que el equipo móvil (100) había generado y había enviado a la red (400) para serincorporado en la información de autenticación; generar (S620) al menos una clave de equipos móviles, KEYSMME, basada en el segundo númeroaleatorio, RANDMHSS, mediante la autenticación celular y la encriptación de voz, constituyendodicha clave de equipo móvil, KEYSMME, dicho segundo valor.

公开(公告)号：DE602004004939D1

公开(公告)日：2007-04-12

申请号：DE602004004939

申请日：2004-04-13

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR

IPC: H04J11/00 ,  H04Q7/38 ,  H04B7/155

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

公开(公告)号：DE69934288D1

公开(公告)日：2007-01-18

申请号：DE69934288

申请日：1999-10-12

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR ,  RAMZAN ZULFIKAR AMIN

IPC: G06T9/00 ,  H03M7/40 ,  G06F7/60 ,  G06F17/10 ,  G09C1/00 ,  H03M7/30

Abstract: An efficient hashing technique uses w + w/2 operations to hash a string "w" words long rather than the w 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.

公开(公告)号：AT347720T

公开(公告)日：2006-12-15

申请号：AT99308032

申请日：1999-10-12

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR ,  RAMZAN ZULFIKAR AMIN

IPC: H03M7/40 ,  G06F7/60 ,  G06F17/10 ,  G09C1/00 ,  H03M7/30 ,  G06T9/00

Abstract: An efficient hashing technique uses w + w/2 operations to hash a string "w" words long rather than the w 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.

公开(公告)号：DE60117726D1

公开(公告)日：2006-05-04

申请号：DE60117726

申请日：2001-08-14

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR

IPC: H04L9/16 ,  H04L9/08 ,  H04W12/00

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. By performing an exclusive-or on at least a portion of the third value and at least a portion of the first intermediate value, the key conversion system produces at least a first portion of the second key value, and at least a second portion of the second key value is produced as the second intermediate value.