公开(公告)号：BRPI0818515A2

公开(公告)日：2015-06-16

申请号：BRPI0818515

申请日：2008-10-08

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR

IPC: H04W12/04

公开(公告)号：MX2010003377A

公开(公告)日：2010-04-30

申请号：MX2010003377

申请日：2008-09-24

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR ,  THOMPSON ROBIN JEFFREY ,  MORGAN TODD CARTWRIGHT

IPC: H04W12/06

Abstract: La presente invenci?n proporciona un m?todo que incluye una femtoc?lula en comunicaci?n con una red central segura tal como una red de Subsistema Multimedia de Protocolo de Internet (IMS, por sus siglas en ingl?s). El m?todo incluye recibir, de la femtoc?lula y en una primera entidad segura en la red de IMS, un desaf?o global que incluye informaci?n que indica un n?mero aleatorio. El m?todo tambi?n incluye recibir una respuesta de autenticaci?n computada por una unidad m?vil con base en el n?mero aleatorio y la primera clave conocida por la unidad m?vil y no conocida por la femtoc?lula. El m?todo incluye adem?s determinar, en la primera entidad segura, que el n?mero aleatorio es un n?mero aleatorio leg?timo proporcionado a la femtoc?lula por medio de la red de IMS.

公开(公告)号：DE602005009598D1

公开(公告)日：2008-10-23

申请号：DE602005009598

申请日：2005-03-23

Applicant: LUCENT TECHNOLOGIES INC

Inventor： MEIER STEVEN K ,  PATEL SARVAR ,  ZHU LILY H

IPC: H04B7/26 ,  H04J3/00 ,  H04W36/00 ,  H04W36/16

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.

公开(公告)号：DE69937322T2

公开(公告)日：2008-07-17

申请号：DE69937322

申请日：1999-07-20

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR

IPC: G09C1/00 ,  H04L9/08 ,  H04L12/64 ,  H04W12/06

Abstract: In the method for updating secret shared data (SSD) in a wireless communication system, a first party outputs a first random number as a first challenge wherein the first party is one of a network and a mobile. A second party generates a second random number in response to the first challenge. The second party is the mobile if the first party is the network, and the second party is the network if the first party is the mobile. The second party generates a first challenge response by performing a keyed cryptographic function (KCF) on the first challenge and the second random number using a secondary key, which is not the SSD and is derived from a root key. The second party then transfers the second random number, as a second challenge, and the first challenge response to the first party. The first party verifies the second party based on the first and second challenges and the first challenge response, generates a second challenge response by performing the KCF on the second challenge using the secondary 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. Both parties respectively establish the SSD based on the first and second challenges.

公开(公告)号：DE602004004939T2

公开(公告)日：2007-11-08

申请号：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).

公开(公告)号：ES2257384T3

公开(公告)日：2006-08-01

申请号：ES01306907

申请日：2001-08-14

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR

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

Abstract: Un método de convertir un primer valor de clave (key 1) para un primer sistema de comunicaciones a un segundo valor de clave (key 2) de un segundo sistema de comunicaciones, dicho método CARACTERIZADO POR: generar un primer valor intermedio (R) desde al menos una porción de dicho primer valor de clave (key 1) usando una primera función aleatoria (f); proporcionar al menos una porción de dicho primer valor intermedio (R) a una segunda función aleatoria (h) para producir un segundo valor; ejecutar una o-exclusiva (220) en al menos una porción de dicho primer valor de clave (key 1) y al menos una porción de dicho segundo valor para generar un segundo valor intermedio (T); proporcionar al menos una porción de dicho segundo valor intermedio (T) a una tercera función aleatoria (g) para producir un tercer valor; y producir al menos una primera porción de dicho segundo valor de clave (key 2) ejecutando una o-exclusiva (240) en al menos una porción de dicho tercer valor y al menos una porción de dicho primer valor intermedio (R).

公开(公告)号：DE69921039T2

公开(公告)日：2006-02-16

申请号：DE69921039

申请日：1999-07-20

Applicant: LUCENT TECHNOLOGIES INC

Inventor： BERENZWEIG ADAM L ,  PATEL SARVAR

IPC: H04L9/08 ,  H04L9/32 ,  H04L29/06 ,  H04W12/08

Abstract: In the protocol, the communicating parties exchange calculation results, which each include an exponential, to generate a key. The authorizing information is sent over a secure communication channel. The secure communication channel is also used to verify a hash on at least one calculation result sent between the parties. If the hash is verified, then a key is established using the calculation results sent between the parties.

公开(公告)号：DE69921039D1

公开(公告)日：2004-11-18

申请号：DE69921039

申请日：1999-07-20

Applicant: LUCENT TECHNOLOGIES INC

Inventor： BERENZWEIG ADAM L ,  PATEL SARVAR

IPC: H04L9/08 ,  H04L9/32 ,  H04L29/06 ,  H04W12/08

Abstract: In the protocol, the communicating parties exchange calculation results, which each include an exponential, to generate a key. The authorizing information is sent over a secure communication channel. The secure communication channel is also used to verify a hash on at least one calculation result sent between the parties. If the hash is verified, then a key is established using the calculation results sent between the parties.

公开(公告)号：DE60103737D1

公开(公告)日：2004-07-15

申请号：DE60103737

申请日：2001-11-19

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR

IPC: G09C1/00 ,  H04L9/08 ,  H04L9/32 ,  H04Q7/38

Abstract: A message authentication system for generating a message authentication code (MAC) uses a single iteration of a keyed compression function when a message fits within an input block of the compression function, thereby improving efficiency. For messages that are larger than a block, the MAC system uses nested hash functions. The MAC system and method can use portions of the message as inputs to the nested hash functions. For example, the message authentication system can split the message into a first portion and a second portion. A hash function is performed using the first portion of the message as an input to achieve an intermediate result, and a keyed hash function is performed using a second portion of the message and the intermediate result as inputs. Thus, less of the message needs to be processed by the inner hash function, thereby improving efficiency, especially for smaller messages.

公开(公告)号：DE69914999D1

公开(公告)日：2004-04-01

申请号：DE69914999

申请日：1999-07-20

Applicant: LUCENT TECHNOLOGIES INC

Inventor： PATEL SARVAR

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

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.