WO2007073659A1 - Terminal access method based on h.323 protocol applied to packet network - Google Patents

Terminal access method based on h.323 protocol applied to packet network Download PDF

Info

Publication number
WO2007073659A1
WO2007073659A1 PCT/CN2006/003100 CN2006003100W WO2007073659A1 WO 2007073659 A1 WO2007073659 A1 WO 2007073659A1 CN 2006003100 W CN2006003100 W CN 2006003100W WO 2007073659 A1 WO2007073659 A1 WO 2007073659A1
Authority
WO
WIPO (PCT)
Prior art keywords
terminal
gatekeeper
security
signaling
signature
Prior art date
Application number
PCT/CN2006/003100
Other languages
French (fr)
Chinese (zh)
Inventor
Chen Lu
Liang Zhang
Guangfeng Li
Zhong Yu
Wei Quan
Baolin Xue
Original Assignee
Zte Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zte Corporation filed Critical Zte Corporation
Publication of WO2007073659A1 publication Critical patent/WO2007073659A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/30Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • H04L9/3066Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/08Network architectures or network communication protocols for network security for authentication of entities
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/1066Session management
    • H04L65/1101Session protocols
    • H04L65/1106Call signalling protocols; H.323 and related
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
    • H04L9/3252Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures using DSA or related signature schemes, e.g. elliptic based signatures, ElGamal or Schnorr schemes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3263Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving certificates, e.g. public key certificate [PKC] or attribute certificate [AC]; Public key infrastructure [PKI] arrangements

Definitions

  • the present invention relates to packet network communication security technologies, and in particular, to a H.323 protocol-based terminal access method applied to a packet network.
  • BACKGROUND Currently, a large number of terminals based on the ITU-T H.323 protocol with multimedia capabilities are deployed on a private network and the Internet to implement voice over IP (VoIP, voice over IP, IP-based voice transmission). , ⁇ frequency and other services and other value-added services, and may become the mainstream way of user access in the future. Due to the openness of the Internet itself and the lack of effective monitoring, security access issues are becoming more and more prominent, such as denial of service (DoS) attacks, service stealing, signaling flow monitoring, media stream monitoring and other security threats.
  • DoS denial of service
  • the terminal needs to access the network securely, mainly based on the ITU-T (International Telecommunication Union-Telecommunication standardization sector) H.235 protocol symmetric cryptography technology to achieve network pairs.
  • Terminal security authentication as a means to achieve secure access to the terminal.
  • the security mechanism is to protect various signaling security by pre-shared secrets between neighboring nodes or by using a secure port through TLS (Transport Layer Security) or IPSEC (IP Security) protocol. It is embodied in three control processes for communication between endpoints (Multimedia Terminals or Media Control Units): Call Admission (RAS, Registration, Admission and Status, Registration, Access, and Status).
  • Call Control H.225.0 Call Signaling Protocol
  • Connection Control H.245
  • security protection including authentication, privacy (confidentiality), integrity, and non-repudiation.
  • the pre-shared secret and secret symmetric cryptographic mechanism uses a single key during addition and decryption. Once the key is leaked, the entire communication system loses its security and anti-p function, so it exposes more and more defects in practical applications.
  • Another disadvantage of this security mechanism is that when the network size is large, the user's pre-shared secret allocation is difficult, and even if it is feasible, it is difficult to manage.
  • the mechanism for negotiating TLS or IPSEC in advance is difficult to implement.
  • Public key cryptosystems are generally classified into three categories according to the problems they are based on: large integer decomposition problem classes, discrete logarithm problem classes, and elliptic curve classes. Elliptic curve classes are sometimes classified as discrete logarithmic classes.
  • the elliptic curves are all defined on a finite field. All points on a finite field elliptic curve, 'a set of special points called an infinity point is combined with a defined "chord and tangent" addition rule to form an Abel group.
  • elliptic curve discrete logarithm problem This problem is called elliptic curve discrete logarithm problem.
  • the elliptic curve cryptosystem is designed using this difficult problem.
  • the elliptic curve applied to cryptography was first independently proposed by Neal Koblitz and Victor Miller in 1985.
  • the elliptic curve cryptosystem is a system in which the encryption strength of each bit is the highest in the public key cryptosystem.
  • the best algorithm for solving the discrete logarithm problem on elliptic curves is the Pollard rho method, whose time complexity is fully exponential.
  • the well-known RSA utilizes the difficult problem of large integer decomposition.
  • the time complexity of the best algorithm for factorization in general is sub-sub-exponential order.
  • n 2048, it takes about 2x10. 2Q MIPS time. That is to say, when the RSA key uses 2048 bits, the security strength of the ECC (Elliptic Curve Cryptosystem) key using 234 bits is much higher. The key length between them is up to 9 times, and the difference between them is greater when the ECC key is larger. The advantage of the short ECC key is very obvious. As the encryption strength increases, the key length does not change much.
  • WAPI WLAN Authentication and Privacy Infrastructure
  • WPI WLAN Privacy Infrastructure
  • the Sixth International Cryptography Conference recommends two encryption algorithms for public key cryptosystems: the RS A algorithm based on the Integer Factorization Problem (IFP) and the discrete logarithm calculation based on the elliptic curve ( ECDLP, Elliptic Curve Discrete Logarithm Problem) ECC algorithm.
  • IFP Integer Factorization Problem
  • ECDLP Elliptic Curve Discrete Logarithm Problem
  • One of the characteristics of the RSA algorithm is that the mathematical principle is simple, and it is relatively easy to implement in engineering applications, but its unit security strength is relatively low. Currently the most effective attack method for the RSA algorithm is recognized internationally. NFS, Number
  • the Field Sieve method is used to decipher and attack the RSA algorithm. Its difficulty in deciphering or solving is sub- exponential.
  • the mathematical theory of the ECC algorithm is very esoteric and complex, and it is difficult to implement in engineering applications, but its unit security strength is relatively high.
  • the Pollard rho method the most effective attack method for the ECC algorithm, to decipher and attack the ECC algorithm, its deciphering or solving difficulty is basically exponential. It is precisely because of the obvious difference between the RSA algorithm and the ECC algorithm that the unit security strength of the ECC algorithm is higher than that of the RSA algorithm, that is, to achieve the same security strength, the key length required by the ECC algorithm is much lower than the RSA algorithm.
  • a primary object of the present invention is to provide a terminal access method based on the H.323 protocol applied to a packet network, including authentication, integrity, non-repudiation, and anti-replay attacks of the terminal. Its characteristics are based on the assumption of the discrete logarithm problem on the elliptic curve.
  • the present invention provides a terminal access method based on the H.323 protocol applied to a packet network.
  • the terminal access method includes the following steps: Step S102:
  • the gatekeeper uses the elliptic curve public key certificate digital signature system to perform security authentication on the incoming terminal, and adds the call signaling channel session key generated by the negotiation with the incoming terminal to the elliptic curve.
  • the public key certificate is digitally signed and sent to the incoming terminal to establish a first network access security channel.
  • Step S104 The incoming terminal uses the pre-shared secret mechanism to perform security authentication by using a call signaling channel session key. And establishing a second network access security channel with the receiving terminal;
  • Step S106 the gatekeeper uses the elliptic curve public key certificate digital signature system to perform security authentication on the receiving terminal, and the call signaling channel session key shared with the receiving terminal Adding the digital signature of the elliptic curve public key certificate to the receiving terminal, and transmitting to the receiving terminal, thereby establishing a third network access security channel;
  • Step S108 the incoming terminal and the gatekeeper are based on the call signaling channel session key, in the second On the network access security channel, a symmetric password security mechanism is used to establish a call connection security channel; Step S11 0.
  • a symmetric cryptographic security mechanism is used to perform encryption algorithm and key negotiation for real-time media stream communication between the incoming terminal and the receiving terminal, thereby realizing real-time secure communication of the media stream.
  • the call signaling channel session key is negotiated by a Diffie-Hellman key distribution scheme.
  • the step of the gatekeeper performing security authentication on the terminal by using the elliptic curve public key certificate digital signature system may include the following steps: a.
  • c is based on different security policies to decide whether to digitally sign the entire signaling or only part of the signaling message and put it in a plaintext message token;
  • Select a secure hash function use a hash The function performs a digitally signed signaling message on a part of the message to generate a fixed length.
  • Message digest e.
  • the incoming terminal completes the signature (r, s) of the signaling message, and embeds the signature in the signaling message and sends To the gatekeeper; i.
  • step c the step of digitally signing the entire signaling or only partially signing the partial signaling based on different security policies may include: if the terminal is physically adjacent to the gatekeeper, The entire signaling is digitally signed; if there is a firewall between the terminal and the gatekeeper, only part of the message is digitally signed.
  • the digital signature internal format of the digital certificate is specified by CCITT (International Telegraph and Telephone Consultative Committee) X.509, and the content may include: a version number of the certificate, a serial number of the digital certificate, The name of the certificate owner, the signature algorithm, the unit that issued the digital certificate, the signature of the unit that issued the digital certificate, and the validity period of the public key.
  • the gatekeeper can defend against denial of service attacks by verifying the lifetime of the incoming terminal timestamp and the uniqueness of the random sequence value. The gatekeeper can prove whether the receiving terminal is a legitimate user by comparing the receiving terminal appearance with its own identifier.
  • step S102 the step of generating the call signaling channel session key through the Diffie-Hellman key allocation scheme may include the following steps: a.
  • the inbound terminal establishes a data unit dhKey ⁇ halfkey in the signaling. ( g x ), modsize (primary modulus p ), generator (generating element g of the multiplicative group) ⁇ ; the incoming terminal generates a random number X, performs corresponding calculation, and sends it to the gatekeeper; b.
  • the gatekeeper After receiving the signaling message, the gatekeeper randomly generates a secret number y, and calculates (g x ) y - g x y as the shared session key with the incoming terminal, and fills in the data unit in the returned signaling.
  • step S10 on the call connection security channel, using the call signaling channel session key, using a pre-shared secret mechanism to implement security authentication of the H.245 control channel, establishing a connection control security channel; And on the connection control security channel, using the security capability exchange procedure of the H.245 protocol, negotiating an encryption algorithm and an encryption key supported by the incoming terminal and the receiving terminal for media stream communication, and using the encryption key
  • the call signaling channel session key is transport protected.
  • the secure access of the gatekeeper to the terminal may include: confidentiality, identity authentication, integrity authentication, and non-compliance certification.
  • the present invention implements secure access, secure channel establishment, and secure transmission of media streams between terminals when no pre-shared secret is established between the network, and has high-intensity security per bit, and the processing speed is fast.
  • Low overhead suitable for H. 323 multimedia terminals with low memory and low processing capability for network security access.
  • FIG. 2 is a call mode scene diagram according to an embodiment of the present invention
  • FIG. 3 is an elliptic curve number when a terminal is accessed according to an embodiment of the present invention
  • FIG. 4 is a flowchart of an elliptic curve digital signature process of a gatekeeper certificate terminal according to an embodiment of the present invention
  • FIG. 5 is a terminal security connection in a gatekeeper route direct call mode according to an embodiment of the present invention; Enter the protocol flow chart.
  • DETAILED DESCRIPTION OF THE INVENTION The present invention will be described in detail below with reference to the accompanying drawings. Because the symmetric key system has a much faster encryption speed than the public key cryptosystem.
  • a hybrid encryption method can be utilized to combine their advantages, that is, the public key encryption system securely transmits the session key, and the session key is used for information encryption and decryption.
  • the public key cryptography is used to securely transfer RAS messages between the terminal or the MCU and the gatekeeper, thereby realizing secure access of the terminal, and securely accessing a secure session key at the same time, based on
  • the shared session key uses a symmetric crypto mechanism to establish a secure call connection channel (H.225.0) that satisfies various call routing modes, and then uses the call control (H.245) protocol security negotiation capability on the secure channel.
  • the real-time media stream communication between the multimedia terminals performs encryption algorithm and key negotiation, and finally completes real-time communication security of the media stream.
  • the H.323 protocol-based terminal access method applied to a packet network provided by the present invention includes the following steps:
  • the gatekeeper uses the elliptic curve public key certificate digital signature system to implement secure authentication of the incoming terminal, and establishes a data unit in the signaling of the elliptic curve public key certificate digital signature for passing
  • the Diffie-Hellman key distribution scheme negotiates with the calling terminal to generate a shared session key, and establishes a network access security channel;
  • the gatekeeper adopts the elliptic curve public key certificate digital signature system to realize the security authentication of the receiving terminal, and establishes a data unit in the signaling of the elliptic curve public key certificate digital signature, and transmits the Diffie-Hellman key distribution to the receiving terminal. a session key generated by the solution and shared by the receiving terminal, establishing a network access security channel;
  • Network call control communication phase the incoming terminal and the gatekeeper establish a matching call routing mode based on the shared session key generated in step (1) on the established network access-safe channel using a symmetric cryptosystem. Call connection secure channel;
  • a symmetric crypto mechanism is used to perform encryption algorithm and key negotiation for real-time media stream communication between multimedia terminals on the call connection security channel, so as to realize real-time secure communication of media streams between multimedia terminals.
  • the method for implementing the secure authentication between the terminal and the gatekeeper using the elliptic curve public key certificate digital signature system in the method may be: a.
  • Xl is equal to r and is not equal to 0, the correctness of the calculation of the signature itself is verified, and the gatekeeper completes the access authentication to the terminal.
  • the step of digitally signing the entire signaling or only partially signing the partial message based on different security policies may be: if the terminal and the gatekeeper are physically adjacent, the entire signaling Digital signature; if the terminal is stored with the gatekeeper In the firewall, only some messages are digitally signed.
  • the digital signature internal format of the digital certificate is specified by CCITT X.509, and may include the following aspects: the version number of the certificate, the serial number of the digital certificate, the name of the certificate owner, the signature algorithm, The unit that issued the digital certificate, the signature of the unit that issued the digital certificate, and the validity period of the public key.
  • the gatekeeper can defend against the denial of service attack by verifying the lifetime of the incoming timestamp and the uniqueness of the random sequence value.
  • the gatekeeper can verify whether the receiving terminal is a legitimate user by comparing the identity of the receiving terminal with its own identifier.
  • the gatekeeper can verify whether the identifier of the incoming terminal is consistent with the identity identifier in the certificate and has corresponding access rights.
  • the step of the inbound terminal to generate the shared session key by negotiating with the gatekeeper through the Diffie-Hellman key distribution scheme may be: a.
  • the inbound terminal establishes a data unit dhKey ⁇ halfkey(g x) in the signaling.
  • the network connection control communication phase can use the call signaling channel session key, use the pre-shared secret mechanism to implement the security authentication of the H.245 control channel, establish a connection control security channel, and connect in the call connection security channel;
  • the encryption algorithm and the encryption key supported by the multimedia terminal communication parties for media stream communication are negotiated, and the call signaling channel session key is used for transmission protection.
  • the secure access of the gatekeeper to the terminal may include: confidentiality, identity recognition Certification, integrity certification and non-compliance certification.
  • the object of the present invention is to provide a digital signature method based on an elliptic curve public key certificate.
  • the invented method starts from the discrete logarithm of the elliptic curve, supplemented by the anti-collision hash function, and uses the elliptic curve public key certificate digital signature method to realize the identity confirmation and integrity check in the terminal access process, and can also be implemented if necessary. Denial and other security attributes.
  • the Diffie-Hellman key 1 operator scheme is used to generate a secret, secret or session key for the terminal and the network access node gatekeeper to connect to the subsequent call.
  • media stream communication establishes a secure communication channel.
  • the method used in the present invention is based on the elliptic curve discrete logarithm problem.
  • a point PEE of order n and a point ⁇ 5 1 ⁇ , where 0 ⁇ k ⁇ n - 1 , determine k.
  • the elliptic curve discrete logarithm problem has provable security. Compared with the current popular RSA public key cryptosystem, it has the advantages of high speed, high security and low processing capability for the terminal.
  • the invention realizes the secure access network content of the multimedia terminal in the H.323 system, that is, three communications of network access (H.225.0 RAS), call control (H.225.0 call signaling protocol) and connection control (H.245) Phases implement certification, privacy (confidentiality), integrity and non-repudiation protection.
  • the elliptic curve public key certificate digital signature process is used to implement security authentication, and a shared session key is negotiated based on the Diffie-Hellman key distribution scheme to establish a secure channel on the secure channel.
  • the corresponding secure channels are respectively established based on the traditional symmetric cryptography technology to realize communication security and confidentiality between multimedia terminals.
  • the solution to these two problems is to introduce a digital certificate that represents the identity of the user.
  • the digital certificate can effectively indicate the identity of the terminal, and the key exchange method can be implemented at the same time.
  • the internal format of the digital certificate can be specified by CCITT X.509.
  • a ⁇ .323 protocol-based terminal access method applied to a packet network includes the following steps: Step S102: A gatekeeper uses an elliptic curve public key certificate digital signature system to perform security authentication on an incoming terminal.
  • Step S104 calling The ingress terminal uses the pre-shared secret mechanism to perform security authentication through the call signaling channel session key, thereby establishing a second network access security channel with the receiving terminal;
  • Step S106 the gatekeeper adopts an elliptic curve public key certificate digital signature system to the receiving terminal Performing security authentication, and adding the call signaling channel session key shared with the receiving terminal to the signaling of the elliptic curve public key certificate digital signature, and transmitting the signal to the receiving terminal, thereby establishing a third network access security channel;
  • Step S108 The incoming terminal and the gatekeeper are based on the call signaling channel session key, and are accessed on the second network access security channel.
  • the symmetric security mechanism establishes a call connection security channel;
  • Step S110 on the call connection security channel, uses a symmetric cryptographic security mechanism to perform encryption algorithm and key negotiation for real-time media stream communication between the incoming terminal and the receiving terminal, thereby implementing media Real-time secure communication of the stream.
  • FIG. 2 it is a call mode scenario diagram according to the method of the embodiment of the present invention, which illustrates that the method according to the embodiment of the present invention implements a terminal network security access process based on an elliptic curve public key certificate digital signature method, including signaling authentication, Security features such as integrity and non-compliance.
  • the method of the embodiment of the present invention assumes that each node of the network has the public key certificate or the elliptic curve public key certificate of the communication party when the security access and the key agreement are completed in advance, and the specific steps are as follows:
  • Step 101 The terminal ⁇ or C uses the signaling GRQ or RRQ to implement the digital signature process: the public elliptic curve algorithm set given by the elliptic curve certificate, and the related user authentication information in the GRQ or RRQ is set, and the terminal A or C is completed. After signing the signaling message, the signature is embedded in the GRQ or RRQ message and sent to the gatekeeper B.
  • Step 102 After receiving the signaling GRQ or RRQ message, the gatekeeper B completes the security authentication process, and after verifying the correctness of the calculation of the signature itself, completes the access of the terminal A or C.
  • Step 103 After the terminal network security access is completed, the terminal A issues an ARQ to the gatekeeper B. Or LRQ signaling, requiring negotiation of a call signaling channel session key.
  • Gatekeeper B replies to ACF or LCF signaling to terminal A, and based on the session secret exchanged securely in the H.225.0 RAS signaling process, the Diffie-Hellman algorithm is used to negotiate a call signaling channel session secret. The key is sent to terminal A.
  • Terminal A establishes a secure channel with terminal C by using the call signaling channel session key, using the pre-shared secret mechanism H.245 control channel security authentication.
  • Terminal C sends ARQ or LRQ signaling to Gatekeeper B, requesting the transmission of the Call Signalling Channel Session Key negotiated by Gatekeeper B with Terminal C.
  • Step 107 The gatekeeper B replies to the terminal C with ACF or LCF signaling, and transmits the call signaling channel session key negotiated with the terminal A to the terminal C.
  • Step 108 The gatekeeper B completes the negotiation with the terminal C, opens the media logical channel established by the encryption algorithm and the encryption key negotiated by the gatekeeper B and the terminal C, and uses the real-time transmission protocol/real-time transmission control protocol (RTP/RTCP). Implement packet-based network-based media security communications.
  • FIG. 3 it is a flowchart of an elliptic curve digital signature process when a terminal accesses according to an embodiment of the present invention, and the steps are as follows:
  • the prime number n is the order of the base point G;
  • h #E(GF(p))/n is a cofactor integer, and #E(GF(p)) represents the order of the elliptic curve point group.
  • Step 202 setting related user authentication information in the GRQ or RRQ, and putting it into a token ClearToken transmitted in a plaintext message, including a sequence random number, a time stamp, a 4 megabytes, a sending terminal name, and a receiving network. Namekeeping, full signaling signature or partial signaling message signature marking, etc.
  • Step 203 It is determined based on the security policy whether the entire signaling of the GRQ or RRQ is digitally signed or only part of the message is digitally signed and placed in a field in the token ClearToken. If a token tokenOip is set, "A" indicates a full message signature, and "B” indicates a partial message signature.
  • the former is suitable for the physical connection between the terminal and the gatekeeper; the latter is required to be modified between the GRQ or the RRQ signaling when there is a NAT/firewall between the terminal and the gatekeeper. happening.
  • Step 206 Select a random or pseudo-random number k, l ⁇ k ⁇ n - 1.
  • Step 211 The terminal completes the signature of the signaling message as (r, s), and embeds the signature into the GRQ or RRQ message and sends it to the gatekeeper B.
  • FIG. 4 it is a flowchart of the elliptic curve digital signature process of the gatekeeper terminal according to the embodiment of the present invention, and the specific steps are as follows:
  • Step 302 The gatekeeper B verifies whether the signature (r, s) of the terminal A exceeds the range of the elliptic curve base group level, and if so, indicates an illegal signature.
  • the gatekeeper B goes to step 311 to reject the access of the terminal A, returns with the GRJ or RRJ message and explains the reason for the related denial of access security.
  • Step 303 It is judged whether the message signature indicated by the tokenOID is a signature on the entire signaling message or only a part of the message.
  • Step 304 Generate a message digest e of the entire signaling message signature.
  • Step 305 Generating a message digest e of the partial signaling message signature.
  • Step 307 when the abscissa Xl X is 0, indicating invalid signature, gatekeeper 311 proceeds to step B, reject the access terminal A, or RJ GRJ message is returned to and the reasons for denying access related security.
  • Step 308 When the abscissa of X X! If it is not equal to r, the signature is invalid. Gatekeeper B goes to step 31 1, and the terminal A receives the GRJ or RRJ message and explains the related reasons for denying access security.
  • Step 309 After verifying the correctness of the calculation of the signature itself, it indicates that the message signature has not been tampered with, and the gatekeeper B completes the access authentication of the terminal A.
  • the method of the embodiment of the present invention uses the Diffie-Hellman key agreement algorithm to complete the sharing of the terminal A and the gatekeeper B. The process is as follows: ⁇ : While the network is securely connected, the terminal A and the gatekeeper B can negotiate a sharing. secret.
  • the process of the call signaling channel (H.225.0) and the secure access of the media control channel (H.245 Control Protocol) of the method of the embodiment of the present invention is as follows: After the terminal network security access is completed, the ARQ/ACF or LRQ/LCF signaling can be used to interact, and the session secrets securely exchanged in the H.225.0 RAS signaling process can be used to implement the security authentication using symmetric cryptography. Integrity, the dhkey field in a single token ClearToken can also be used to negotiate a call signaling channel session key using the Diffie-Hellman algorithm. Reusing this key, using the pre-shared secret mechanism H.245 control channel security authentication, and establish a secure channel.
  • the security capability exchange procedure of the H.245 protocol is used to negotiate the parameters of the media stream communication, such as video or audio, supported encryption algorithms and encryption keys, by the communication terminal of the multimedia terminal. And use the previous session key for transmission protection.
  • the confidentiality of packet-based media communication can be realized by the Real-Time Transport Protocol/Real-Time Transport Control Protocol (RTP/RTCP) in the media logical channel that is opened later.
  • RTP/RTCP Real-Time Transport Protocol/Real-Time Transport Control Protocol
  • FIG. 5 it is a flowchart of a terminal security access protocol in a single-gateway direct call mode according to an embodiment of the present invention. The solution in this embodiment is applicable to the direct routing mode of the single-gatekeeper management scope of the H.323 system.
  • each RAS/H.225.0 signaling message has a dedicated data structure that describes the security mechanisms used by different entities (gatekeepers, endpoints) for communication.
  • cryptoToken Based on the public key certificate digital signature security mechanism, its data structure is called cryptoToken, which can be used to describe the terminal secure access of the H.323 system by using the digital signature of the elliptic curve public key certificate.
  • the fields can be set as follows: tokenOID: Set to "A" to indicate that the entire H.225.0 RAS signaling message, such as implementing authentication/integrity/non-repudiation calculations, can be used for physical security occasions that are physically connected. "B” indicates that only a subset of the H.225.0 RAS messages are authenticated and non-repudiation-calculated for end-to-end security occasions that cause signaling message modification across the NAT/firewall.
  • Token is the subdata structure to be signed and stores the result, where: toBeSigned: A token ClearToken that stores the entire signaling message signature or only one associated authentication information.
  • AlgorithmOID Indicates the signature algorithm used by the receiving entity, such as "V” to indicate the signature algorithm given by the present invention.
  • Signature signature ⁇ r, s ⁇ .
  • the signed plaintext token ClearToken contains the following set of fields: tokenOID: set to "S”, indicating that ClearToken is being used as authentication/integrity/non-repudiation information; "R” indicates use as authentication/non-repudiation security, For end-to-end applications across NAT/firewalls.
  • Challenge 4 battles, used for three handshake authentication protocols. Random: a monotonically increasing sequence number. When the timestamp granularity is insufficient, guarantee that it is only
  • the sending terminal When the sending terminal is in a signaling message (such as GRQ, RRQ), the data structure is set as described above, and the corresponding signature operation is completed, and then sent to the gatekeeper B. After receiving the signaling message, the receiving entity immediately checks the signatures indicated by the tokenOIDs sent to it, and completes the security authentication process.
  • the specific process can be based on the following criteria: Verify that the sender is a one by comparing the generallD identity with its own identity.
  • a valid user verify that the sendersID is consistent with the certificate and has the corresponding access rights; whether the message signature matches the signature of the self-verification calculation to verify whether the message has been tampered with; and verify the sending entity by checking the received certificate Whether it is a legally registered entity and non-repudiation in e-commerce.
  • the Diffie-Hellman key negotiation algorithm specified in dhkey can be used to complete the negotiation and exchange of the session key in the returned response message (GCF, RCF).
  • Step 401 The terminal A or C puts the challenge number challengeA into the challenge field in the ClearToken, and the generallDA indicates the identifier of the terminal C.
  • subscripts A, B, and C represent the identifiers of terminals A, C, and gatekeeper B, respectively, and the English word names represent the corresponding fields.
  • Step 402 After receiving the terminal A gatekeeper discovery request signaling, the gatekeeper B determines that the digital signature is used to implement the security authentication with the terminal A according to the terminal A name and the local security policy, so as to ensure the secure access of the terminal A.
  • sequence random number randomB and ⁇ L battle number challengeB The combination of the two should be guaranteed to be unique, to prevent replay attacks on signaling, DhB contains gx value.
  • ⁇ SignB represents a digital signature of the value in ⁇ , assuming a partial signature of the signaling message. Certificate Stores the actual elliptic curve certificate for gatekeeper B.
  • Step 403 After obtaining the response message GCF of the gatekeeper B, the terminal A performs the validity verification on the elliptic curve certificate in the gatekeeper B, and verifies whether the received challengeA is equal to the sending time. If they are equal, the other authentication rules are used. If the gatekeeper B is a legal gatekeeper, the related settings of the RRQ message are performed: Regenerate the sequence random number randomA (such as the incremental addition of the received randomB) and the 4 battle number challengeA (where the value is not in the GRQ) The same value) and ensure that the combination is unique. DhA contains the value of gy. Certificate Stores the actual elliptic curve certificate for terminal A.
  • Step 404 After receiving the Terminal A Registration Request (RRQ) signaling, the Gatekeeper B determines to adopt a symmetric password authentication algorithm according to the local security policy, such as based on symmetric key encryption, sharing. Protocol algorithm as specified by the ITU-T H.235 protocol, such as the secret + hash algorithm.
  • the shared secret is generated by the gxy derived from the Diffie-Hellman protocol in the previous signaling exchange process. In order for terminal A to verify the shared secret negotiated, gatekeeper B is on a separate token.
  • ClearToken [...sendersIDB, ( ⁇ generallDA XOR randomA XOR ... ⁇ EDH- Secret)...] , where EDH-secret represents the shared secrets exported by the Diffie-Hellman protocol.
  • Step 405 After the terminal network security access is completed, the terminal A sends the ARQ signaling to the gatekeeper B, and uses the symmetric crypto technology to implement the security authentication/integrity based on the session key exchanged securely in the network access process.
  • the Diffie-Hellman algorithm can be used to negotiate a call signaling channel session key for communication between multimedia terminals using the dhkey field in a single token ClearToken.
  • Gatekeeper B returns ACF signaling to terminal A, and returns the negotiated call signaling channel session key.
  • Terminal A uses the call signaling channel session key to implement secure authentication of the call signaling channel and the H.245 control channel by using a pre-shared secret mechanism, and establishes a secure channel.
  • Step 408 The gatekeeper B responds to the terminal with the response information for completing the establishment of the H.245 secure channel.
  • Step 409 The terminal C sends ARQ signaling to the gatekeeper B on the secure H.245 channel, and requests to use the security capability exchange procedure of the H.245 protocol to negotiate the media stream communication between the two parties of the multimedia terminal, such as Video or audio, supported encryption algorithms and encryption keys and other parameters.
  • Step 410 The gatekeeper B returns the parameters of the encryption algorithm and the encryption key of the communication of the multimedia terminal after negotiation to the terminal C through the signaling ACF.
  • Step 411 The gatekeeper B sends the encryption algorithm and the encryption key and other parameters of the multimedia terminal communication negotiated by the terminal C to the terminal A, and the media logical channel is established.
  • Terminal C implements packet-based media secure communication using a Real-Time Transport Protocol/Real-Time Transport Control Protocol (RTP/RTCP) in the media logical channel.
  • RTP/RTCP Real-Time Transport Protocol/Real-Time Transport Control Protocol
  • the elliptic curve cryptosystem employed in the method of the present invention has a known public key cryptosystem The highest strength security per bit, the fastest processing speed and the lowest overhead, especially suitable for H.323 multimedia terminals with low memory and low processing capability to achieve network security access.
  • the secure access method proposed by the present invention can be used for various operations. It can also be used to interconnect between different operators.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Algebra (AREA)
  • General Business, Economics & Management (AREA)
  • Business, Economics & Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Physics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A terminal access method based on H.323 protocol applied to a packet network includes the steps of: a gatekeeper authenticating a calling terminal security by using a elliptic curve digital signature of the public key certificate mechanism, and adding the session cryptographic key generated by negotiating with the calling terminal to the signalling of the elliptic curve digital signature of the public key certificate; the calling terminal using a pre-shared secret mechanism to authenticate the security by the session cryptographic key, and to set-up a network access secure channel; the gatekeeper authenticating the receiving terminal security by using the elliptic curve digital signature of the public key certificate mechanism, and adding the session cryptographic key shared with the receiving terminal to the signalling of the elliptic curve digital signature of the public key certificate; the calling terminal and the gatekeeper setting-up a call connection secure channel on the network access secure channel by using a symmetric cryptographic key security mechanism based on the session cryptographic key; on the call connection secure channel, performing a cryptographic algorithm and a cryptographic key negotiation for the real-time media streams communication between the calling terminal and the receiving terminal by using the symmetric cryptographic key security mechanism.

