-
公开(公告)号：JP2001313634A
公开(公告)日：2001-11-09
申请号：JP2001071600
申请日：2001-03-14
Applicant: LUCENT TECHNOLOGIES INC
Inventor： GROSSE ERIC , BOYKO VICTOR VLADIMIR , MACKENZIE PHILIP D , PATEL SARVAR
Abstract: PROBLEM TO BE SOLVED: To provide a mutual network authentication protocol whose security can be proved and which is safe and is based only on a password. SOLUTION: Shared secret gxy is generated between two parties A and B involved in sharing a password through a data network by using Diffie-Hellman type key exchange related to a specific group. The symbol g represents a group generating element that is already known to both parties involved, the symbol x represents an exponent that is known to one party A involved (e.g. client) and the symbol y represents an exponent that is known to the other party B involved (e.g. server). The party A generates a parameter m by performing a group operation with respect to gx and at least a password function H1 and transmits the parameter m to the party B. This, the party B performs an inverse group operation of the parameter m and the function H1 to extract the secrecy gx and can further calculates the shared secrecy gxy from the party B and can generate the shared secret gxy.
-
公开(公告)号：JP2000083286A
公开(公告)日：2000-03-21
申请号：JP21454099
申请日：1999-07-29
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: PROBLEM TO BE SOLVED: To realize a method that makes aerial communication in a radio system confidential. SOLUTION: A mobile set 20 transmits a system access request and dummy data relating thereto to a network 10. The network 10 transmits a 1st bit stream including a 1st data part to the mobile set 20 in response to the request. The mobile set 20 extracts the 1st data part from the bit stream and transmits a 2nd bit stream including a 2nd data part to the network 10. The mobile set 20 and the network 10 both generate a key based on the 1st data part and the 2nd data part to set up a 1st encrypted and authenticated communication channel. The mobile set 20 transmits authentication information to the network 10 through the 1st communication channel. In the case that the authentication information is accepted, a 2nd encrypted and authenticated communication channel is set. The network 10 transmits, through the 2nd encrypted and authenticated communication channel, information requiring secrecy such as a route, that is, an A-key to the mobile set 20.
-
公开(公告)号：JP2000083018A
公开(公告)日：2000-03-21
申请号：JP21454399
申请日：1999-07-29
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: PROBLEM TO BE SOLVED: To first transmit confidential information by using a communication channel that is not kept secret by allowing a mobile device to receive a public key of a network, generate keyed encryption with a 1st random number and to transmit it and allowing the network to authenticate the communication channel and to perform 2nd encryption by using the 1st random number obtained by decoding it. SOLUTION: A mobile device 20 receiving a public key (PKnet), other information and certification from a network 10 obtains the hush of the other information from the PKnet plus the certification by using the public key PKCA of a certification organization. The mobile device 20 authenticates the PKnet as legal to use it, generates a random number as a session key(SK), enciphers the SK and the identification information ID of the mobile device 20 and transmits them to the network 10. The network 10 obtains the SK and the identification information ID by using a decoding key obtained from the PKnet and establishes an enciphered voice channel between the mobile device 20 and itself by using the SK as an A key. Thus, confidential information is transmitted after being authenticated and also the identification information ID is enciphered so that attack can be prevented.
-
公开(公告)号：JP2000122538A
公开(公告)日：2000-04-28
申请号：JP29577599
申请日：1999-10-18
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR , ZURUFIKAA AMIN RANZAN
Abstract: PROBLEM TO BE SOLVED: To efficiently hash a string by squaring the sum of a key and the string to be hashed. SOLUTION: An input string or a message m is inputted (S100). Then, an input key a is inputted. Each of the message or a string m and the key a consists of w words and has an n bit length. The key a is a random number or a pseudo-random number and it can be longer than n bits, however, it is desirable to have n bits (S102). Then, a sum s of the string m and the key a is taken, and squared to execute a rule p operation where p is a first prime number larger than 2n (S106 and 108). A rule 2l operation is executed for the result of the operation where 1 is a short output message for the bit number in the string (110). Then, the result of the rule 2l operation is outputted. Thus, the message having n bits or the string, which is made into an l bit message or the message that is reduced to a string, is obtained (S112).
-
公开(公告)号：JP2000092572A
公开(公告)日：2000-03-31
申请号：JP23993899
申请日：1999-08-26
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: PROBLEM TO BE SOLVED: To obtain a method for using a temporary mobile object identifier(ID) for maintaining the anonymity of a mobile object. SOLUTION: In the method, a network sends a 1st challenge signal to a mobile object 20, which returns 1st and 2nd challenge answers in response to the received signal. The mobile object 20 and the network respectively generate new temporary mobile object IDs based on the 1st and 2nd challenge signals. When communication between the mobile object 20 and the network advances, the mobile object 20 confirms the temporary mobile object IDs on a temporary mobile object ID list based on the communication. In mutual communication, the mobile object 20 uses the oldest temporary mobile object ID on the list and the network uses the latest temporary mobile object ID on the list.
-
Patent Agency Ranking
公开(公告)号：JPH11288214A
公开(公告)日：1999-10-19
申请号：JP5312499
申请日：1999-03-01
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR , GANAPASSY SABURAMANIAN
Abstract: PROBLEM TO BE SOLVED: To realize a pseudo-random number generator which outputs pseudo- random numbers z (i) which are cryptologically stable and have a large bit size. SOLUTION: A pseudo-random number generator 22 is defined by modulus exponential function x(i)=g modp where x (i) is an m-bit numerical value, p is a k-bit prime number, g is a generator of integers with the modulus p, m
-
公开(公告)号：JP2000106553A
公开(公告)日：2000-04-11
申请号：JP21454199
申请日：1999-07-29
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: PROBLEM TO BE SOLVED: To authenticate two parties which are communicating to each other by verifying the 1st party based on the 1st challenge and 2nd challenge answer. SOLUTION: A party (AC/HLR) 10 generates a random number RN and sends it to a party (mobile machine) 20. The machine 20 generates the count value CM and executes an encipherment function with key (KCF) by using an M-key as its key in regard to the number RN, value CM, type data TYPE and id data IDM. Then the machine 20 transmits the value CM and a challenge answer KCFM-key (Type, IDM, CM, RN) to a network. The AC/HLR 10 calculates the KCFM-key (Type, IDM CM, RN). If this calculated value is coincident with the version that is received from the machine 20, the SC/HLR 10 authenticates the machine 20. Then the machine 20 calculates the KCFM-key (Type, IDM, CM) and verifies whether or not a version is coincident with the version sent from the AC/HLR 10.
-
公开(公告)号：JPH11215570A
公开(公告)日：1999-08-06
申请号：JP30480098
申请日：1998-10-27
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: PROBLEM TO BE SOLVED: To enforce an authentication protocol by authenticating a user with a 1st authentication code and a 2nd authentication code, that is determined by using a call code and information relating to the user so as to make it more difficult for an illegal user of a receiver to make a system access through repetitive attacks. SOLUTION: A network 60 generates a random number (RANDOM) used by a receiver 62 to determine an authentication code (AUTH), in response to a call and transmits the random number. Just after receiving the call, the receiver 62 uses a 1st set of information in relation to the RANDOM as a parameter for an encryption function of a known CAVE algorithm and to the receiver 62 (or the user) to determine the AUTH. The receiver 62 transmits a 2nd set of information relating to the AUTH and the receiver 62 (or the user) to the network 60 as a reply to the call from the network 60.
-
公开(公告)号：JP2002232418A
公开(公告)日：2002-08-16
申请号：JP2001376564
申请日：2001-12-11
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR
Abstract: PROBLEM TO BE SOLVED: To provide a key conversion system for deterministically and reversibly converting the first key value of a first communication system into the second key value of a second communication system. SOLUTION: The key conversion system generates a first intermediate value from at least a portion of the first key value by using a first random function. At least a portion of the first intermediate value is provided to a second random function for producing a second value. Exclusive-OR(XOR) is preformed on at least a portion of the first key value and at least a portion of the second value and a second intermediate value is generated. At least a portion of the second intermediate value is provided to a third random function for producing a third value. By performing 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 the first portion of the second key value, and at least the second portion of the second key value is produced as the second intermediate value.
-
公开(公告)号：JP2000122534A
公开(公告)日：2000-04-28
申请号：JP29577699
申请日：1999-10-18
Applicant: LUCENT TECHNOLOGIES INC
Inventor： PATEL SARVAR , ZURUFIKAA AMIN RANZAN , GANAPASHII SUBRAMANIAM SUNDARA
Abstract: PROBLEM TO BE SOLVED: To resolve the inefficiency in a ciphering using a hash function by using a same pseudo-random function twice. SOLUTION: An inputted 2n bit string is decomposed into n bit strings L and R, an n bit output is generated by a squared hash function, added with a data block L and stored as an n bit strings S (S200 to 208). Thus, an n bit output is generated by a pseudo-random function, added with a data string R and stored as an n bit string T (S210 to 214). Then, an n bit string is generated by the pseudo-random function, which is same as the function of S210, added with the n bit string S and stored as an n bit string V (S216 to 220). Then, n bits are generated by the squared hash function and stored as an n bit string W (S222 to 226). Using the data strings V and W, 2n bit output, which is a ciphered expression, is outputted (S228).
-
-
-
-
-
-
-
-
-
Search Results
99
records
(took 0.024 seconds)
