Abstract:
A wireless communication system includes a pager or similar device that communicates to a home terminal. The home terminal confirms the identity of the pager and attaches a certificate to the message for ongoing transmission. Where the recipient is also a pager, an associated home terminal verifies the transmission and forwards it in a trusted manner without the certificate to the recipient.

Description:
CROSS REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application is a continuation of U.S. patent application Ser. No. 12/848,745, Aug. 2, 2012, which is a continuation of U.S. patent application Ser. No. 11/483,176 filed on Jul. 10, 2006, now abandoned, which is a continuation of U.S. patent application Ser. No. 09/680,501 filed on Oct. 5, 2000, now abandoned, all incorporated herein by reference. 
     
    
     FIELD OF THE INVENTION 
       [0002]    The present invention relates generally to cryptographic schemes, and specifically to cryptographic schemes relating to wireless applications. 
       BACKGROUND OF THE INVENTION 
       [0003]    Information security is required to secure many types of transactions performed electronically using a wide range of computing and communication technologies. As consumers demand more flexible, convenient services, technologies such as wireless networks, paging infrastructures and smart cards are being deployed to support critical, information sensitive applications including account inquiries, electronic cash, secure communications and access control. One of the key features of each of these technologies is that they offer consumers the convenience of service anywhere, any time. The convenience offered to consumers results in a challenge for the vendors to create smaller and faster devices while providing a high level of security for information computed and transmitted. 
         [0004]    Information security is provided through the application of cryptographic systems (commonly referred to as cryptosystems). The two main classes of cryptosystems are symmetric and public key. In a symmetric cryptosystem, two users wishing to participate in a secure transaction must share a common key. Therefore, each user must trust the other not to divulge the key to a third party. Users participating in a secure transaction using public key cryptosystems will each have two keys, known as a key pair. One of the keys is kept secret and is referred to as the private key, while the other can be published and is referred to as the public key. Typically, applications use a combination of both these classes of cryptosystems to provide information security. Symmetric technologies are typically used to perform bulk data encryption, while public key technologies are commonly used to perform key agreement, key transport, digital signatures and encryption of small messages. 
         [0005]    Since the introduction of public key cryptosystems, there have been many implementations proposed. All of these public key systems are based on mathematical problems which are known to be hard, that is, it is thought that breaking a system is equivalent to solving a hard mathematical problem. These problems are generally easy to solve for numbers that are small in size, but become increasingly difficult as larger numbers are used. One of the differences among the systems is how large the numbers have to be so that the system is too hard to solve given present and anticipated computing power. This is typically linked to the length of the key and referred to as the key size. A system using a small key size while maintaining a high level of security is considered better, as it requires less information to be transmitted and stored. 
         [0006]    Diffie-Hellman key agreement provided the first practical solution to the key distribution problem by allowing two parties to securely establish a shared secret over an open channel. The original key agreement protocol provides unauthenticated key agreement. The security is based on the discrete logarithm problem of finding integer x given a group generator a, and an element β, such that a x =β. 
         [0007]    Rivest Shamir Adleman (RSA) was the first widely deployed realization of a public key system. The RSA system is a full public key cryptosystem and can be used to implement both encryption and digital signature functions. The security of the RSA cryptosystem depends on the difficulty of factoring the product of two large distinct prime numbers. To create a private key/public key pair, a user chooses two large distinct primes P and Q, and forms the product n=PQ. With knowledge of P and Q, the user finds two values e and d such that ((MY e ) d  mod n=M. 
         [0008]    The public key of the user is the pair (e, n) while the private key is d. It is known that the recovery of d from and e and n requires the recovery of P and Q, and thus is equivalent to factoring n. 
         [0009]    Elliptic curve cryptosystems are based on an exceptionally difficult mathematical problem. Thus, elliptic curve systems can maintain security equivalent to many other systems while using much smaller public keys. The smaller key size has significant benefits in terms of the amount of information that must be exchanged between users, the time required for that exchange, the amount of information that must be stored for digital signature transactions, and the size and energy consumption of the hardware or software used to implement the system. The basis for the security of the elliptic curve cryptosystem is the assumed intractability of the elliptic curve discrete logarithm problem. The problem requires an efficient method to find an integer k given an elliptic curve over a finite field, a point P on the curve, another point Q such that Q=kP. 
         [0010]    In this system, the public key is a point (Q) on an elliptic curve (represented as a pair of field elements) and the private key is an integer (k). Elliptic curves are defined over an underlying field and may be implemented over the multiplicative group F p , (the integers modulo a prime p) or characteristic  2  finite fields (F 2 ∞ , where m is a positive integer). 
         [0011]    There are typically three levels in a cryptosystem, which are encryption, signatures, and certificates. These three levels can be implemented using the above mentioned systems or a combination thereof. 
         [0012]    The first level of a cryptosystem involves encrypting a message between correspondent A and correspondent B. This level is vulnerable to attack since there is no way for correspondent A to verify whether or not correspondent B sent the message, or if a third party in the guise of correspondent B sent the message. 
         [0013]    Therefore, the second level of signing a message was introduced. Correspondent B can sign the encrypted message using, for example, a hashing function to hash the original message. If correspondent A uses the same hashing function on the decrypted message and it matches the signature sent by correspondent B, then the signature is verified. However, a third party may act as an interloper. The third party could present itself to correspondent A as if it were correspondent B and vice versa. As a result, both correspondents would unwittingly divulge their information to the third party. Therefore, the signature verifies that the message sent by a correspondent is sent from that correspondent, but it does not verify the identity of the correspondent. 
         [0014]    To prevent this type of attack, the correspondents may use a trusted third party (TTP) to certify the public key of each correspondent. The TTP has a private signing algorithm and a verification algorithm assumed to be known by all entities. The TTP carefully verifies the identity of each correspondent, and signs a message consisting of an identifier and the correspondent&#39;s public key. This is a simple example as to how a TTP can be used to verify the identification of the correspondent. 
         [0015]    Some of the most significant emerging areas for public key cryptosystems include wireless devices. Wireless devices, including cellular telephones, two-way pagers, wireless modems, and contactless smart cards, are increasing in popularity because of the convenience they provide while maintaining a low cost and small form factor. 
         [0016]    However, implementing the above mentioned cryptosystems requires computational power, which is limited on such wireless devices. Therefore, there is a need for a cryptosystem that provides all of the advantages as described above, but requires less power from the wireless device. 
       SUMMARY OF THE INVENTION 
       [0017]    In accordance with the present invention there is provided a method of communicating between a pair of correspondents through an intermediary comprising the steps, registering one of said correspondents with said intermediary to share an identifier, preparing at said one correspondent a secure communication including a message between said correspondents, preparing a signature component including a derivation of said secure communication and said identifier forwarding said signature component to said intermediary and verifying said signature component at said intermediary, attaching to said communication a certificate of the public key and identity of the said one correspondent, and forwarding said communication and certificate to said other correspondent. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0018]    An embodiment of the invention will now be described by way of example only with reference to the following drawings in which: 
           [0019]      FIG. 1  is a schematic drawing of a pager system; 
           [0020]      FIG. 2  is a representation of a registration process for the system of  FIG. 1   
           [0021]      FIG. 3  is a representation of a message transfer system for the system of  FIG. 1   
           [0022]      FIG. 4  is a schematic representation of an alternative embodiment of a communication system. 
       
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
       [0023]    For convenience, like numerals in the description refer to like structures in the drawings. Further, although the description refers only to pagers, it is intended that the description includes wireless devices in general. 
         [0024]    Referring to  FIG. 1 , a paging system is represented generally by the numeral  100 . A first pager  102  is operatively coupled with a first home terminal  104  through a wireless communication. The first home terminal  104  is operatively coupled to a second home terminal  106  via a network  108  and the second home terminal  106  in turn is operatively coupled to a second pager  110 . The pagers  102 ,  110  are typically coupled to their respective home terminals  104 ,  106  by radio frequency. The network  108  is typically a public switched telephone network (PSTN), but can include a data network, and the Internet. 
         [0025]    Before a pager  102  can communicate with the home terminal  104  it must be registered. Every pager  102  contains a subscriber unit address and a public key Q c  of the pager manufacturer or service provider (herein referred to as the company public key). This information is loaded at the manufacture stage. The company public key Q c  is derived from a company private key d c . 
         [0026]    Each home terminal  104  has a private key d H  and a public key Q H . The public key Q H  is signed by the company private key d c  to create a certificate denoted C M . The company public key Q c  could be system wide or defined for a given region. A subscriber purchases a pager  102  from a retail outlet and the pager is then loaded with a home index and identifier ID using the protocol outlined below. The home index is typically a 32-bit index which uniquely identifies the pager  102  and correlates it with a specific home terminal  104 . 
         [0027]    The subscriber calls a number, typically a toll-free number, to contact a service provider and a home terminal  104  is assigned. The home terminal  104  sends the pager  102  its public key Q H  and its certificate C M  The pager verifies Q H  with the company public key Q c . The pager generates a private key d p  and a corresponding public key Q p  which is communicated to the home terminal  104 . The pager  102  sends to the home terminal  104  the necessary authorization information (including identification, credit card number, subscriber unit address, and the like) encrypted under the home terminal public key Q H ). The home terminal gets authorization from a central repository that this subscriber unit has not already been activated and thereby prevents counterfeiting of subscriber units. The home terminal  104  sets up a subscriber account and sends the pager  102  its home index and identifier ID encrypted under Q p  and signed by the home terminal. 
         [0028]    Each pager  102  in a paging infrastructure  100  is registered with a home terminal using the registration protocol described above. The pagers have a private and public key pair, dp,Q p , each of which are approximately 20 bytes in length. The home terminals  104  have a private and public key pair dh, Q H  each of which are approximately 25 bytes in length. It is desirable to have a longer key length at the home terminal for providing additional security. Further, since the home terminal  104  does not have the same power constraints as the pager  102 , the extra computational power required for the longer key is not a significant issue. The additional security at the home terminal  102  is important since a compromise of the home terminal would permit counterfeiting of subscriber units. 
         [0029]    To reduce the computational requirements on the pager thereby reducing the power required to encrypt a message M, each of the pagers  102  has a certificate registered for it at the home terminal  104 . The certificate, cert ca&gt; , validates the public key Q p , and identity ID. Each of the home terminals maintains a table for the pagers and their associated certificate. Rather than having the pager sign the certificate and send the message to the home terminal, the certificate cert ca&gt;  is signed by the pager&#39;s home terminal. The transmission process used to implement such a protocol is described in detail below. 
         [0030]    Referring once again to  FIG. 1  and  FIG. 3 , the first pager P 1  wishes to send a message M to a recipient, e.g. a second pager P 2  having a public key Qp 2 . The sender P 1  initially obtains an authentic copy of a recipient&#39;s public key Q p 2 . The first pager P 1  calculates ciphertext with of a signed message M such that W=EQp 2 , (Sp 1 , (M)) , where EQp 2  is encryption under the public key Qp 2  and Sp 1  is the signature of the first pager on message M using the private key dp. 
         [0031]    The first pager also calculates a signature m a =Sp 1  (h(w) % CN % IDp 1 ,) where h(w) is a hash of W, such as SHA-1. CN is a timestamp or some other nonce, IDp 1 , is the unique identifier of the first pager, and % represents concatenation. The first pager then transmits the signature, m a  and the signed, encrypted message, W, to the first home terminal. 
         [0032]    The signature, ma, is used by the home terminal  104  associated with pager P 1  to verify that P 1  is a legitimate user. In order to avoid a challenge-response authentication to save time and bandwidth, the message Wand a nonce CN, which is unique for each transmission, are coupled with the ID of P 1  and signed. The nonce is used to prevent replay of the transmission. W is a signed, encrypted form of the message M. Signing then encrypting is preferred over encrypting then signing. 
         [0033]    The first home terminal receives ma and W from P 1  and uses M a  to verify that P 1  is a legitimate user. IDp 1 , is recovered from ma, and the first home terminal retrieves the certificate, Cert ca  for P 1  from the corresponding table and attaches it to W. Cert ca  is a full certificate such as X.509 and consists of 1 bytes. There is no loss of security in storing the Cert ca  certificates at the first home terminal. 
         [0034]    In addition to saving computational power on the pager, the bandwidth requirements of the transmission from the pager to the base are reduced since the pager does not have to transmit a certificate. 
         [0035]    The first home terminal  104  stores a pre-computed table of values which allows it to increase the speed of verifying P 1 &#39;s signature. Alternately, if verification is fast enough, as would be the case with a hardware implementation, the table of values is not required. 
         [0036]    The first home terminal then removes the signature component M a  and transmits the signed, encrypted message Wand the certificate Cert ca  to the recipient. Since the recipient in this example is the second pager  110 , W and Cert ca  are sent to the second home terminal  106  that has public and private keys Q p3  d p3  respectively. 
         [0037]    The second home terminal,  106  receives the transmission and verifies Qp 1  using Cert ca (Qp 1 , IDp 1 ). To save bandwidth, the second home terminal  106  signs Qp 1 , according to the signature function S dp3  (W % Qp 1  % ID p3 ) and sends it along with W to P 2 . A time stamp CN 1  may be included to prevent replay attacks. P 2  trusts the second home terminal to do this honestly. The pager P 2  can then verify W and recover the message M using its private key d p2  and the senders public key Q p1 . Q p1  has been validated by the signature of the home terminal  104  and therefore communicating between the second home terminal  106  and the second pager  110  in this manner keeps the certificates off the transmission channel and reduces bandwidth requirements. 
         [0038]    An example of the bandwidth requirements for such a method is described as follows. Suppose M consists of t bytes. If the Nyberg-Rueppel protocol is used for signing the message, t+20 bytes are required for Sp 1 (M). A further 20 bytes are used to encrypt Sp 1 (M), therefore W is t+40 bytes in length. Hashing h(W) uses 20 bytes if SHA-1 is used. The nonce CN uses 4 bytes and the identification IDp 1  uses 4 bytes. Once again, if Nyberg-Rueppel is used for signing, 20 additional bytes are used. Hence m a  will be 48 bytes. Therefore, the transmission between the first pager and the first home terminal uses t+92 bytes. 
         [0039]    For the transmission from the first home terminal to the second home terminal, W uses t+40 bytes, Cert ca  uses  l  bytes, and therefore the bandwidth required is t+ l +40 bytes. 
         [0040]    For the transmission from the second home terminal, W uses t+40 bytes, Qp 1  uses 20 bytes, 1Dp 1  uses 4 bytes, and CN 1  uses 4 bytes. Therefore, using Nyberg-Rueppel for signing, the bandwidth used in sending W and S dp3 (W % Qp 1  % (IDp 1 ,) and the nonce CN 1  is a total of 25+(t+40)+20+4+4=t+93 bytes. 
         [0041]    In the above example, the transmission is from pager to pager. However, the protocol may be used from the input devices, for example, a DTMF telephone as illustrated in  FIG. 4 . In this case, the transmission T, would be With and Cert ca  (Qd. ID   D ) where Q D  and ID D  are the public key and identity of the telephone. 
         [0042]    The transmission T 2  would be W and cert ca  (Qd. ID   D ) and the transmission T 3  to the pager, after verification of Cert ca  would be Q D , With 1D D  and CN all signed by the home terminal.