Description

应用于分组网络的基于 H.323协议的  H.323-based protocol applied to packet networks
终端接入方法  Terminal access method
技术领域 本发明涉及分组网络通信安全技术, 尤其涉及一种应用于分组网络 的基于 H.323协议的终端接入方法。 背景技术 目前, 依托专网及互联网部署了大量具有多媒体能力基于 ITU— T H.323协议的终端,开展基于分组网(固定与 3G移动)语音( VoIP, Voice over IP, 基于 IP的语音传输)、 枧频等业务及其它一些增值业务, 并有可 能在未来成为用户接入的主流方式。由于互联网本身的开放性和缺乏有效 监控, 安全接入问题日益凸现, 如拒绝服务(DoS, Denial of Service )攻 击、 服务窃取、 信令流监听、 媒体流监听等安全威胁。 现有的 H.323 网络中, 终端要安全接入网络, 主要是基于 ITU-T ( International Telecommunication Union-Telecommunication standardization sector, 国际电信联盟电信标准化组) H.235协议中对称密 码技术来实现网络对终端的安全认证, 作为实现终端安全接入的手段。安 全机制是通过各相邻节点之间事先预共享秘密或是通过 TLS ( Transport Layer Security, 传输层安全协议 )或 IPSEC ( IP Security, IP安全)协议 使用一个安全端口来保护各种信令安全。具体体现为对端点(多媒体终端 或媒体控制单元( MCU, Media Control Unit ) )之间通信的三个控制过程: 呼叫接纳(RAS, Registration, Admission and Status, 注册、接入和^■态), 呼叫控制(H.225.0呼叫信令协议)、 和连接控制(H.245 )实施安全保护, 包括认证、 隐私性(机密性)、 完整性及不可否认性。 预共享秘、密的对称密码安全机制由于在加、 解密时使用单一密钥, 一旦密钥泄露, 整个通信系统失去安全防 p作用 , 因此在实际应用中暴露 出了越来越多的缺陷。 这种安全机制另外的不足就是当网络规模很大时, 用户预共享秘密分配困难, 即使可行也难于管理。 对于混合网络中, 如移动网络与固定网, 事先协商 TLS或 IPSEC的 机制实施起来艮困难。 公钥密码体制根据其所依据的难题一般分为三类: 大整数分解问题 类、离散对数问题类、椭圆曲线类。有时也把椭圆曲线类归为离散对数类。 椭圆曲线密码体制来源于对椭圆曲线的研究, 所谓椭圆曲线指的是 由韦尔斯特拉斯 ( Weierstrass )方程: 2+ai y+a3y = x3+a2x2+a4x+a6 ( 1 ) 所确定的平面曲线。 其中系数 ( i = 1,2,...,6 ) 定义在某个域上, 可以是 有理数域、 实数域、 复数域, 还可以是有限域 GF ( p ), 椭圆曲线密码体 制中用到的椭圆曲线都是定义在有限域上的。 有限域椭圆曲线上所有点, '附加一个叫做无穷远点的特殊点构成的 集合连同一个定义的 "弦与正切"加法运算规则构成一个 Abel群。 等式 mP = P+P+...+P = Q ( 2 )被称为点积或点的标量乘, 已知标量 m和点 P求点 Q比较容易, 反之已知点 Q和点 P求 m却是相当困难的, 这个问 题称为椭圆曲线离散对数问题。椭圆曲线密码体制正是利用这个困难问题 设计而来。椭圆曲线应用到密码学上最早是由 Neal Koblitz和 Victor Miller 在 1985年分别独立提出的。 椭圆曲线密码体制是目前已知公钥密码体制中, 每比特所提供加密 强度最高的一种体制。 解椭圆曲线上离散对数问题的最好算法是 Pollard rho方法, 其时间复杂度是完全指数阶的。 假设 n为等式 (2 ) 中 m的二 进制表示的位数。 当 n = 234, 复杂度约为 2117, 需要 1.6xl023 MIPS年的 时间。 而我们熟知的 RSA所利用的是大整数分解的困难问题, 目前对于 一般情况下的因数分解的最好算法的时间复杂度是子(亚)指数阶的, 当 n = 2048时, 约需 2x102Q MIPS 的时间。 也就是说当 RSA的密钥使用 2048位时, ECC ( Elliptic Curve Cryptosystem , 椭圆曲线密码体制) 的密 钥使用 234位所获得的安全强度还高出许多。它们之间的密钥长度却相差 达 9倍, 当 ECC的密钥更大时它们之间差距将更大。 ECC密钥短的优点 是非常明显的, 随加密强度的提高, 密钥长度变化不大。 目前, 德国、 日本、 法国、 美国、 加拿大等国的很多密码学研究小 组及一些公司实现了椭圆曲线密码体制,我国也有一些密码学者#文了这方 面的工作。许多标准 组织已经或正在制定关于椭圆曲线的标准, 同时也 有许多的厂商已经或正在开发基于椭圆曲线的产品。对于椭圆曲线密码的 研究也是方兴未艾。 在椭圆曲线密码体制的标准化方面, IEEE ( Institute of Electrical and Electronics Engineers , 电气和电子工程师学会)、 ANSI ( American National Standard Institute, 美国国家标准十办会)、 ISO ( International Standardization Organization, 国际标准 4匕组织)、 IETF ( Internet Engineering Task Force, 因特网工程任务组 ), ATM ( Asynchronous Transfer Mode, 异步传输模式) 等都作了大量的工作, 它们所开发的椭圆曲线标准的文档有: IEEE P1363 P1363a, ANSI X9.62 X9.63 ISO/IEC14888等。 TECHNICAL FIELD The present invention relates to packet network communication security technologies, and in particular, to a H.323 protocol-based terminal access method applied to a packet network. BACKGROUND Currently, a large number of terminals based on the ITU-T H.323 protocol with multimedia capabilities are deployed on a private network and the Internet to implement voice over IP (VoIP, voice over IP, IP-based voice transmission). , 枧frequency and other services and other value-added services, and may become the mainstream way of user access in the future. Due to the openness of the Internet itself and the lack of effective monitoring, security access issues are becoming more and more prominent, such as denial of service (DoS) attacks, service stealing, signaling flow monitoring, media stream monitoring and other security threats. In the existing H.323 network, the terminal needs to access the network securely, mainly based on the ITU-T (International Telecommunication Union-Telecommunication standardization sector) H.235 protocol symmetric cryptography technology to achieve network pairs. Terminal security authentication, as a means to achieve secure access to the terminal. The security mechanism is to protect various signaling security by pre-shared secrets between neighboring nodes or by using a secure port through TLS (Transport Layer Security) or IPSEC (IP Security) protocol. It is embodied in three control processes for communication between endpoints (Multimedia Terminals or Media Control Units): Call Admission (RAS, Registration, Admission and Status, Registration, Access, and Status). Call Control (H.225.0 Call Signaling Protocol), and Connection Control (H.245) implement security protection, including authentication, privacy (confidentiality), integrity, and non-repudiation. The pre-shared secret and secret symmetric cryptographic mechanism uses a single key during addition and decryption. Once the key is leaked, the entire communication system loses its security and anti-p function, so it exposes more and more defects in practical applications. Another disadvantage of this security mechanism is that when the network size is large, the user's pre-shared secret allocation is difficult, and even if it is feasible, it is difficult to manage. For hybrid networks, such as mobile networks and fixed networks, the mechanism for negotiating TLS or IPSEC in advance is difficult to implement. Public key cryptosystems are generally classified into three categories according to the problems they are based on: large integer decomposition problem classes, discrete logarithm problem classes, and elliptic curve classes. Elliptic curve classes are sometimes classified as discrete logarithmic classes. The elliptic curve cryptosystem is derived from the study of elliptic curves, which are referred to by the Weierstrass equation: 2 +ai y+a 3 y = x 3 +a 2 x 2 +a 4 x +a 6 ( 1 ) The determined plane curve. The coefficient (i = 1, 2, ..., 6) is defined in a domain, which can be a rational number field, a real number field, a complex number field, or a finite field GF ( p ), which is used in an elliptic curve cryptosystem. The elliptic curves are all defined on a finite field. All points on a finite field elliptic curve, 'a set of special points called an infinity point is combined with a defined "chord and tangent" addition rule to form an Abel group. The equation mP = P+P+...+P = Q ( 2 ) is called the scalar multiplication of the dot product or point. It is easier to find the scalar m and the point P to find the point Q. Otherwise, the known point Q and the point P are obtained. m is quite difficult. This problem is called elliptic curve discrete logarithm problem. The elliptic curve cryptosystem is designed using this difficult problem. The elliptic curve applied to cryptography was first independently proposed by Neal Koblitz and Victor Miller in 1985. The elliptic curve cryptosystem is a system in which the encryption strength of each bit is the highest in the public key cryptosystem. The best algorithm for solving the discrete logarithm problem on elliptic curves is the Pollard rho method, whose time complexity is fully exponential. Let n be the number of bits of the binary representation of m in equation (2). When n = 234, the complexity is about 2 117 , which takes 1.6xl0 23 MIPS years. The well-known RSA utilizes the difficult problem of large integer decomposition. At present, the time complexity of the best algorithm for factorization in general is sub-sub-exponential order. When n = 2048, it takes about 2x10. 2Q MIPS time. That is to say, when the RSA key uses 2048 bits, the security strength of the ECC (Elliptic Curve Cryptosystem) key using 234 bits is much higher. The key length between them is up to 9 times, and the difference between them is greater when the ECC key is larger. The advantage of the short ECC key is very obvious. As the encryption strength increases, the key length does not change much. At present, many cryptography research groups and some companies in Germany, Japan, France, the United States, Canada and other countries have implemented elliptic curve cryptosystems, and some cryptographers in China have written this work. Many standards organizations have or are developing standards for elliptic curves, and many vendors have developed or are developing products based on elliptic curves. The study of elliptic curve cryptography is also in the ascendant. IEEE ( Institute of Electrical and Standardization) in the standardization of elliptic curve cryptosystems Electronics Engineers, Institute of Electrical and Electronics Engineers, ANSI (American National Standard Institute), ISO (International Standardization Organization, International Standards Organization), IETF (Internet Engineering Task Force, Internet Engineering Task Force) ATM (Asynchronous Transfer Mode) has done a lot of work. The elliptic curve standard documents developed by them are: IEEE P1363 P1363a, ANSI X9.62 X9.63 ISO/IEC14888, etc.
2003年 5月 12日中国颁布的无线局域网国家标准 GB15629.i l中, 包含了全新的 WAPI ( WLAN Authentication and Privacy Infrastructure, 无 线局域网认证与保密体系结构)安全机制, '能为用户的 WLAN系统提供 全面的安全保护。 这种安全 制由 WAI ( WLAN Authentication Infrastructure, WLAN认证体系结构)和 WPI( WLAN Privacy Infrastructure, WLAN 保密体系结构) 两部分组成, 分别实现对用户身份的鉴别和对传 输的数据加密。 WAI 采用公开密钥密码体制, 利用证书来对 WLAN ( Wireless Local Area Network , 无线局域网) 系统中的用户和 AP进行认 证。 证书里面包含有证书颁发者 (ASU, Authentication Service Unit, 认 证月艮务单元 )的公钥和签名以及证书持有者的公钥和签名 , 这里的签名采 用的尤是椭圆曲线 ECC算法。 第六届国际密码学会议对应用于公钥密码系统的加密算法推荐了两 种:基于大整数因子分解问题(IFP, Integer Factorization Problem )的 RS A 算法和基于椭圆曲线上离散对数计算问题( ECDLP, Elliptic Curve Discrete Logarithm Problem )的 ECC算法。 RSA算法的特点之一是数学原理简单、 在工程应用中比较易于实现, 但它的单位安全强度相对较低。 目前用国际 上公认的对于 RSA算法最有效的攻击方法 般数域筛(NFS , NumberOn May 12, 2003, China's WLAN national standard GB15629.il included a new WAPI (WLAN Authentication and Privacy Infrastructure) security mechanism, which provides comprehensive coverage for users' WLAN systems. Security protection. This security system consists of two parts: WAI (WLAN Authentication Infrastructure) and WPI (WLAN Privacy Infrastructure), which respectively authenticate the user's identity and encrypt the transmitted data. WAI uses a public key cryptosystem to authenticate users and APs in a WLAN (Wireless Local Area Network) system. The certificate contains the public key and signature of the certificate issuer (ASU, Authentication Service Unit) and the certificate holder's public key and signature. The signature here is especially the elliptic curve ECC algorithm. The Sixth International Cryptography Conference recommends two encryption algorithms for public key cryptosystems: the RS A algorithm based on the Integer Factorization Problem (IFP) and the discrete logarithm calculation based on the elliptic curve ( ECDLP, Elliptic Curve Discrete Logarithm Problem) ECC algorithm. One of the characteristics of the RSA algorithm is that the mathematical principle is simple, and it is relatively easy to implement in engineering applications, but its unit security strength is relatively low. Currently the most effective attack method for the RSA algorithm is recognized internationally. NFS, Number
Field Sieve )方法去破译和攻击 RSA算法, 它的破译或求解难度是亚指数 级的。 ECC 算法的数学理论非常深奥和复杂, 在工程应用中比较难于实 现, 但它的单位安全强度相对较高。 用国际上公认的对于 ECC算法最有 效的攻击方法—— Pollard rho方法去破译和攻击 ECC算法, 它的破译或 求解难度基本上是指数级的。正是由于 RSA算法和 ECC算法这一明显不 同, 使得 ECC算法的单位安全强度高于 RSA算法, 也就是说, 要达到同 样的安全强度, ECC算法所需的密钥长度远比 RSA算法低。 这就有效地 解决了为了提高安全强度必须增加密钥长度所带来的工程实现难度的问 题。 克月良现有网络安全机制缺陷的一个可行方法就是基于公钥密码体 制, 因此, 需要一种基于椭圆曲线公钥密码学实现多媒体终端安全接入网 络的方法。 发明内容 本发明的主要目的在于提供一种应用于分组网络的基于 H.323协议 的终端接入方法, 包括终端的认证、完整性、不可否认性及抗重放攻击等。 其特征 于椭圆曲线上离散对数困难问题假设出发, 借助于哈希函数, 椭圆曲线公钥证书,利用椭圆曲线数字签名方法实现终端的安全接入及共 享秘密或会话密钥的安全传输。 为了实现上述目的,本发明提供了一种应用于分组网络的基于 H.323 协议的终端接入方法。 终端接入方法包括以下步骤: 步驟 S 102 , 网守采用椭圆曲线公钥证书数字签名体制对呼入终端进 行安全认证,并将与呼入终端协商生成的呼叫信令信道会话密钥加入椭圆 曲线公钥证书数字签名的信令中, 并发送至呼入终端, 从而建立第一网络 接入安全信道; 步驟 S104, 呼入终端通过呼叫信令信道会话密钥, 采用预共享秘密 机制进行安全认证, 从而与接收终端建立第二网络接入安全信道; 步骤 S 106 , 网守采用椭圆曲线公钥证书数字签名体制对接收终端进 行安全认证,并将与接收终端共享的呼叫信令信道会话密钥加入椭圆曲线 公钥证书数字签名的信令中, 并发送至接收终端, 从而建立第三网络接入 安全信道; 步骤 S108, 呼入终端和网守基于呼叫信令信道会话密钥, 在第二网 络接入安全信道上, 采用对称密码安全机制建立呼叫连接安全信道; 步骤 S110, 在呼叫连接安全信道上, 采用对称密码安全机制为呼入 终端和接收终端之间的实时媒体流通信进行加密算法和密钥协商,从而实 现媒体流的实时安全通信。 优选地, 在步驟 S102中 , 通过 Diffie-Hellman密钥分配方案协商生 成所述呼叫信令信道会话密钥。 在步骤 S102和步驟 S106中, 所述网守采用椭圆曲线公钥证书数字 签名体制对终端进行安全认证的步骤可以包括以下步骤: a. >据椭圆曲线公钥证书给出的公共椭圆曲线算法集, 定义一个系 统参数集 D= (p, a, b, G, n, h), 其中 p为一个大于 160bit的素整数, 指定有限或 GF (p); a, b指定曲线 E; G= (xG, yG) GE (GF (p))为 一个基点; 素数 n为基点 G的阶; h = #E (GF (p)) /n为协因子整数; #E ( GF ( p ) )表示椭圆曲线点群的阶; b. 对信令中序列随机数、 时戳、挑战数、 发送终端名、接收网守名、 全信令签名或部分信令消息签名标记进行设置,并放入一个明文消息令牌 中; c 基于不同安全策略决定是对整个信令进行数字签名还是只对信令 消息的一部分, 并放入明文消息令牌中; d. 选择安全哈希函数, 使用哈希函数对部分消息进行数字签名的信 令消息进行运算, 生成固定长度的消息摘要; e. 建立密钥对 ( d, Q), 其中 d是私钥, Q = dG是公钥; 向网守发 送哈希函数, 椭圆曲线参数 a, b和公钥 Q; f. 选择一个随机或伪随机数 k, l≤k<n- 1; g. 计算 kG= (xl5 yi ), r = X! modn, :¾口果 r = 0, 则返回步骤 f; 计 算 s = k'— 1 (e + dr) modn, 如果 s = 0, 则返回步骤 f; h. 呼入终端完成对信令消息的签名 (r, s), 并将该签名嵌入到信令 消息中并发送给网守; i. 网守取出公共椭圆曲线参数集 D = {p, a, b, G, n, h}与终端相 关公钥 Q的授权拷贝, 验证终端的签名 (r, s)是否超过椭圆曲线基点群 阶的范围, 如果是, 则表示为不合法的数字签名, 拒绝终端的接入; j. 如果终端的签名 (r, s) 没有超过椭圆曲线基点群阶的范围, 网 守判断消息签名是对整个信令消息签名还是只是消息的部分签名,并随后 生成不同的消息 4离要 e;计算 w = s— 1 mod n, ui = ew mod n, u2 = rw mod n, 及 X = UiG + u2Q= (xl5 yi )的值; 当 !为。或不等于 r时, 说明签名无 效, 拒绝终端的接入; k. 当 Xl等于 r且不等于 0时, -验证签名本身计算的正确性, 网守完 成对终端的接入认证。 在步骤 c 中, 基于不同安全策略决定是对整个信令进行数字签名还 是只对部分消息进行数字签名的步骤可以包括:如果所述终端与所述网守 之间物理上为相邻连接, 则对整个信令进行数字签名; 如果所述终端与所 述网守之间存在防火墙, 则只对部分消息进行数字签名。 可选地, 数字签名的数字证书内部格式由 CCITT ( International Telegraph and Telephone Consultative Committee , 国际电才艮电话咨询委员 会) X.509规定, 其内容可以包括: 证书的版本号、 数字证书的序列号、 证书拥有者的姓名、 签名算法、 颁发数字证书的单位、 颁发数字证书的单 位的签名、 以及公开密钥的有效期等。 网守可以通过验证呼入终端时间戳的生存期和随机序列值的唯一性 来抵御拒绝服务攻击。 网守可以通过对接收终端身扮与自己标识符比较来俭证所述接收终 端是否为合法用户。 The Field Sieve method is used to decipher and attack the RSA algorithm. Its difficulty in deciphering or solving is sub- exponential. The mathematical theory of the ECC algorithm is very esoteric and complex, and it is difficult to implement in engineering applications, but its unit security strength is relatively high. Using the Pollard rho method, the most effective attack method for the ECC algorithm, to decipher and attack the ECC algorithm, its deciphering or solving difficulty is basically exponential. It is precisely because of the obvious difference between the RSA algorithm and the ECC algorithm that the unit security strength of the ECC algorithm is higher than that of the RSA algorithm, that is, to achieve the same security strength, the key length required by the ECC algorithm is much lower than the RSA algorithm. This effectively solves the problem that the engineering implementation difficulty caused by the increase of the key length in order to improve the security strength. A feasible method for the defects of the existing network security mechanism of Ke Yueliang is based on the public key cryptosystem. Therefore, a method for secure access to the multimedia terminal based on elliptic curve public key cryptography is needed. SUMMARY OF THE INVENTION A primary object of the present invention is to provide a terminal access method based on the H.323 protocol applied to a packet network, including authentication, integrity, non-repudiation, and anti-replay attacks of the terminal. Its characteristics are based on the assumption of the discrete logarithm problem on the elliptic curve. By means of the hash function, the elliptic curve public key certificate, the elliptic curve digital signature method is used to realize the secure access of the terminal and the secure transmission of the shared secret or session key. In order to achieve the above object, the present invention provides a terminal access method based on the H.323 protocol applied to a packet network. The terminal access method includes the following steps: Step S102: The gatekeeper uses the elliptic curve public key certificate digital signature system to perform security authentication on the incoming terminal, and adds the call signaling channel session key generated by the negotiation with the incoming terminal to the elliptic curve. The public key certificate is digitally signed and sent to the incoming terminal to establish a first network access security channel. Step S104: The incoming terminal uses the pre-shared secret mechanism to perform security authentication by using a call signaling channel session key. And establishing a second network access security channel with the receiving terminal; Step S106, the gatekeeper uses the elliptic curve public key certificate digital signature system to perform security authentication on the receiving terminal, and the call signaling channel session key shared with the receiving terminal Adding the digital signature of the elliptic curve public key certificate to the receiving terminal, and transmitting to the receiving terminal, thereby establishing a third network access security channel; Step S108, the incoming terminal and the gatekeeper are based on the call signaling channel session key, in the second On the network access security channel, a symmetric password security mechanism is used to establish a call connection security channel; Step S11 0. On the call connection security channel, a symmetric cryptographic security mechanism is used to perform encryption algorithm and key negotiation for real-time media stream communication between the incoming terminal and the receiving terminal, thereby realizing real-time secure communication of the media stream. Preferably, in step S102, the call signaling channel session key is negotiated by a Diffie-Hellman key distribution scheme. In step S102 and step S106, the step of the gatekeeper performing security authentication on the terminal by using the elliptic curve public key certificate digital signature system may include the following steps: a. > a public elliptic curve algorithm set according to an elliptic curve public key certificate , defining a system parameter set D = (p, a, b, G, n, h), where p is a prime integer greater than 160 bits, specifying a finite or GF (p); a, b specifying a curve E; G = ( x G , y G ) GE (GF (p)) is a base point; prime number n is the order of the base point G; h = #E (GF (p)) / n is a cofactor integer; #E ( GF ( p ) ) Indicates the order of the elliptic curve point group; b. sets the sequence random number, time stamp, challenge number, transmission terminal name, receiving gatekeeper name, full signaling signature, or part of the signaling message signature flag in the signaling, and puts a plaintext message token; c is based on different security policies to decide whether to digitally sign the entire signaling or only part of the signaling message and put it in a plaintext message token; d. Select a secure hash function, use a hash The function performs a digitally signed signaling message on a part of the message to generate a fixed length. Message digest; e. Establish a key pair (d, Q), where d is the private key, Q = dG is the public key; send a hash function to the gatekeeper, elliptic curve parameters a, b and public key Q; f. a random or pseudo-random number k, l ≤ k < n - 1; g. Calculate kG = (x l5 yi ), r = X! modn, :3⁄4 口 r = 0, then return to step f; calculate s = k '— 1 (e + dr) modn, if s = 0, return to step f; h. The incoming terminal completes the signature (r, s) of the signaling message, and embeds the signature in the signaling message and sends To the gatekeeper; i. The gatekeeper takes out the public elliptic curve parameter set D = {p, a, b, G, n, h} and the authorized copy of the terminal-related public key Q, verifying whether the terminal's signature (r, s) exceeds The range of the elliptic curve base point group, if it is, it is an illegal digital signature, rejecting the access of the terminal; j. If the signature (r, s) of the terminal does not exceed the range of the elliptic curve base point group, the gatekeeper judges Whether the message signature is a signature of the entire signaling message or just a partial signature of the message, and then generates a different message 4 e; calculate w = s - 1 mod n, ui = ew mod n, u 2 = rw mod n, and X = UiG + u 2 Q= ( The value of x l5 yi ); when! for. Or not equal to r, the signature is not Effect, reject the access of the terminal; k. When Xl is equal to r and not equal to 0, - verify the correctness of the signature calculation itself, and the gatekeeper completes the access authentication to the terminal. In step c, the step of digitally signing the entire signaling or only partially signing the partial signaling based on different security policies may include: if the terminal is physically adjacent to the gatekeeper, The entire signaling is digitally signed; if there is a firewall between the terminal and the gatekeeper, only part of the message is digitally signed. Optionally, the digital signature internal format of the digital certificate is specified by CCITT (International Telegraph and Telephone Consultative Committee) X.509, and the content may include: a version number of the certificate, a serial number of the digital certificate, The name of the certificate owner, the signature algorithm, the unit that issued the digital certificate, the signature of the unit that issued the digital certificate, and the validity period of the public key. The gatekeeper can defend against denial of service attacks by verifying the lifetime of the incoming terminal timestamp and the uniqueness of the random sequence value. The gatekeeper can prove whether the receiving terminal is a legitimate user by comparing the receiving terminal appearance with its own identifier.
致及是否具有相应的访问权限。 在步骤 S102中, 通过 Diffie-Hellman密钥分配方案协商生成所述呼 叫信令信道会话密钥的步骤可以包括以下步骤: a. 所述呼入终端在信令中, 建立一个数据单元 dhKey{halfkey ( gx ), modsize (素数模 p ), generator (乘法群的生成元 g ) }; 所述呼入终端生 成一个随机数 X, 进行相应的计算后发给所述网守; b. 所述网守接收到信令消息后,随机生成一个秘密数 y,并计算(gx ) y - gxy作为与所述呼入终端的共享会话密钥, 在返回的信令中, 填写数据 单元各字段 {halfkey ( gy ), modsize ( p ), generator ( g ) } ; c. 所述呼入终端在接收到信令后,与所述网守进行相同的计算, ( gy ) x = gyx = gxy, 完成与所述网守共享会话密钥。 优选地, 在步骤 SI 10中, 在所述呼叫连接安全信道上, 利用所述呼 叫信令信道会话密钥,采用预共享秘密机制实现 H.245控制信道的安全认 证, 建立连接控制安全信道; 在所述连接控制安全信道上, 利用 H.245协 议所具有的安全能力交换规程,协商出所述呼入终端与所述接收终端进行 媒体流通信所支持的加密算法和加密密钥,并用所述呼叫信令信道会话密 钥进行传输保护。 网守对终端的安全接入可以包括: 机密性、 身份性认证、 完整性认 证、 及不可 4氏赖性认证等。 通过上述技术方案, 本发明实现终端在与网络间没有建立任何预共 享秘密时的安全接入、安全信道的建立以及终端间媒体流的安全传输, 具 有每比特高强度安全性, 处理速度快和开销低等特点, 适用于具有低内存 与低处理能力的 H. 323多媒体终端实现网络安全接入。 附图说明 此处所说明的附图用来提供对本发明的进一步理解, 构成本申请的 一部分, 本发明的示意性实施例及其说明用于解释本发明, 并不构成对本 发明的不当限定。 在附图中: 图 1是 居本发明的终端接入方法的流程图; 图 2是根据本发明实施例的呼叫模式场景图; 图 3 是根据本发明实施例的终端接入时椭圆曲线数字签名过程的流 程图; 图 4 是 >据本发明实施例的网守睑证终端椭圆曲线数字签名过程的 程图; 以及 图 5是根据本发明实施例的网守路由直接呼叫模式下终端安全接入 协议流程图。 具体实施方式 下面将参考附图详细说明本发明。 由于对称密钥体制相对于公钥密码体制, 具有加密速度快得多的优 点, 因此, 可以利用一种混合加密方法, 综合它们的优点, 即用公钥加密 体制安全传输会话密钥, 再用会话密钥进行信息加密和解密。 结合 H.323 多媒体终端通信系统 , 就是基于公钥密码, 实现终端或 MCU与网守之间 安全传递 RAS消息, 从而实现终端的安全接入, 安全接入的同时协商出 一个安全会话密钥, 基于此共享会话密钥, 采用对称密码机制建立一个满 足各种呼叫路由模式的安全呼叫连接信道( H.225.0 ),再在此安全信道上, 利用呼叫控制 ( H.245 )协议安全协商能力, 为多媒体终端之间的实时媒 体流通信进行加密算法与密钥协商, 最后完成媒体流实时通信安全。 本发明提供的应用于分组网络的基于 H.323协议的终端接入方法包 括如下步骤: Respond to the appropriate access rights. In step S102, the step of generating the call signaling channel session key through the Diffie-Hellman key allocation scheme may include the following steps: a. The inbound terminal establishes a data unit dhKey{halfkey in the signaling. ( g x ), modsize (primary modulus p ), generator (generating element g of the multiplicative group) }; the incoming terminal generates a random number X, performs corresponding calculation, and sends it to the gatekeeper; b. After receiving the signaling message, the gatekeeper randomly generates a secret number y, and calculates (g x ) y - g x y as the shared session key with the incoming terminal, and fills in the data unit in the returned signaling. Each field {halfkey ( g y ), modsize ( p ), generator ( g ) } ; c. the incoming terminal performs the same calculation as the gatekeeper after receiving the signaling, ( g y ) x = g yx = g xy , complete sharing the session key with the gatekeeper. Preferably, in step S10, on the call connection security channel, using the call signaling channel session key, using a pre-shared secret mechanism to implement security authentication of the H.245 control channel, establishing a connection control security channel; And on the connection control security channel, using the security capability exchange procedure of the H.245 protocol, negotiating an encryption algorithm and an encryption key supported by the incoming terminal and the receiving terminal for media stream communication, and using the encryption key The call signaling channel session key is transport protected. The secure access of the gatekeeper to the terminal may include: confidentiality, identity authentication, integrity authentication, and non-compliance certification. Through the above technical solution, the present invention implements secure access, secure channel establishment, and secure transmission of media streams between terminals when no pre-shared secret is established between the network, and has high-intensity security per bit, and the processing speed is fast. Low overhead, suitable for H. 323 multimedia terminals with low memory and low processing capability for network security access. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, 1 is a flowchart of a terminal access method according to the present invention; FIG. 2 is a call mode scene diagram according to an embodiment of the present invention; FIG. 3 is an elliptic curve number when a terminal is accessed according to an embodiment of the present invention; FIG. 4 is a flowchart of an elliptic curve digital signature process of a gatekeeper certificate terminal according to an embodiment of the present invention; and FIG. 5 is a terminal security connection in a gatekeeper route direct call mode according to an embodiment of the present invention; Enter the protocol flow chart. DETAILED DESCRIPTION OF THE INVENTION The present invention will be described in detail below with reference to the accompanying drawings. Because the symmetric key system has a much faster encryption speed than the public key cryptosystem. Therefore, a hybrid encryption method can be utilized to combine their advantages, that is, the public key encryption system securely transmits the session key, and the session key is used for information encryption and decryption. In combination with the H.323 multimedia terminal communication system, the public key cryptography is used to securely transfer RAS messages between the terminal or the MCU and the gatekeeper, thereby realizing secure access of the terminal, and securely accessing a secure session key at the same time, based on The shared session key uses a symmetric crypto mechanism to establish a secure call connection channel (H.225.0) that satisfies various call routing modes, and then uses the call control (H.245) protocol security negotiation capability on the secure channel. The real-time media stream communication between the multimedia terminals performs encryption algorithm and key negotiation, and finally completes real-time communication security of the media stream. The H.323 protocol-based terminal access method applied to a packet network provided by the present invention includes the following steps:
( 1 )网络呼叫接纳通信阶段, 网守采用椭圆曲线公钥证书数字签名 体制实现对呼入终端的安全认证,并在椭圆曲线公钥证书数字签名的信令 中建立一个数据单元, 用于通过 Diffie-Hellman密钥分配方案与呼叫终端 协商生成共享会话密钥, 建立网络接入安全信道; (1) In the network call admission communication phase, the gatekeeper uses the elliptic curve public key certificate digital signature system to implement secure authentication of the incoming terminal, and establishes a data unit in the signaling of the elliptic curve public key certificate digital signature for passing The Diffie-Hellman key distribution scheme negotiates with the calling terminal to generate a shared session key, and establishes a network access security channel;
( 2 )网守采用椭圆曲线公钥证书数字签名体制实现对接收终端的安 全认证, 并在椭圆曲线公钥证书数字签名的信令中建立一个数据单元, 向 接收终端传递 Diffie-Hellman密钥分配方案产生的与接收终端共享的会话 密钥, 建立网络接入安全信道; (2) The gatekeeper adopts the elliptic curve public key certificate digital signature system to realize the security authentication of the receiving terminal, and establishes a data unit in the signaling of the elliptic curve public key certificate digital signature, and transmits the Diffie-Hellman key distribution to the receiving terminal. a session key generated by the solution and shared by the receiving terminal, establishing a network access security channel;
( 3 ) 网络呼叫控制通信阶段:呼入终端和网守基于步骤(1 )产生的 共享会话密钥 , 在建立的网络接人 -安全信道上, 采用对称密码机制建立一 个满足各种呼叫路由模式的呼叫连接安全信道; (3) Network call control communication phase: the incoming terminal and the gatekeeper establish a matching call routing mode based on the shared session key generated in step (1) on the established network access-safe channel using a symmetric cryptosystem. Call connection secure channel;
( 4 ) 网络连接控制通信阶段, 在呼叫连接安全信道上, 采用对称密 码机制为多媒体终端之间的实时媒体流通信进行加密算法与密钥协商,实 现多媒体终端之间媒体流的实时安全通信。 所述方法中采用椭圆曲线公钥证书数字签名体制实现终端与网守之 间安全认证步骤可以是: a. 根据椭圆曲线公钥证书给出的公共椭圆曲线算法集, 定义一个系 统参数集 D = (p, a, b, G, n, h), 其中 p为一个大于 160bit的素整数, 指定 有限域 GF(p); a, b指定曲线 E; G = (xG, yG) EE(GF(p))为一个基点; 素 数 n为基点 G的阶; h=#E(GF(p))/n为协因子整数; #E(GF(p))表示椭圓曲 线点群的阶; b. 对信令中序列随机数、 时戳、 挑战数、发送终端名、 接收网守名、 全信令签名或部分信令消息签名标记进行设置 ,并放入一个明文消息令牌 中; (4) In the network connection control communication phase, a symmetric crypto mechanism is used to perform encryption algorithm and key negotiation for real-time media stream communication between multimedia terminals on the call connection security channel, so as to realize real-time secure communication of media streams between multimedia terminals. The method for implementing the secure authentication between the terminal and the gatekeeper using the elliptic curve public key certificate digital signature system in the method may be: a. defining a system parameter set D = (based on the public elliptic curve algorithm set given by the elliptic curve public key certificate) p, a, b, G, n, h), where p is a prime integer greater than 160 bits, specifying a finite field GF(p); a, b specifying a curve E; G = (x G , y G ) EE (GF (p)) is a base point; prime number n is the order of base point G; h=#E(GF(p))/n is a cofactor integer; #E(GF(p)) represents an elliptical curve The order of the line point group; b. Set the sequence random number, time stamp, challenge number, transmission terminal name, receiving gatekeeper name, full signaling signature or partial signaling message signature flag in the signaling, and put a plaintext In the message token;
C. 基于不同安全策略决定是对整个信令进行数字签名还是只对信令 消息的一部分, 并放入明文消息令牌中; d. 选择安全哈希函数, 使用哈希函数对部分消息进行数字签名的信 令消息进行运算, 生成固定长度的消息摘要; e. 建立密钥对 (d,Q), 其中 d是私钥, Q=dG是公钥; 向网守发送哈 希函数, 椭圆曲线参数 a,b和公钥 Q; f. 选择一个随机或伪随机数 k, l≤k≤n - 1; g. 计算 kG - ^ y,), r = xi mod n, 如果 r = 0, 则返回步骤 f; 计算 s = k" ](e + dr) mocl n, 如果 s = 0, 则返回步據 f; h. 呼入终端完成对信令消息的签名 (r, s), 并将该签名嵌入到信令消 息中并发送给网守; i. 网守取出公共椭圆曲线参数集 D={p,a,b,G,n,h}与终端相关公钥 Q 的授权拷贝, 验证终端的签名 ( r, s )是否超过椭圆曲线基点群阶的范围, 如果是, 则表示为不合法的数字签名, 拒绝终端的接入; j. 如果终端的签名 (r, s )没有超过椭圆曲线基点群阶的范围, 网守 判断消息签名是对整个信令消息签名还是只是消息的部分签名,并随后生 成不同的消息 4离要 e; w = s" 1 mod n, uj = ew mod n, u2 = rw mod n, 及 X - u!G + uzQ xuO的值; 当 xi为 0或不等于 r时, 说明签名无效, 拒绝终端的接入; k. 当 Xl等于 r且不等于 0时, 验证签名本身计算的正确性, 网守完 成对终端的接入认证。 上述方法步骤 c中, 基于不同的安全策略决定是对整个信令进行数 字签名还是只对部分消息进行数字签名的步 可以是:如果终端与网守之 间物理上为相邻连接, 对整个信令进行数字签名; 如果终端与网守之间存 在防火墙, 只对部分消息进行数字签名。 所述方法步骤( 1 ) 中, 数字签名的数字证书内部格式由 CCITT X . 509规定,可以包含以下几方面内容: 证书的版本号、数字证书的序列号、 证书拥有者的姓名、 签名算法、 颁发数字证书的单位、 颁发数字证书的单 位的签名、 公开密钥的有效期。 所述方法中, 网守可以通过睑证呼入终端时间戳的生存期和随机序 列值的唯一性, 来抵御拒绝服务攻击。 所述方法中, 网守可以通过对接收终端身份与自己标识符比较, 来 验证接收终端是否为一个合法用户。 所述方法中, 网守可以验证呼入终端的标识符是否与其证书内身份 标识符一致及是否具有相应的访问权限。 所述方法中,呼入终端通过 Diffie-Hellman密钥分配方案与网守协商 生成共享会话密钥的步骤可以是: a. 呼入终端在信令中, 建立一个数据单元 dhKey {halfkey(gx) , modsize (素数模 p), generator (乘法群的生成元 g)} ; 终端生成一个随机数 X , 进行相应的计算后发给网守; b. 网守接收到信令消息后,随机生成一个秘密数 y ,并计算 (gx)y = gxy 作为与终端的共享会话密钥, 在返回的信令中, 填写数据单元各字段C. Based on different security policies, decide whether to digitally sign the entire signaling or only part of the signaling message and put it in the plaintext message token; d. Select the secure hash function and use the hash function to digitize some of the messages. The signed signaling message is operated to generate a fixed length message digest; e. Establish a key pair (d, Q), where d is the private key, Q = dG is the public key; send a hash function to the gatekeeper, elliptic curve Parameters a, b and public key Q; f. Select a random or pseudo-random number k, l ≤ k ≤ n - 1; g. Calculate kG - ^ y,), r = xi mod n, if r = 0, then Return to step f; calculate s = k" ] (e + dr) mocl n, if s = 0, return step f; h. The incoming terminal completes the signature (r, s) of the signaling message, and will The signature is embedded in the signaling message and sent to the gatekeeper; i. The gatekeeper takes out the public elliptic curve parameter set D={p, a, b, G, n, h} and the authorized copy of the terminal-related public key Q, verifying the terminal Whether the signature (r, s) exceeds the range of the elliptic curve base point group, and if so, it is represented as an illegal digital signature, denying access to the terminal; j. (R, s) does not exceed the range of the group order elliptic curve point, gatekeeper message signature is determined for the whole or only part of the signaling message signature signed message, and then generates a different message from 4 to e; w = s "1 Mod n, uj = ew mod n, u 2 = rw mod n, and the value of X - u!G + uzQ xuO; when xi is 0 or not equal to r, the signature is invalid, denying access to the terminal; k. When Xl is equal to r and is not equal to 0, the correctness of the calculation of the signature itself is verified, and the gatekeeper completes the access authentication to the terminal. In step c of the foregoing method, the step of digitally signing the entire signaling or only partially signing the partial message based on different security policies may be: if the terminal and the gatekeeper are physically adjacent, the entire signaling Digital signature; if the terminal is stored with the gatekeeper In the firewall, only some messages are digitally signed. In the method step (1), the digital signature internal format of the digital certificate is specified by CCITT X.509, and may include the following aspects: the version number of the certificate, the serial number of the digital certificate, the name of the certificate owner, the signature algorithm, The unit that issued the digital certificate, the signature of the unit that issued the digital certificate, and the validity period of the public key. In the method, the gatekeeper can defend against the denial of service attack by verifying the lifetime of the incoming timestamp and the uniqueness of the random sequence value. In the method, the gatekeeper can verify whether the receiving terminal is a legitimate user by comparing the identity of the receiving terminal with its own identifier. In the method, the gatekeeper can verify whether the identifier of the incoming terminal is consistent with the identity identifier in the certificate and has corresponding access rights. In the method, the step of the inbound terminal to generate the shared session key by negotiating with the gatekeeper through the Diffie-Hellman key distribution scheme may be: a. The inbound terminal establishes a data unit dhKey {halfkey(g x) in the signaling. ), modsize (primary modulus p), generator (generating group g of the multiplicative group)}; the terminal generates a random number X, sends the corresponding calculation to the gatekeeper; b. the gatekeeper receives the signaling message and randomly generates a secret number y and calculate (g x )y = g xy as the shared session key with the terminal. In the returned signaling, fill in the fields of the data unit.
{halfkey(gy), modsize(p) , generator(g)}; c. 终端在接收到信令后, 与网守进行相同的计算, (gy)x = gyx = gxy, 完成与网守共享会话密钥。 所述方法中, 网络连接控制通信阶段在呼叫连接安全信道上, 可以 利用呼叫信令信道会话密钥,采用预共享秘密机制实现 H.245控制信道的 安全认证, 建立连接控制安全信道; 在连接控制安全信道上, 利用 H.245 协议所具有的安全能力交换规程,协商出多媒体终端通信双方进行媒体流 通信所支持的加密算法和加密密钥 ,并用呼叫信令信道会话密钥进行传输 保护。 所述方法中, 网守对终端的安全接入可以包括: 机密性, 身份性认 证、 完整性认证及不可 ^氏赖性认证。 本发明目的在于提供基于椭圆曲线公钥证书数字签名方法实现{halfkey(g y ), modsize(p) , generator(g)}; c. After receiving the signaling, the terminal performs the same calculation as the gatekeeper, (g y ) x = g yx = g xy , The gatekeeper shares the session key. In the method, the network connection control communication phase can use the call signaling channel session key, use the pre-shared secret mechanism to implement the security authentication of the H.245 control channel, establish a connection control security channel, and connect in the call connection security channel; On the control safety channel, using the security capability exchange procedure of the H.245 protocol, the encryption algorithm and the encryption key supported by the multimedia terminal communication parties for media stream communication are negotiated, and the call signaling channel session key is used for transmission protection. In the method, the secure access of the gatekeeper to the terminal may include: confidentiality, identity recognition Certification, integrity certification and non-compliance certification. The object of the present invention is to provide a digital signature method based on an elliptic curve public key certificate.
H.323网络下, 具有多媒体处理能力终端安全接入网络方法。 所发明的方 法是从椭圆曲线离散对数出发,辅以抗碰撞散列函数, 利用椭圆曲线公钥 证书数字签名方法, 实现终端接入过程中身份确认、 完整性检查, 如果需 要还可以实现不可否认性等安全属性。在确定用户身份的同时,结合 H.225 RAS信令的交互,利用 Diffie-Hellman密钥 1办商方案生成终端与网络接入 节点网守共享秘、密或会话密钥,为后面的呼叫连接及媒体流通信建立安全 通信信道。 本发明所采用的方法, 其安全基础是基于椭圆曲线离散对数问题。 给定一条定义在有限域 GF(p)上椭圆曲线 E,—个阶为 n的点 PEE及一个 点<5 = 1^, 其中 0≤k≤n - 1 , 确定 k。 椭圆曲线离散对数问题具有可证 明的安全性, 相对于目前流行的 RSA公钥密码体制, 具有速度快, 安全 性高及对终端的处理能力要求低等优点。 本发明实现 H.323 系统中多媒体终端安全接入网络内容, 就是对网 络接入 ( H.225.0 RAS ), 呼叫控制 ( H.225.0呼叫信令协议)与连接控制 ( H.245 )三个通信阶段实施认证、 隐私性(机密性)、 完整性及不可否认 性保护。 首先在网络接入过程中, 采用椭圆曲线公钥证书数字签名过程, 实现安全认证, 同时基于 Diffie-Hellman密钥分配方案协商一个共享会话 密钥, 以建立起一个安全信道, 在此安全信道上, 对后面二个通信阶段, 基于传统对称密码技术分别建立相应的安全信道,实现多媒体终端之间通 信安全与保密。 终端在接入网络前, 与网络事先没有任何预共享秘密, 要实现终端 安全接入网络涉及到二个问题: 一是对用户身份的安全确认; 二是密钥交 换, 即终端与网守之间, 通过信令交互实现共享秘密或会话密钥的交换。 解决这二个问题的方法就是引入表示用户身份的数字证书。数字证书能有 效表明终端身份, 同时可以实施密钥交换方法。 数字证书内部格式可由 CCITT X.509规定,它必须包含以下几个方面的信息内容:证书的版本号; 数字证书的序列号;证书拥有者的姓名;签名算法;颁发数字证书的单位; 颁发数字证书的单位的签名; 公开密钥的有效期等。 这些信息称为证书数 据 ( Certification )。 参照图 1 ,根据本发明的应用于分组网络的基于 Η.323协议的终端接 入方法包括以下步骤: 步 S 102 , 网守采用椭圆曲线公钥证书数字签名体制对呼入终端进 行安全认证,并将与呼入终端协商生成的呼叫信令信道会话密钥加入椭圆 曲线公钥证书数字签名的信令中, 并发送至呼入终端, 从而建立第一网络 接入安全信道; 步骤 S104, 呼入终端通过呼叫信令信道会话密钥, 采用预共享秘密 机制进行安全认证, 从而与接收终端建立第二网络接入安全信道; 步骤 S106 , 网守采用椭圆曲线公钥证书数字签名体制对接收终端进 行安全认证,并将与接收终端共享的呼叫信令信道会话密钥加入椭圆曲线 公钥证书数字签名的信令中, 并发送至接收终端, 从而建立第三网络接入 安全信道; 步骤 S108, 呼入终端和网守基于呼叫信令信道会话密钥, 在第二网 络接入安全信道上, 采用对称密 安全机制建立呼叫连接安全信道; 步骤 S110, 在呼叫连接安全信道上, 采用对称密码安全机制为呼入 终端和接收终端之间的实时媒体流通信进行加密算法和密钥协商,从而实 现媒体流的实时安全通信。 如图 2所示, 为本发明实施例方法所述的呼叫模式场景图, 说明了 本发明实施例方法基于椭圆曲线公钥证书数字签名方法实现终端网络安 全接入过程, 包括信令的认证、 完整性及不可 4氏赖性等安全特征。 本发明 实施例方法假定网络各节点事先已经拥有完成安全接入及密钥协商时通 信双方公钥证书或椭圆曲线公钥证书, 具体步 如下: Under the H.323 network, there is a multimedia processing capability terminal security access network method. The invented method starts from the discrete logarithm of the elliptic curve, supplemented by the anti-collision hash function, and uses the elliptic curve public key certificate digital signature method to realize the identity confirmation and integrity check in the terminal access process, and can also be implemented if necessary. Denial and other security attributes. While determining the identity of the user, combined with the interaction of H.225 RAS signaling, the Diffie-Hellman key 1 operator scheme is used to generate a secret, secret or session key for the terminal and the network access node gatekeeper to connect to the subsequent call. And media stream communication establishes a secure communication channel. The method used in the present invention is based on the elliptic curve discrete logarithm problem. Given a elliptic curve E defined in the finite field GF(p), a point PEE of order n and a point <5 = 1^, where 0 ≤ k ≤ n - 1 , determine k. The elliptic curve discrete logarithm problem has provable security. Compared with the current popular RSA public key cryptosystem, it has the advantages of high speed, high security and low processing capability for the terminal. The invention realizes the secure access network content of the multimedia terminal in the H.323 system, that is, three communications of network access (H.225.0 RAS), call control (H.225.0 call signaling protocol) and connection control (H.245) Phases implement certification, privacy (confidentiality), integrity and non-repudiation protection. First, in the network access process, the elliptic curve public key certificate digital signature process is used to implement security authentication, and a shared session key is negotiated based on the Diffie-Hellman key distribution scheme to establish a secure channel on the secure channel. For the latter two communication phases, the corresponding secure channels are respectively established based on the traditional symmetric cryptography technology to realize communication security and confidentiality between multimedia terminals. Before the terminal accesses the network, there is no pre-shared secret with the network. There are two problems involved in achieving secure access to the terminal: one is the security confirmation of the user identity; the other is the key exchange, that is, between the terminal and the gatekeeper. The exchange of shared secrets or session keys is implemented through signaling interaction. The solution to these two problems is to introduce a digital certificate that represents the identity of the user. The digital certificate can effectively indicate the identity of the terminal, and the key exchange method can be implemented at the same time. The internal format of the digital certificate can be specified by CCITT X.509. It must contain the following information: the version number of the certificate; the serial number of the digital certificate; the name of the certificate owner; the signature algorithm; the unit that issued the digital certificate; The signature of the unit of the certificate; the validity period of the public key, etc. This information is called Certification Data. Referring to FIG. 1, a 接入.323 protocol-based terminal access method applied to a packet network according to the present invention includes the following steps: Step S102: A gatekeeper uses an elliptic curve public key certificate digital signature system to perform security authentication on an incoming terminal. And the call signaling channel session key generated by the negotiation with the incoming terminal is added to the signaling of the elliptic curve public key certificate digital signature, and sent to the incoming terminal, thereby establishing the first network access security channel; Step S104, calling The ingress terminal uses the pre-shared secret mechanism to perform security authentication through the call signaling channel session key, thereby establishing a second network access security channel with the receiving terminal; Step S106, the gatekeeper adopts an elliptic curve public key certificate digital signature system to the receiving terminal Performing security authentication, and adding the call signaling channel session key shared with the receiving terminal to the signaling of the elliptic curve public key certificate digital signature, and transmitting the signal to the receiving terminal, thereby establishing a third network access security channel; Step S108, The incoming terminal and the gatekeeper are based on the call signaling channel session key, and are accessed on the second network access security channel. The symmetric security mechanism establishes a call connection security channel; Step S110, on the call connection security channel, uses a symmetric cryptographic security mechanism to perform encryption algorithm and key negotiation for real-time media stream communication between the incoming terminal and the receiving terminal, thereby implementing media Real-time secure communication of the stream. As shown in FIG. 2, it is a call mode scenario diagram according to the method of the embodiment of the present invention, which illustrates that the method according to the embodiment of the present invention implements a terminal network security access process based on an elliptic curve public key certificate digital signature method, including signaling authentication, Security features such as integrity and non-compliance. The method of the embodiment of the present invention assumes that each node of the network has the public key certificate or the elliptic curve public key certificate of the communication party when the security access and the key agreement are completed in advance, and the specific steps are as follows:
(步骤 101 ) 终端 Α或 C使用信令 GRQ或 RRQ, 实施数字签名过 程: 居椭圆曲线证书给出的公共椭圆曲线算法集, 对 GRQ或 RRQ 中 相关用户认证信息进行设置, 终端 A或 C完成对信令消息的签名后将签 名嵌入 GRQ或 RRQ消息中发送给网守 B。 (Step 101) The terminal Α or C uses the signaling GRQ or RRQ to implement the digital signature process: the public elliptic curve algorithm set given by the elliptic curve certificate, and the related user authentication information in the GRQ or RRQ is set, and the terminal A or C is completed. After signing the signaling message, the signature is embedded in the GRQ or RRQ message and sent to the gatekeeper B.
(步骤 102 ) 网守 B在收到信令 GRQ或 RRQ消息后, 完成安全认 证过程, 在验证了签名本身计算的正确性后, 完成终端 A或 C的接入。 (Step 102) After receiving the signaling GRQ or RRQ message, the gatekeeper B completes the security authentication process, and after verifying the correctness of the calculation of the signature itself, completes the access of the terminal A or C.
(步骤 103 )完成终端网络安全接入后 , 终端 A向网守 B发出 ARQ 或 LRQ信令, 要求协商一个呼叫信令信道会话密钥。 (Step 103) After the terminal network security access is completed, the terminal A issues an ARQ to the gatekeeper B. Or LRQ signaling, requiring negotiation of a call signaling channel session key.
(步骤 104 ) 网守 B向终端 A回复 ACF或 LCF信令, 基于网络接 入 H.225.0 RAS信令过程中所安全交换的会话秘密, 采用 Diffie-Hellman 算法协商出一个呼叫信令信道会话密钥发送终端 A。 (Step 104) Gatekeeper B replies to ACF or LCF signaling to terminal A, and based on the session secret exchanged securely in the H.225.0 RAS signaling process, the Diffie-Hellman algorithm is used to negotiate a call signaling channel session secret. The key is sent to terminal A.
(步骤 105 )终端 A利用呼叫信令信道会话密钥, 采用预共享秘密 机制 H.245控制信道的安全认证, 与终端 C建立起一个安全信道。 (Step 105) Terminal A establishes a secure channel with terminal C by using the call signaling channel session key, using the pre-shared secret mechanism H.245 control channel security authentication.
(步驟 106 )终端 C向网守 B发出 ARQ或 LRQ信令, 要求传送网 守 B与终端 C协商的呼叫信令信道会话密钥。 (Step 106) Terminal C sends ARQ or LRQ signaling to Gatekeeper B, requesting the transmission of the Call Signalling Channel Session Key negotiated by Gatekeeper B with Terminal C.
(步骤 107 ) 网守 B向终端 C回复 ACF或 LCF信令, 将其与终端 A协商的呼叫信令信道会话密钥发送终端 C。 (Step 107) The gatekeeper B replies to the terminal C with ACF or LCF signaling, and transmits the call signaling channel session key negotiated with the terminal A to the terminal C.
(步骤 108 ) 网守 B与终端 C完成协商, 打开利用网守 B与终端 C 协商的加密算法与加密密钥等参数建立的媒体逻辑信道,使用实时传输协 议 /实时传输控制协议 ( RTP/RTCP ) 实现基于分组网络的媒体安全通信。 如图 3所示, 为根据本发明实施例所述终端接入时椭圆曲线数字签 名过程的流程图, 其步骤为: (Step 108) The gatekeeper B completes the negotiation with the terminal C, opens the media logical channel established by the encryption algorithm and the encryption key negotiated by the gatekeeper B and the terminal C, and uses the real-time transmission protocol/real-time transmission control protocol (RTP/RTCP). Implement packet-based network-based media security communications. As shown in FIG. 3, it is a flowchart of an elliptic curve digital signature process when a terminal accesses according to an embodiment of the present invention, and the steps are as follows:
(步驟 201 ) 居椭圆曲线证书给出的公共椭圆曲线算法集, 定义 一个系统参数集 D = (p, a, b, G, n, h)。其中 p为一个大的素整数(如 160bit 长), 指定了有限域 GF(p); a, b指定了曲线 E; G = (xG, yG)eE(GF(p))为 一个基点,素数 n为基点 G的阶; h = #E(GF(p))/n是协因子整数, #E(GF(p)) 表示椭圆曲线点群的阶。 (Step 201) A set of common elliptic curve algorithms given by the elliptic curve certificate, defining a system parameter set D = (p, a, b, G, n, h). Where p is a large prime integer (eg 160 bit long), specifying the finite field GF(p); a, b specifies the curve E; G = (x G , y G )eE(GF(p)) is a base point The prime number n is the order of the base point G; h = #E(GF(p))/n is a cofactor integer, and #E(GF(p)) represents the order of the elliptic curve point group.
(步骤 202 )对 GRQ或 RRQ中相关用户认证信息进行设置, 并放 入到一个以明文消息传输的令牌 ClearToken中, 包括序列随机数, 时戳, 4兆战数, 发送终端名, 接收网守名, 全信令签名或部分信令消息签名标记 等。 (Step 202) setting related user authentication information in the GRQ or RRQ, and putting it into a token ClearToken transmitted in a plaintext message, including a sequence random number, a time stamp, a 4 megabytes, a sending terminal name, and a receiving network. Namekeeping, full signaling signature or partial signaling message signature marking, etc.
(步骤 203 )基于安全策略决定是对 GRQ或 RRQ整个信令进行数 字签名还是只对部分消息进行数字签名, 并放入令牌 ClearToken 内的一 个字段内。 如设一个标记 tokenOip, 为 "A"表示全消息签名, "B"表示部 分消息签名。前者适于终端与网守之间物理上为相邻连接; 后者针对在终 端与网守之间存在 NAT/防火墙时, GRQ或 RRQ信令中间需要被修改之 情况。 (Step 203) It is determined based on the security policy whether the entire signaling of the GRQ or RRQ is digitally signed or only part of the message is digitally signed and placed in a field in the token ClearToken. If a token tokenOip is set, "A" indicates a full message signature, and "B" indicates a partial message signature. The former is suitable for the physical connection between the terminal and the gatekeeper; the latter is required to be modified between the GRQ or the RRQ signaling when there is a NAT/firewall between the terminal and the gatekeeper. Happening.
(步骤 204 )计算消息摘要, 并将其转换成一个整 ¾ e, 建立密钥对 (d, Q) , 其中 d是私钥, Q = dG是公钥; 向网守发送哈希函数, 椭圆曲线 参数 a、 b和公钥 Q。 (Step 204) Calculate the message digest and convert it into a whole 3⁄4 e, establish a key pair (d, Q), where d is the private key, Q = dG is the public key; send a hash function to the gatekeeper, ellipse Curve parameters a, b and public key Q.
(步骤 205 )使用哈希函数 SHA对可变长的信令消息进行运算生成 固定长度的消息摘要 e , 建立密钥对 (d, Q) , 其中 d是私钥, Q = dG是公 钥; 向网守发送哈希函数, 椭圆曲线参数 a、 b和公钥 Q。 (Step 205) Using the hash function SHA to operate the variable length signaling message to generate a fixed length message digest e, establishing a key pair (d, Q), where d is the private key and Q = dG is the public key; Send a hash function to the gatekeeper, elliptic curve parameters a, b, and public key Q.
(步驟 206 )选择一个随机或伪随机数 k, l<k<n - 1。 (Step 206) Select a random or pseudo-random number k, l < k < n - 1.
(步 207 )计算 kG = (xl 5 yi), r = X] mod n。 (Step 207) Calculate kG = (x l 5 yi), r = X] mod n.
(步驟 208 )如果 r = 0 , 则返回到步骤 206 , 重新对消息摘要进行计 算。 (Step 208) If r = 0, then return to step 206 to recalculate the message digest.
(步 209 )计算 s = k"】(e + dr) mod n。 (Step 209) Calculate s = k"](e + dr) mod n.
(步骤 210 )如果 s = 0, 则返回到步 206, 重新对消息摘要进行计 算。 (Step 210) If s = 0, then return to step 206 to recalculate the message digest.
(步骤 211 )终端完成对信令消息的签名为 (r, s), 并将该该签名嵌入 到 GRQ或 RRQ消息中并发送给网守 B。 如图 4所示, 为根据本发明 '实施例所述的网守脸证终端椭圆曲线数 字签名过程的流程图, 其具体步骤为: (Step 211) The terminal completes the signature of the signaling message as (r, s), and embeds the signature into the GRQ or RRQ message and sends it to the gatekeeper B. As shown in FIG. 4, it is a flowchart of the elliptic curve digital signature process of the gatekeeper terminal according to the embodiment of the present invention, and the specific steps are as follows:
(步骤 301 ) 网守 B猃证终端 A证书的合法性, 取出公共椭圆曲线 参数集 D = {p, a, b, G, n, h}与终端 A相关公钥 Q的授权拷贝。 (Step 301) The gatekeeper B authenticates the validity of the terminal A certificate, and takes out the public elliptic curve parameter set D = {p, a, b, G, n, h} and the authorized copy of the public key Q associated with the terminal A.
(步骤 302 ) 网守 B验证终端 A的签名 ( r, s )是否超过椭圆曲线基 点群阶的范围, 如果是, 则表示不合法的签名。 网守 B转到步骤 311 , 拒 绝终端 A的接入, 以 GRJ或 RRJ消息返回并说明相关拒绝接入安全方面 原因。 (Step 302) The gatekeeper B verifies whether the signature (r, s) of the terminal A exceeds the range of the elliptic curve base group level, and if so, indicates an illegal signature. The gatekeeper B goes to step 311 to reject the access of the terminal A, returns with the GRJ or RRJ message and explains the reason for the related denial of access security.
(步驟 303 )判断 tokenOID所指示的消息签名是对整个信令消息签 名还是只是消息的一部分签名。 (步驟 304 )生成整个信令消息签名的消息摘要 e。 (Step 303) It is judged whether the message signature indicated by the tokenOID is a signature on the entire signaling message or only a part of the message. (Step 304) Generate a message digest e of the entire signaling message signature.
(步骤 305 )生成部分信令消息签名的消息摘要 e。 (Step 305) Generating a message digest e of the partial signaling message signature.
(步骤 306 )分另' j计算 w = s - 1 mod n; = ew mod n; u2 = rw mod n; 及 X = u,G + u2Q = (xb 的值。 (Step 306) Calculate w = s - 1 mod n; = ew mod n; u 2 = rw mod n; and X = u, G + u 2 Q = (the value of x b ).
(步骤 307 ) 当 X的横坐标 Xl为 0时, 说明签名无效, 网守 B转到 步骤 31 1 , 拒绝终端 A的接入, 以 GRJ或 R J消息返回并说明相关拒绝 接入安全方面原因。 (Step 307) when the abscissa Xl X is 0, indicating invalid signature, gatekeeper 311 proceeds to step B, reject the access terminal A, or RJ GRJ message is returned to and the reasons for denying access related security.
(步骤 308 ) 当 X的横坐标 X!不等于 r时, 说明签名无效, 网守 B 转到步骤 31 1, 4巨绝终端 A的接人, 以 GRJ或 RRJ消息返回并说明相关 拒绝接入安全方面原因。 (Step 308) When the abscissa of X X! If it is not equal to r, the signature is invalid. Gatekeeper B goes to step 31 1, and the terminal A receives the GRJ or RRJ message and explains the related reasons for denying access security.
(步骤 309 )验证了签名本身计算的正确性后, 说明了消息签名没 有被中途窜改, 网守 B完成终端 A的接入认证。 本发明实施例方法利用 Diffie-Hellman 密钥协商算法, 完成终端 A 与网守 B的共享必密, 过程: ^下: 在安全接入网络的同时,终端 A与网守 B可以协商出一个共享秘密。 这通过在 ITU-T H.225.0 RAS信令 GRQ/GCF/GRJ或 R Q/RCF/RRJ中, 建立一个数据结构 dhKey {halfkey(gx) , modsize (素数模 p) , generator (乘法 群的生成元 g)}来实现。 在 GRQ或 RRQ信令中, 终端 A生成一个随机数 x, 进行相应的计 算, 放在消息内的 dhKey结构中, '然后将消息发给网守 B。 网守 B在接^:到 GRQ/RRQ消息后, 通过前面步驟对终端 A验证为 合法接入用户后, 随机生成一个秘密数 y , 并计算 (gx)y = gxy作为与终端 A 的共享秘密。 并在返回的 GCF RCF 信令中, 填写 dhKey 各字段为 {halfkey(gy) , modsize(p) , generator(g) }。 终端 A在接收到 GCF/RRQ以后, 与网守 B进行相同的计算, (gy)x = g x = gxy , 从而完成与网守 B共享秘密的协商与传输。 本发明实施例方法的呼叫信令信道(H.225.0 ) 与媒体控制信道的安 全接入(H.245控制协议)过程如下: 在完成终端网络安全接入后,可通过 ARQ/ACF或 LRQ/LCF信令交 互, 基于网 ^^入 H.225.0 RAS信令过程中所安全交换的会话秘密, 利用 对称密码技术实现安全认证 /完整性, 同时也可利用一个单独令牌 ClearToken中的 dhkey字段, 采用 Diffie-Hellman算法协商出一个呼叫信 令信道会话密钥。再利用此密钥, 采用预共享秘密机制 H.245控制信道的 安全认证, 并建立起一个安全信道。 在安全的 H.245信道上, 利用 H.245 协议所具有的安全能力交换规程,协商出多媒体终端通信双方进行媒体流 通信, 如视频或音频, 所支持的加密算法与加密密钥等参数, 并用前面的 会话密钥进行传输保护。 一旦协商完成, 即可在后面打开的媒体逻辑信道 中, 利用实时传输协议 /实时传输控制协议 ( RTP/RTCP ) 实现基于分组的 媒体通信的机密性。 如图 5所示, 为本发明实施例方法单网守路由直接呼叫模式下终端 安全接入协议流程图。 本实施例方案适用于 H.323 系统单网守管理范围的直接路由模式。 假设主 /被叫终端 A、 B 分别注册在相同网守上, 通讯过程是在没有安全 <!·生保证的 IP网络上进行。 实施本技术方案的前提是: 网守对其管理端点的所有 RAS消息进行 认证与完整性检查,端点对也对网守的 RAS消息进行认证与完整性检查, 从而使端点和所属网守之间达到相互信任目的, 以便能检查出欺诈的实 体, 并将被欺作可能性降到最小, 并以此为基础实现呼叫信令的安全性。 每一个 RAS/H.225.0信令消息中, 有一个专门的数据结构, 来描述 不同实体(网守, 端点)通信所采用的安全机制。 基于公钥证书数字签名 安全机制, 其数据结构名为 cryptoToken, 可用于描述利用椭圆曲线公钥 证书的数字签名实现 H.323 系统 的终端安全接入。 其字段可作如下设 置: tokenOID: 设为" A"表示对整个 H.225.0 RAS信令消息, 如实施认证 /完整性 /不可否认性计算,可用于物理上为相邻连接的实体安全场合。 "B" 表示仅对 H.225.0 RAS消息中一个子集进行认证与不可抵赖计算,用于跨 越 NAT/防火墙引起信令消息修改的端到端安全场合。 token: 为待签名并存放结果的子数据结构, 其中: toBeSigned:存放整个信令消息签名或仅签名一个相关认证信息的令 牌 ClearToken。 (Step 309) After verifying the correctness of the calculation of the signature itself, it indicates that the message signature has not been tampered with, and the gatekeeper B completes the access authentication of the terminal A. The method of the embodiment of the present invention uses the Diffie-Hellman key agreement algorithm to complete the sharing of the terminal A and the gatekeeper B. The process is as follows: ^: While the network is securely connected, the terminal A and the gatekeeper B can negotiate a sharing. secret. This is done by creating a data structure dhKey {halfkey(g x ) , modsize (prime modulus p) , generator (multiplication group generation) in ITU-T H.225.0 RAS Signaling GRQ/GCF/GRJ or RQ/RCF/RRJ Yuan g)} to achieve. In GRQ or RRQ signaling, terminal A generates a random number x, performs corresponding calculations, puts it in the dhKey structure in the message, and then sends the message to gatekeeper B. After the gatekeeper B receives the GRQ/RRQ message, after verifying the terminal A as a legitimate access user through the previous steps, it randomly generates a secret number y and calculates (g x ) y = g xy as the terminal A. Share secrets. And in the returned GCF RCF signaling, fill in the dhKey fields as {halfkey(g y ) , modsize(p) , generator(g) }. After receiving the GCF/RRQ, the terminal A performs the same calculation as the gatekeeper B, (g y ) x = g x = g xy , thereby completing the negotiation and transmission of the shared secret with the gatekeeper B. The process of the call signaling channel (H.225.0) and the secure access of the media control channel (H.245 Control Protocol) of the method of the embodiment of the present invention is as follows: After the terminal network security access is completed, the ARQ/ACF or LRQ/LCF signaling can be used to interact, and the session secrets securely exchanged in the H.225.0 RAS signaling process can be used to implement the security authentication using symmetric cryptography. Integrity, the dhkey field in a single token ClearToken can also be used to negotiate a call signaling channel session key using the Diffie-Hellman algorithm. Reusing this key, using the pre-shared secret mechanism H.245 control channel security authentication, and establish a secure channel. On the secure H.245 channel, the security capability exchange procedure of the H.245 protocol is used to negotiate the parameters of the media stream communication, such as video or audio, supported encryption algorithms and encryption keys, by the communication terminal of the multimedia terminal. And use the previous session key for transmission protection. Once the negotiation is completed, the confidentiality of packet-based media communication can be realized by the Real-Time Transport Protocol/Real-Time Transport Control Protocol (RTP/RTCP) in the media logical channel that is opened later. As shown in FIG. 5, it is a flowchart of a terminal security access protocol in a single-gateway direct call mode according to an embodiment of the present invention. The solution in this embodiment is applicable to the direct routing mode of the single-gatekeeper management scope of the H.323 system. Assume that the master/called terminals A and B are respectively registered on the same gatekeeper, and the communication process is performed on an IP network without security guarantees. The premise of implementing the technical solution is: the gatekeeper performs authentication and integrity check on all RAS messages of the management endpoint, and the endpoint pair also performs authentication and integrity check on the RAS message of the gatekeeper, so that the endpoint and the associated gatekeeper are reached. The purpose of mutual trust is to be able to detect fraudulent entities and minimize the possibility of being bullied, and to implement call signaling security based on this. Each RAS/H.225.0 signaling message has a dedicated data structure that describes the security mechanisms used by different entities (gatekeepers, endpoints) for communication. Based on the public key certificate digital signature security mechanism, its data structure is called cryptoToken, which can be used to describe the terminal secure access of the H.323 system by using the digital signature of the elliptic curve public key certificate. The fields can be set as follows: tokenOID: Set to "A" to indicate that the entire H.225.0 RAS signaling message, such as implementing authentication/integrity/non-repudiation calculations, can be used for physical security occasions that are physically connected. "B" indicates that only a subset of the H.225.0 RAS messages are authenticated and non-repudiation-calculated for end-to-end security occasions that cause signaling message modification across the NAT/firewall. Token: is the subdata structure to be signed and stores the result, where: toBeSigned: A token ClearToken that stores the entire signaling message signature or only one associated authentication information.
AlgorithmOID: 向接收实体指明采用的签名算法, 如设为 "V"表示本 发明给出的签名算法。 signature签名 {r, s}.依赖于 tokenOID值, 决定是对整个信令还是仅 对 toBeSigned进行数字签名。 签名的明文令牌 ClearToken , 包含下述字段集: tokenOID: 设为" S", 表明 ClearToken正在被用作认证 /完整性 /不可 抵赖性信息; "R"表示用作认证 /不可抵赖安全, 用于跨越 NAT/防火墙的 端到端场合。 challenge: 4 战数, 用于三 握手认证协议。 random: 一单调递增顺序号, 在时戳粒度不够情况下, 保证其为唯 AlgorithmOID: Indicates the signature algorithm used by the receiving entity, such as "V" to indicate the signature algorithm given by the present invention. Signature signature {r, s}. Depending on the tokenOID value, the decision is whether to digitally sign the entire signaling or only toBeSigned. The signed plaintext token ClearToken contains the following set of fields: tokenOID: set to "S", indicating that ClearToken is being used as authentication/integrity/non-repudiation information; "R" indicates use as authentication/non-repudiation security, For end-to-end applications across NAT/firewalls. Challenge: 4 battles, used for three handshake authentication protocols. Random: a monotonically increasing sequence number. When the timestamp granularity is insufficient, guarantee that it is only
generallD: 接受实体标识符; sendersID: 发送实体标识符; dhkey: 用于连接建立及后面媒体流加密时, 采用 Diffie-Hellman算 法, ¼、商会话密钥, 结构为 {halfkey ( gx ), midsize (素数模 p), generator (乘法群的生成元 g )。 certificate: 发送方数字签名证书, 内含 ECC范围参数 D与发送实体 公钥 Q。 其中 type域指的是证书算法类型: 如设为 "V", 表示使用椭圆曲 线密码结合 SHA-1算法进行数字签名。 当发送终端在信令消息 (如 GRQ, RRQ ), 按上述方法设置数据结 构, 并完成相应签名运算后, 发送给网守 B。 接收实体收到该信令消息后, 立刻检验发给它的那些 tokenOID所指 示的签名, 完成安全认证过程。 具体过程可基于以下几个标准: 通过对 generallD身份与自己的识符比较,来验证发送者是否为一个 合法用户; 验证 SendersID是否与证书内一致及是否具有相应的访问权限; 消息签名是否与自身验证计算的签名相匹配, 以验证消息是否被中 途窜改; 通过对接收到的证书的检验 , 验证发送实体是否为合法注册实体及 电子商务中的不可否认性。 在验证了发送实体合法性后, 可利用 dhkey中指明的 Diffie-Hellman 密钥协商算法, 在返回的响应消息(GCF, RCF ) 中, 完成会话密钥的协 商与交换。 本实施例的具体步驟是: generallD: accept entity identifier; sendersID: send entity identifier; dhkey: used for connection establishment and subsequent media stream encryption, using Diffie-Hellman algorithm, 1⁄4, business session key, structure is {halfkey ( gx ), midsize ( Prime modulus p), generator (the generator g of the multiplicative group). Certificate: The sender's digital signature certificate, which contains the ECC range parameter D and the sending entity public key Q. The type field refers to the type of certificate algorithm: If set to "V", it means that the elliptic curve password is combined with the SHA-1 algorithm for digital signature. When the sending terminal is in a signaling message (such as GRQ, RRQ), the data structure is set as described above, and the corresponding signature operation is completed, and then sent to the gatekeeper B. After receiving the signaling message, the receiving entity immediately checks the signatures indicated by the tokenOIDs sent to it, and completes the security authentication process. The specific process can be based on the following criteria: Verify that the sender is a one by comparing the generallD identity with its own identity. A valid user; verify that the sendersID is consistent with the certificate and has the corresponding access rights; whether the message signature matches the signature of the self-verification calculation to verify whether the message has been tampered with; and verify the sending entity by checking the received certificate Whether it is a legally registered entity and non-repudiation in e-commerce. After verifying the validity of the sending entity, the Diffie-Hellman key negotiation algorithm specified in dhkey can be used to complete the negotiation and exchange of the session key in the returned response message (GCF, RCF). The specific steps of this embodiment are:
(步據 401 )终端 A或 C将挑战数 challengeA放入 ClearToken内的 challenge字段, generallDA表示终端 C的标识符。 后面的各字段标识中, 下标 A、 B、 C分别表示终端 A、 C与网守 B的标识, 英文单词名分别代 表相应的字段。 (Step 401) The terminal A or C puts the challenge number challengeA into the challenge field in the ClearToken, and the generallDA indicates the identifier of the terminal C. In the following field identifiers, subscripts A, B, and C represent the identifiers of terminals A, C, and gatekeeper B, respectively, and the English word names represent the corresponding fields.
(步骤 402 ) 网守 B收到终端 A网守发现请求信令后, 根据终端 A 名称及本地安全策略确定采用数字签名来实施与终端 A之间的安全认证, 保证终端 A的安全接入。其中:序列随机数 randomB与^ L战数 challengeB 二者组合要保证唯一,防止对信令的重放攻击, DhB包含为 gx值。 {}SignB 表示对 {}内的值的数字签名, 假定为部分信令消息数字签名。 Certificate 存放网守 B的实际椭圆曲线证书。 (Step 402) After receiving the terminal A gatekeeper discovery request signaling, the gatekeeper B determines that the digital signature is used to implement the security authentication with the terminal A according to the terminal A name and the local security policy, so as to ensure the secure access of the terminal A. Among them: sequence random number randomB and ^ L battle number challengeB The combination of the two should be guaranteed to be unique, to prevent replay attacks on signaling, DhB contains gx value. {}SignB represents a digital signature of the value in {}, assuming a partial signature of the signaling message. Certificate Stores the actual elliptic curve certificate for gatekeeper B.
(步骤 403 )终端 A得到网守 B的响应消息 GCF后, 对网守 B内 的椭圆曲线证书进行合法性验证,同时验证所接收的 challengeA是否与发 送时相等, 如果相等, 配合其它认证规则说明网守 B 为合法网守, 则进 行 RRQ 消息的相关设置: 重新生成序列随机数 randomA (如对收到的 randomB进行增量相加形成)与 4 战数 challengeA (此处值与 GRQ中的 不是同一个值)并保证二者组合为唯一。 DhA 包含为 gy值。 Certificate 存放终端 A的实际椭圆曲线证书。 (Step 403) After obtaining the response message GCF of the gatekeeper B, the terminal A performs the validity verification on the elliptic curve certificate in the gatekeeper B, and verifies whether the received challengeA is equal to the sending time. If they are equal, the other authentication rules are used. If the gatekeeper B is a legal gatekeeper, the related settings of the RRQ message are performed: Regenerate the sequence random number randomA (such as the incremental addition of the received randomB) and the 4 battle number challengeA (where the value is not in the GRQ) The same value) and ensure that the combination is unique. DhA contains the value of gy. Certificate Stores the actual elliptic curve certificate for terminal A.
(步骤 404 ) 网守 B收到终端 A注册请求( RRQ )信令后, 根据本 地安全策略确定采用一种对称密码认证算法, 如基于对称密钥加密, 共享 秘密 +散列算法等 ITU-T H.235协议所规范说明的协议算法。 其共享秘密 为前面信令交换过程中, 通过 Diffie-Hellman协议导出的 gxy所生成。 为 了让终端 A验证所协商的共享秘密, 网守 B在一个单独的令牌, 根据确 定的对称密码算法,如下验证运算 ClearToken [...sendersIDB, ({generallDA XOR randomA XOR ...}EDH-secret)...] , 其中 EDH-secret 表示通过 Diffie-Hellman协议导出的共享秘寧。 (Step 404) After receiving the Terminal A Registration Request (RRQ) signaling, the Gatekeeper B determines to adopt a symmetric password authentication algorithm according to the local security policy, such as based on symmetric key encryption, sharing. Protocol algorithm as specified by the ITU-T H.235 protocol, such as the secret + hash algorithm. The shared secret is generated by the gxy derived from the Diffie-Hellman protocol in the previous signaling exchange process. In order for terminal A to verify the shared secret negotiated, gatekeeper B is on a separate token. According to the determined symmetric cryptographic algorithm, the following operation is performed ClearToken [...sendersIDB, ({generallDA XOR randomA XOR ...}EDH- Secret)...] , where EDH-secret represents the shared secrets exported by the Diffie-Hellman protocol.
(步骤 405 )完成终端网络安全接入后, 终端 A向网守 B发出 ARQ 信令,基于网络接入过程中所安全交换的会话密钥, 利用对称密码技术实 现安全认证 /完整性, 同时也可利用一个单独令牌 ClearToken 中的 dhkey 字段, 采用 Diffie-Hellman算法为多媒体终端之间的通信协商出一个呼叫 信令信道会话密钥。 (Step 405) After the terminal network security access is completed, the terminal A sends the ARQ signaling to the gatekeeper B, and uses the symmetric crypto technology to implement the security authentication/integrity based on the session key exchanged securely in the network access process. The Diffie-Hellman algorithm can be used to negotiate a call signaling channel session key for communication between multimedia terminals using the dhkey field in a single token ClearToken.
(步骤 406 )网守 B向终端 A返回 ACF信令, 返回协商出的呼叫信 令信道会话密钥。 (Step 406) Gatekeeper B returns ACF signaling to terminal A, and returns the negotiated call signaling channel session key.
(步骤 407 ) 终端 A利用此呼叫信令信道会话密钥, 采用预共享秘 密机制实现呼叫信令信道与 H.245控制信道的安全认证,并建立起一个安 全信道。 (Step 407) Terminal A uses the call signaling channel session key to implement secure authentication of the call signaling channel and the H.245 control channel by using a pre-shared secret mechanism, and establishes a secure channel.
(步驟 408 ) 网守 B向终端 回应完成建立 H.245安全信道的回应 信息。 (Step 408) The gatekeeper B responds to the terminal with the response information for completing the establishment of the H.245 secure channel.
(步驟 409 )终端 C在安全的 H.245信道上, 向网守 B发出 ARQ信 令,要求利用 H.245协议所具有的安全能力交换规程, 协商出多媒体终端 通信双方进行媒体流通信, 如视频或音频, 所支持的加密算法与加密密钥 等参数。 (Step 409) The terminal C sends ARQ signaling to the gatekeeper B on the secure H.245 channel, and requests to use the security capability exchange procedure of the H.245 protocol to negotiate the media stream communication between the two parties of the multimedia terminal, such as Video or audio, supported encryption algorithms and encryption keys and other parameters.
(步驟 410 )网守 B通过信令 ACF向终端 C返回协商后多媒体终端 通信的加密算法与加密密钥等参数。 (Step 410) The gatekeeper B returns the parameters of the encryption algorithm and the encryption key of the communication of the multimedia terminal after negotiation to the terminal C through the signaling ACF.
(步骤 411 ) 网守 B将与终端 C协商的多媒体终端通信的加密算法 与加密密钥等参数发送给终端 A, 媒体逻辑信道建立完成。 (Step 411) The gatekeeper B sends the encryption algorithm and the encryption key and other parameters of the multimedia terminal communication negotiated by the terminal C to the terminal A, and the media logical channel is established.
(步骤 412 ) 端 C在媒体逻辑信道中, 利用实时传输协议 /实时传输 控制协议(RTP/RTCP ) 实现基于分组的媒体安全通信。 本发明方法所采用的椭圆曲线密码体制在已知公钥密码系统中具有 每比特最高强度安全性, 最快的处理速度和最低的开销, 特别适用于具有 低内存与低处理能力的 H.323多媒体终端实现网络安全接入。 随着大规模 H.323 多媒体通信系统的布署与应用, 如全球范围的 VoIP网或国家范围面向公众的视频会议 /可视电话系统等, 本发明所提出 的安全接入方法可用于各运营商采用, 也可用于不同运营商之间互联。 以上所述仅为本发明的优选实施例而已, 并不用于限制本发明, 对 于本领域的技术人员来说, 本发明―可以有各种更改和变化。 凡在本发明的 精神和原则之内, 所作的任何修改、 等同替换、 改进等, 均应包含在本发 明的保护范围之内。 (Step 412) Terminal C implements packet-based media secure communication using a Real-Time Transport Protocol/Real-Time Transport Control Protocol (RTP/RTCP) in the media logical channel. The elliptic curve cryptosystem employed in the method of the present invention has a known public key cryptosystem The highest strength security per bit, the fastest processing speed and the lowest overhead, especially suitable for H.323 multimedia terminals with low memory and low processing capability to achieve network security access. With the deployment and application of large-scale H.323 multimedia communication systems, such as a global VoIP network or a national-wide video conferencing/visual telephone system, the secure access method proposed by the present invention can be used for various operations. It can also be used to interconnect between different operators. The above description is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and the present invention may be variously modified and changed. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Claims

权利要求书 一种应用于分组网络的基于 H.323协议的终端接入方法, 其特征在 于, 包括以下步骤: Claims A H.323 protocol-based terminal access method for a packet network, characterized in that it comprises the following steps:
步骤 S 102 , 网守采用椭圆曲线公钥证书数字签名体制对呼入 终端进行安全认证, 并将与所述呼入终端协商生成的呼叫信令信道 会话密钥加入椭圆曲线公钥证书数字签名的信令中, 并发送至所述 呼入终端, 从而建立第一网络接入安全信道;  Step S102: The gatekeeper uses the elliptic curve public key certificate digital signature system to perform security authentication on the incoming terminal, and adds the call signaling channel session key generated by the negotiation with the incoming terminal to the digital signature of the elliptic curve public key certificate. In the signaling, and sent to the incoming terminal, thereby establishing a first network access security channel;
步骤 S104, 所述呼入终端通过所述呼叫信令信道会话密钥, 采用预共享秘密机制进行安全认证, 从而与接收终端建立第二网络 接入安全信道;  Step S104: The inbound terminal uses the pre-shared secret mechanism to perform security authentication by using the call signaling channel session key, so as to establish a second network access security channel with the receiving terminal.
步骤 S106, 所述网守采用椭圆曲线公钥证书数字签名体制对 所述接收终端进行安全认证, 并将与所述接收终端共享的所述呼叫 信令信道会话密钥加入椭圓曲线公钥证书数字签名的信令中, 并发 送至所述接收终端, 从而建立第三网络接入安全信道;  Step S106: The gatekeeper performs security authentication on the receiving terminal by using an elliptic curve public key certificate digital signature system, and adds the call signaling channel session key shared by the receiving terminal to an elliptic curve public key certificate. The signaling of the digital signature is sent to the receiving terminal, thereby establishing a third network access security channel;
步骤 S108 , 所述呼入终端和所述网守基于所述呼叫信令信道 会话密钥, 在所述第二网络接入安全信道上, 采用对称密码安全机 制建立呼叫连接安全信道;  Step S108: The inbound terminal and the gatekeeper establish a call connection security channel by using a symmetric cryptographic security mechanism on the second network access security channel based on the call signaling channel session key.
步骤 S110, 在所述呼叫连接安全信道上, 采用对称密码安全 机制为所述呼入终端和所述接收终端之间的实时媒体流通信进行 加密算法和密钥协商, 从而实现媒体流的实时安全通信。 根据权利要求 1 所述的终端接入方法, 其特征在于, 在步骤 S102 中, 通过 Diffie-Hellman密钥分配方案协商生成所述呼叫信令信道 会话密钥。 根据权利要求 1 所述的终端接入方法, 其特征在于, 在步骤 S102 和步骤 S 106 中, 所述网守采用椭圆曲线公钥证书数字签名体制对 终端进行安全认证的步骤包括以下步骤:  Step S110: Perform a encryption algorithm and key negotiation on the call connection security channel for real-time media stream communication between the incoming terminal and the receiving terminal by using a symmetric cryptographic security mechanism, thereby realizing real-time security of the media stream. Communication. The terminal access method according to claim 1, wherein in step S102, the call signaling channel session key is negotiated by a Diffie-Hellman key distribution scheme. The terminal access method according to claim 1, wherein in step S102 and step S106, the step of the gatekeeper performing security authentication on the terminal by using an elliptic curve public key certificate digital signature system comprises the following steps:
a. 居椭圆曲线公钥证书给出的公共椭圆曲线算法集, 定义 一个系统参数集0 = ( p, a, b, G, n, h ), 其中 p为一个大于 160bit 的素整数, 指定有限域 GF ( p ); a, b指定曲线 E; G = ( xG, yG ) EE(GF(p))为一个基点; 素数 n为基点 G的阶; h = #E ( GF ( p ) ) /n为协因子整数; #E (GF (p))表示椭圆曲线点群的阶; a set of common elliptic curve algorithms given by the elliptic curve public key certificate, defining a system parameter set 0 = ( p, a, b, G, n, h ), where p is a prime integer greater than 160 bits, with a specified number of Domain GF ( p ); a, b specifies curve E; G = ( xG, yG ) EE(GF(p)) is a base point; prime number n is the order of base point G; h = #E ( GF ( p ) ) /n is a cofactor integer; #E (GF (p)) represents the elliptic curve point group Order
b. 对信令中序列随机数、 时戳、 挑战数、 发送终端名、 接收 网守名、 全信令签名或部分信令消息签名标记进行设置, 并放入一 个明文消息令牌中;  b. setting a sequence random number, a time stamp, a challenge number, a sending terminal name, a receiving gatekeeper name, a full signaling signature, or a partial signaling message signature flag in the signaling, and putting it into a plaintext message token;
c 基于不同安全策略决定是对整个信令进行数字签名还是只 对信令消息的一部分, 并放入明文消息令牌中;  c Deciding whether to digitally sign the entire signaling or only part of the signaling message based on different security policies and put it in a plaintext message token;
d. 选择安全哈希函数, 使用哈希函数对部分消息进行数字签 名的信令消息进行运算, 生成固定长度的消息摘要;  d. Select a secure hash function, and use a hash function to perform a digitally signed signaling message on a part of the message to generate a message summary of a fixed length;
e. 建立密钥对(d, Q), 其中 d是私钥, Q = dG是公钥; 向 网守发送哈希函数, 椭圆曲'线参数 a, b和公钥 Q;  e. Establish a key pair (d, Q), where d is the private key, Q = dG is the public key; send a hash function to the gatekeeper, elliptic curve 'line parameters a, b and public key Q;
f. 选择一个随机或伪随机数 k, l<k<n- 1;  f. Select a random or pseudo-random number k, l<k<n- 1;
g. 计算 kG= (xl, yl), r = xl modn, 口果 r = 0, 贝' J返回步 骤 f; 计算 s = k- 1 (e + dr) modn, 如果 s = 0, 则送回步 f; h. 呼入终端完成对信令消息的签名 (r, s), 并将该签名嵌入 到信令消息中并发送给网守;  g. Calculate kG= (xl, yl), r = xl modn, mouth r = 0, shell ' J returns to step f; calculate s = k - 1 (e + dr) modn, if s = 0, send back Step f; h. The incoming terminal completes the signature (r, s) of the signaling message, and embeds the signature into the signaling message and sends it to the gatekeeper;
i. 网守取出公共椭圆曲线参数集 D = {p, a, b, G, n, h}与 终端相关公钥 Q的授权拷贝, 验证终端的签名 (r, s)是否超过椭 圆曲线基点群阶的范围, 如果是, 则表示为不合法的数字签名, 拒 绝终端的接入;  i. The gatekeeper takes out the public elliptic curve parameter set D = {p, a, b, G, n, h} and the authorized copy of the terminal-related public key Q, and verifies whether the signature (r, s) of the terminal exceeds the elliptic curve base point group. The range of the order, if it is, is represented as an illegal digital signature, denying access to the terminal;
j. 如果终端的签名(r, s)没有超过椭圓曲线基点群阶的范围, 网守判断消息签名是对整个信令消息签名还是只是消息的部分签 名,并随后生成不同的消息 要6;计算 w = s— 1 modn,ul = ew mod n, u2 = rwmodn, 及 X = ulG + u2Q= (xl, yl ) 的值; 当 xl为 0 或不等于 r时, 说明签名无效, 拒绝终端的接入;  j. If the signature (r, s) of the terminal does not exceed the range of the elliptic curve base point group, the gatekeeper determines whether the message signature is to sign the entire signaling message or just a partial signature of the message, and then generate a different message 6; Calculate the value of w = s - 1 modn, ul = ew mod n, u2 = rwmodn, and X = ulG + u2Q = (xl, yl ); when xl is 0 or not equal to r, the signature is invalid, rejecting the terminal Access
k. 当 xl等于 r且不等于 0时, 验证签名本身计算的正确性, 网守完成对终端的接入认证。  k. When xl is equal to r and not equal to 0, the correctness of the calculation of the signature itself is verified, and the gatekeeper completes the access authentication to the terminal.
4. 根据权利要求 3所述的终端接入方法, 其特征在于, 在步 中, 基于不同安全策略决定是对整个信令进行数字签名还是只对部分 消息进行数字签名的步骤包括: 如果所述终端与所述网守之间物理 上为相邻连接, 则对整个信令进行数字签名; 如果所述终端与所迷 网守之间存在防火墙, 则只对部分消息进行数字签名。 The terminal access method according to claim 3, wherein, in the step, the step of determining whether to digitally sign the entire signaling or only partially signing the partial signaling based on different security policies comprises: If the terminal is physically adjacent to the gatekeeper, the entire signaling is digitally signed; if the terminal is confused with the There is a firewall between the gatekeepers, and only some messages are digitally signed.
5. 根据权利要求 1所述的终端接入方法, 其特征在于, 数字签名的数 字证书内部格式由 CCITT X.509规定,其内容包括选自包括以下内 容的组: 证书的版本号、 数字证书的序列号、 证书拥有者的姓名、 签名算法、 颁发数字证书的单位、 颁发数字证书的单位的签名、 以 及公开密钥的有效期。 5. The terminal access method according to claim 1, wherein the digitally signed digital certificate internal format is specified by CCITT X.509, and the content thereof is selected from the group consisting of: a version number of the certificate, a digital certificate The serial number, the name of the certificate owner, the signature algorithm, the unit that issued the digital certificate, the signature of the unit that issued the digital certificate, and the expiration date of the public key.
6. 根据权利要求 1所述的终端接入方法, 其特征在于, 所述网守通过 脸证呼入终端时间戳的生存期和随机序列值的唯一性来抵御拒绝 服务攻击。 The terminal access method according to claim 1, wherein the gatekeeper defends against the denial of service attack by the lifetime of the time stamp incoming call terminal and the uniqueness of the random sequence value.
7. 根据权利要求 1所述的终端接入方法, 其特征在于, 所述网守通过 对接收终端身份与自己标识符比较来-险证所述接收终端是否为合 法用户。 The terminal access method according to claim 1, wherein the gatekeeper compares the identity of the receiving terminal with its own identifier to determine whether the receiving terminal is a legitimate user.
8. 根据权利要求 1所述的终端接入方法, 其特征在于, 所述网守验证 所述呼入终端的标识符是否与其证书内身份标识符一致及是否具 有相应的访问权限。 The terminal access method according to claim 1, wherein the gatekeeper verifies whether the identifier of the incoming terminal is consistent with an identity identifier in the certificate and has a corresponding access right.
9. 根据权利要求 2所述的终端接入方法, 其特征在于, 在步骤 S102 中, 通过 Diffie-Hellman密钥分配方案协商生成所述呼叫信令信道 会话密钥的步驟包括以下步骤: The terminal access method according to claim 2, wherein in step S102, the step of generating the call signaling channel session key by using a Diffie-Hellman key distribution scheme comprises the following steps:
a. 所述呼入终端在信令中, 建立一个数据单元 dhKey{halfkey ( gx ), modsize (素数模 ), generator (乘法群的生成元 g ) }; 所 述呼入终端生成一个随机数 X, 进行相应的计算后发给所述网守; b. 所述网守接收到信令消息后, 随机生成一个秘密数 y , 并 计算( gx ) y = gxy作为与所述呼入终端的共享会话密钥 , 在返回的 信令中,填写数据单元各字段 {halfkey ( gy ), modsize ( p ), generator a. The incoming terminal establishes a data unit dhKey{halfkey(gx), modsize (gene modulus), generator (generating element g of the multiplicative group) in the signaling; the incoming terminal generates a random number X After the corresponding calculation is performed, the gatekeeper is sent to the gatekeeper; b. after receiving the signaling message, the gatekeeper randomly generates a secret number y, and calculates (gx) y = gxy as the sharing with the incoming terminal. Session key, in the returned signaling, fill in the data unit fields {halfkey ( gy ), modsize ( p ), generator
( g ) } ; ( g ) } ;
c. 所述呼入终端在接收到信令后, 与所述网守进行相同的计 算, (gy ) x = gyx = gxy, 完成与所述网守共享会话密钥。  c. After receiving the signaling, the incoming terminal performs the same calculation as the gatekeeper, (gy) x = gyx = gxy, and completes sharing the session key with the gatekeeper.
10. 根据权利要求 1 所述的终端接入方法, 其特征在于, 在步骤 S110 中,在所述呼叫连接安全信道上,利用所述呼叫信令信道会话密钥, 采用预共享 、密机制实现 H.245控制信道的安全认证, 建立连接控 制安全信道; 在所述连接控制安全信道上, 利用 H.245协议所具有 的安全能力交换规程, 协商出所述呼入终端与所述接收终端进行媒 体流通信所支持的加密算法和加密密钥, 并用所述呼叫信令信道会 话密钥进 4亍传输保护。 ' The terminal access method according to claim 1, wherein in step S110, using the call signaling channel session key on the call connection secure channel, using a pre-sharing and secret mechanism H.245 control channel security authentication, establish connection control a security channel; on the connection control security channel, using the security capability exchange procedure of the H.245 protocol, negotiating an encryption algorithm and encryption secret supported by the incoming terminal and the receiving terminal for media stream communication Key, and use the call signaling channel session key to transmit protection. '
11. 根据权利要求 1所述的终端接入方法, 其特征在于, 所述网守对终 端的安全接入包括以下至少之一: 机密性、 身份性认证、 完整性认 证、 及不可 4氏赖性认证。 The terminal access method according to claim 1, wherein the secure access of the gatekeeper to the terminal comprises at least one of the following: confidentiality, identity authentication, integrity authentication, and Sexual certification.
PCT/CN2006/003100 2005-12-27 2006-11-17 Terminal access method based on h.323 protocol applied to packet network WO2007073659A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200510132289.3 2005-12-27
CNB2005101322893A CN100461670C (en) 2005-12-27 2005-12-27 H.323 protocol-based terminal access method for packet network

Publications (1)

Publication Number Publication Date
WO2007073659A1 true WO2007073659A1 (en) 2007-07-05

Family

ID=38214560

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2006/003100 WO2007073659A1 (en) 2005-12-27 2006-11-17 Terminal access method based on h.323 protocol applied to packet network

Country Status (2)

Country Link
CN (1) CN100461670C (en)
WO (1) WO2007073659A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113923029A (en) * 2021-10-11 2022-01-11 广东天镝科技有限公司 Internet of things information encryption method based on ECC (error correction code) hybrid algorithm
CN114978648A (en) * 2022-05-13 2022-08-30 武汉珈港科技有限公司 Offline secure communication method between cloud and chip
CN117834138A (en) * 2024-03-04 2024-04-05 北卡科技有限公司 Key negotiation method, system, equipment and medium suitable for instant messaging

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101222503A (en) * 2008-01-25 2008-07-16 中兴通讯股份有限公司 Safety parameter generating method and device for implementing media stream safety
CN101286840B (en) * 2008-05-29 2014-07-30 西安西电捷通无线网络通信股份有限公司 Key distributing method and system using public key cryptographic technique
US9467283B2 (en) 2013-06-24 2016-10-11 Blackberry Limited Securing method for lawful interception
DE102013019870B4 (en) * 2013-11-28 2019-08-08 Friedrich Kisters Authentication and / or identification method in a communication network
CN106850520A (en) * 2016-04-18 2017-06-13 中国科学院信息工程研究所 A kind of implementation method for encrypting voice conferencing
EP3273635B1 (en) * 2016-07-20 2019-10-30 Mastercard International Incorporated Secure channel establishment
CN107426625B (en) * 2017-06-16 2020-06-16 上海好想法网络科技有限公司 Mode identification multimedia information encryption communication system
CN109194905B (en) * 2018-11-05 2021-09-10 苏州科达科技股份有限公司 Video conference connection encryption and establishment method, terminal, server and system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040114760A1 (en) * 2002-09-03 2004-06-17 Brown Daniel R.L. Method and apparatus for performing validation of elliptic curve public keys
CN1652499A (en) * 2004-02-07 2005-08-10 华为技术有限公司 Method for implementing information transmission

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1108041C (en) * 1999-12-01 2003-05-07 陈永川 Digital signature method using elliptic curve encryption algorithm
CN100379231C (en) * 2003-10-21 2008-04-02 西安西邮双维通信技术有限公司 A multimedia communication safe proxy gateway and safety proxy method

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040114760A1 (en) * 2002-09-03 2004-06-17 Brown Daniel R.L. Method and apparatus for performing validation of elliptic curve public keys
CN1652499A (en) * 2004-02-07 2005-08-10 华为技术有限公司 Method for implementing information transmission

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"DRAFT ITU-T Recommendation H.323", ITU, 28 May 1996 (1996-05-28), pages 14 - 15 *
"IUT-T Recommendation H.235.0", ITU, 31 August 2005 (2005-08-31) *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113923029A (en) * 2021-10-11 2022-01-11 广东天镝科技有限公司 Internet of things information encryption method based on ECC (error correction code) hybrid algorithm
CN113923029B (en) * 2021-10-11 2024-04-05 广东天镝科技有限公司 Internet of things information encryption method based on ECC (error correction code) hybrid algorithm
CN114978648A (en) * 2022-05-13 2022-08-30 武汉珈港科技有限公司 Offline secure communication method between cloud and chip
CN114978648B (en) * 2022-05-13 2024-03-29 武汉珈港科技有限公司 Cloud and chip off-line secure communication method
CN117834138A (en) * 2024-03-04 2024-04-05 北卡科技有限公司 Key negotiation method, system, equipment and medium suitable for instant messaging
CN117834138B (en) * 2024-03-04 2024-05-24 北卡科技有限公司 Key negotiation method, system, equipment and medium suitable for instant messaging

Also Published As

Publication number Publication date
CN1992593A (en) 2007-07-04
CN100461670C (en) 2009-02-11

Similar Documents

Publication Publication Date Title
WO2007073659A1 (en) Terminal access method based on h.323 protocol applied to packet network
US6996716B1 (en) Dual-tier security architecture for inter-domain environments
US7269730B2 (en) Method and apparatus for providing peer authentication for an internet key exchange
US7246236B2 (en) Method and apparatus for providing peer authentication for a transport layer session
US6865681B2 (en) VoIP terminal security module, SIP stack with security manager, system and security methods
JP2003298568A (en) Authenticated identification-based cryptosystem with no key escrow
WO2011041962A1 (en) Method and system for end-to-end session key negotiation which support lawful interception
WO2010124482A1 (en) Method and system for implementing secure forking calling session in ip multi-media subsystem
JP4783340B2 (en) Protecting data traffic in a mobile network environment
Palmieri et al. Providing true end-to-end security in converged voice over IP infrastructures
CN113411801A (en) Mobile terminal authentication method based on identity signcryption
Lin et al. Authentication protocols with nonrepudiation services in personal communication systems
WO2007093079A1 (en) Implementation method of crossdomain multi-gatekeeper packet network key negotiation security policy
WO2022135388A1 (en) Identity authentication method and apparatus, device, chip, storage medium, and program
CN113114644B (en) SIP architecture-based multi-stage cross-domain symmetric key management system
WO2009094813A1 (en) Security parameters negotiation method and apparatus for realizing the security of the media flow
WO2008074226A1 (en) A method for negotiating the session secret key between the endpoints across multiple gatekeeper zones
Thalhammer Security inVoIP-Telephony Systems
Callegari et al. Security and delay issues in SIP systems
Moravčík et al. Survey of real-time multimedia security mechanisms
Floroiu et al. A comparative analysis of the security aspects of the multimedia key exchange protocols
Jung et al. Using SIP identity to prevent man-in-the-middle attacks on ZRTP
WO2022183694A1 (en) Calling information authentication method, apparatus and system
Lee et al. Secure communications between bandwidth brokers
Naveed Asghar et al. Key management protocols for secure wireless multimedia services: a review

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06817842

Country of ref document: EP

Kind code of ref document: A1