US20090195443A1

US20090195443A1 - Authenticating a signal based on an unknown component thereof

Info

Publication number: US20090195443A1
Application number: US12/012,412
Authority: US
Inventors: Peter Levin; David S. De Lorenzo; Per K. Enge; Sherman C. Lo
Original assignee: Zanio Inc
Current assignee: Boeing Co
Priority date: 2008-02-02
Filing date: 2008-02-02
Publication date: 2009-08-06
Also published as: US7969354B2

Abstract

Authentication of a signal, signal_A, that is provided as having been received from a source at a first global location by comparing it to a signal that is received from the source at a second global location, signal_B, where signal_Bcontains an unknown signal that is unique to the source, and determining, that signal_Acontains the same unknown signal that is contained in signal_B.

Description

BACKGROUND OF THE INVENTION

This invention relates to global positioning, and more particularly to the issue of confidence that a user has in global positioning, information that equipment may provide. In the context of this disclosure, global positioning encompasses the absolute geo-location as well are the relative location of one object relative to another object.
There are numerous electronic ways by which global positioning may be provided. Some are terrestrial, and some are based on satellites. A satellite system that currently is most commonly used is the Global Positioning System (GPS), and it is quite well known in the sense that many people have GPS receivers that assist them in determining their physical location. GPS uses a collection of satellites that are arranged to orbit the Earth so that at least four satellites are always within the reception range of a receiver, at any point on the globe. One of the signals that the satellites transmit is a signal at frequency L1, which is used as a carrier to modulate a data signal that is itself modulated with a Code Division Multiple Access (CDMA) code, commonly referred to as the C/A code. The CDMA code that is used by each satellite is unique to the satellite, but it is publicly known, which allows the receiver to discriminate, or detect, the individual signal of each of the satellites in the presence of signals form the other satellites and in the presence of noise. Actually, each satellite transmits at least one other signal, employing the same carrier frequency that is shifted 90 degrees. This second signal is modulated by another code, known as the P(Y) code. The P(Y) code is either the P, which is publicly known, or the encrypted Y code. Today, all satellites use the Y code and, consequently, the resulting transmitted signal that is encoded with the Y code cannot be used by anyone other than those who have the decryption algorithm and the key. Each satellite transmits yet another signal, on frequency L2, but the disclosure herein focuses on frequency L1 only. It should be understood that the principles disclosed herein apply to L1, L2, or any of the new frequencies that are planned for satellite navigation.
Because the invention that is disclosed herein is illustrated by way of an example that is based on the pervasive GPS system, the Following gives an abbreviated review of the GPS signals and the processing that takes place in a conventional GPS receiver. It should be kept in mind that the deficiency in the GPS system that is mentioned later is found in all other non-encrypted systems, and that the applicability of the invention disclosed herein extends beyond the GPS system. It should be kept in mind, therefore, that terms referring to global positioning (without initial letters being capitalized) refers to the terms generically, and not necessarily solely to GPS.
A conventional GPS receiver, shown in FIG. 1, simultaneously receives a number of satellite signals on frequency L1, where the signal transmitted by satellite n can be expressed as
S _transmitted =A ⁿ D ⁿ(t)x _C/A ⁿ(t)cos(2π(f _L1)t+φ ₁)+B ⁿ D ⁿ(t)x _Y ⁿ(t)sin(2π(f _L1)t+φ ₁) (1)
where Dⁿ(t) is the data signal, x_C/A ⁿ(t) is the C/A code signal assigned to satellite n, f_L1is the frequency of the carrier, and φ₁is the phase of the carrier relative to the beginning of the data and code signals.
A GPS receiver can engage in the processing of signals as if all of the possible satellites are present but, of course, some of the satellites are not within range of the GPS receiver's antenna so the processing results for those satellites are not viable. The following analysis follows the signal of only one satellite and, for sake of simplicity, superscript n is omitted from the equations, and the C/A subscript is shortened to C.
The transmitted signal is subjected to transit time delay to the receiver, τ, and the signal that is received by a receiver's antenna experiences a Doppler frequency shift, f_D, due to the satellite's movement in its orbit and possible receiver motion. Also, the transmitter and the receiver do not have a common clock, which means that even when the transmitter and the receiver clocks are at identical frequency, there is, nevertheless, a phase difference between them. Thus, the received signal thus can be expressed as
S _received= AD(t−τ)x _C(t−τ)cos(2π(f _L1 +f _D)(t+τ)+φ ₁)+BD(t−τ)x _Y(t−τ)sin(2π(f _L1 +f _D)(t−τ)+φ₁) (2)
or simplified to
S _received =AD(t−φ)x_C(t−τ)cos(f _L1 +f _D)t+φ₁−φ₂)+BD(t−τ)x_Y(t−τ)sin(2π(f _L1 +f _D)t)+φ₁−φ₂) (3)
As shown in FIG. 1, the received signal is amplified in element 10, conventionally downshifted to a preselected intermediate frequency (IF) by multiplying the received signal in element 12 by signal
sin(2π(f_L1 −f _IF)t+φ₃) (4 )
and passing the resulting signal through low pass filter 15. The signal of equation (4) is generated from reference oscillator 20 by frequency synthesizer 22, where φ₃is the phase of the locally generated signal (relative to the beginning of the data and code signals at the transmitting satellite which, of course, is unknown). The result at the output of the low pass filter is
S _downshifted =AD(t−τ)x_C(t−τ)cos(2π(f _IF +f _D)t+φ ₁φ₂−φ₃)+BD(t−τ)x _Y(t−τ)sin(2π(f _IF +f _D)t+φ ₁−φ₂−φ₃) (5 )
or simplified to
S _downshifted =AD(t−τ)x_C(t−τ)cos(2π(f _IF +f _D)t+θ ₁)+BD(t−τ)x_Y(t−τ)sin(2π(f _IF +f _D)t+θ ₁). (6)
It may be noted that the above-described use of downshifting by use of an IF modulator 12 and low pass filter 15 is illustrative, and that the A/D can be connected directly to amplifier 10 and controlled to generate a digital signal as if it were downshifted as shown in FIG. 1.
The output signal of low pass filter 15 is digitized in A/D converter 18 and applied to a combination of processor 100 and associated memory 110 where the remainder of the processing takes place.
The processing begins with a signal acquisition (software) module that includes a code generator element and a carrier generation module. The code generation module develops signal
x _C(t−{circumflex over (τ)}), (7)
where {circumflex over (τ)} is an estimate of τ, and the carrier generator module creates two signals that may be viewed as the phasor
Ψ=cos(2π(f _IF +{circumflex over (f)} _D)t+{circumflex over (θ)} ₁)−i sin(2π(f _IF +{circumflex over (f)} _D)t+{circumflex over (θ)} ₁), (8)
where {circumflex over (f)}_Dis an estimate of the Doppler frequency shift f_D, and {circumflex over (θ)}₁is an estimate of the phase θ₁. Multiplying the received (and downshifted) signal of equation (6) by the code signal of equation (7) and the phasor of equation (8) and then integrating the product over a preselected interval that is long enough to reliably detect a correlation peak (for example, more than one period of the C/A code) yields:
∫F _CΨ cos(2π(f _IF +f _D)t+θ ₁)]+∫F _YΨ sin(2π(f _IF +f _D)t+θ ₁)] (9)
where
F _C =AD(t−τ)x _C(t−τ)x _C(t−{circumflex over (τ)}) and F _Y =BD(t−τ)x_Y(t−τ)x_C(t−{circumflex over (τ)}) (10)
Equation (9) expands to
$\begin{matrix} S_{I} + S_{Q} = \int F_{C} {\begin{matrix} \cos (2 π (f_{IF} + {\hat{f}}_{D}) t + {\hat{θ}}_{1}) \cos (2 π (f_{IF} + f_{D}) t + θ_{1}) - \\  \sin (2 π (f_{IF} + {\hat{f}}_{D}) t + {\hat{θ}}_{1}) \cos (2 π (f_{IF} + f_{D}) t + θ_{1}) \end{matrix}} + \int F_{Y} {\begin{matrix} \cos (2 π (f_{IF} + {\hat{f}}_{D}) t + {\hat{θ}}_{1}) \sin (2 π (f_{IF} + f_{D}) t + θ_{1}) - \\  \sin (2 π (f_{IF} + {\hat{f}}_{D}) t + {\hat{θ}}_{1}) \sin (2 π (f_{IF} + f_{D}) t + θ_{1}) \end{matrix}} or to & (11) \\ S_{I} + S_{Q} = \int F_{C} {\begin{matrix} \cos (2 π (f_{IF} + f_{D} + {\hat{f}}_{D}) t + θ_{1} + {\hat{θ}}_{1}) + \\ \cos (2 π (f_{D} - {\hat{f}}_{D}) t + θ_{1} - {\hat{θ}}_{1}) - \\  \sin (2 π (2 f_{IF} + f_{D} + {\hat{f}}_{D}) t + θ_{1} + {\hat{θ}}_{1}) + \\  \sin (2 π (f_{D} - {\hat{f}}_{D}) t + θ_{1} - {\hat{θ}}_{1}) \end{matrix}} + \int F_{Y} {\begin{matrix} \sin (2 π (f_{IF} + f_{D} + {\hat{f}}_{D}) t + θ_{1} + {\hat{θ}}_{1}) + \\ \sin (2 π (f_{D} - {\hat{f}}_{D}) t + θ_{1} - {\hat{θ}}_{1}) + \\  \cos (2 π (2 f_{IF} + f_{D} + {\hat{f}}_{D}) t + θ_{1} + {\hat{θ}}_{1}) - \\  \cos (2 π (f_{D} - {\hat{f}}_{D}) t + θ_{1} - {\hat{θ}}_{1}) \end{matrix}} . & (12) \end{matrix}$
Since, as indicated above,
F _Y =BD(t−τ)x _Y(t−τ)x _C(t−{circumflex over (τ)}), (13)
and the C/A code is orthogonal to the Y code, the second integral of equation (12) yields zero. Also, the integration acts like a low pass filter that discards the high frequency signals of cos(2π(2f_IF+f_D{circumflex over (f)}_D)t and sin(2π(2f_IF+f_D+{circumflex over (f)}_D)t, leaving
$\begin{matrix} S_{I} +  S_{Q} = \int F_{C} {\begin{matrix} + \cos (2 π (f_{D} - {\hat{f}}_{D}) t + θ_{1} - {\hat{θ}}_{1}) + \\  \sin (2 π (f_{D} - {\hat{f}}_{D}) t + θ_{1} - {\hat{θ}}_{1}) \end{matrix}} . & (14) \end{matrix}$
It can be demonstrated that S²+S_Q ²equals
$\begin{matrix} \begin{matrix} S_{I}^{2} + S_{Q}^{} = {(\int F_{C} \cos (2 π (f_{D} - {\hat{f}}_{D}) t + θ_{1} - {\hat{θ}}_{1}))}^{2} + \\ {(\int F_{C} \sin (2 π (f_{D} - {\hat{f}}_{D}) t + θ_{1} - {\hat{θ}}_{1}))}^{2} \\ = {(\int F_{C} \cos 2 π (f_{D} - {\hat{f}}_{D}) t)}^{2} + \\ {(\int F_{C} \sin 2 π (f_{D} - {\hat{f}}_{D}) t)}^{2} \end{matrix} & (15) \end{matrix}$
which is independent of (θ₁−{circumflex over (θ)}₁). It can be also demonstrated that good estimates for τ, and f_Dare attained when code generation module is adjusted as to introduce a delay, {circumflex over (τ)}, and the carrier generator module is adjusted as to the introduced {circumflex over (f)}_Dso as to maximize S₁ ²+S_Q ².
For the more visually inclined reader, FIG. 2 shows a diagrammatic representation of the processing that takes place in the acquisition module.
The task of the acquisition module is to come up with a first-cut approximation of the delay and the Doppler frequency shift. A refinement of the approximations takes place in a tracking module, whose function is to both refine the estimates and track the changes in τ, f_Dand θ₁as conditions change, and whose diagrammatic representation is shown in FIG. 3.
The tracking module contains a phase lock loop comprising multiplier 31 that multiplies the S_downshiftedsignal of equation (6) by the phasor of equation (8) provided by numerically controlled oscillator (carrier NCO) 32. The output of multiplier 31 is multiplied in multiplier 33 by the code signal obtained from code generator 38. The output of multiplier 33 is integrated in module 34 and applied to discriminator 35, which develops a carrier error signal (θ₁−{circumflex over (θ)}₁) that controls the frequency of the carrier NCO.
The output of multiplier 31 is also applied to multiplier 36, where it is multiplied by the code signal that is generated by element 38, but delayed by half of the duration of code C/A chip; i.e.,
x _C(t−{circumflex over (τ)}−T _C/2), (16)
and to multiplier 37, where it is multiplied by the code signal that is generated by element 38, but advanced by half of the duration of code C/A chip; i.e.,
x _C(t−{circumflex over (τ)}+T _C/2). (17)
The outputs of multipliers 36 and 37 are integrated in elements 41 and 42, respectively, and applied to discriminator 39 which develops a delay error signal (τ−{circumflex over (τ)}) that is applied to code generator 38, controlling the frequency of the clock that generates the code.
While in both elements 32 and 38 the frequency of a clock is controlled by the respective discriminators, the result is that the generated carrier frequency phasor that is applied to multiplier 31 is in the form
cos(2π(f _IF +{circumflex over (f)} _D)t+{circumflex over (θ)} ₁)−i sin(2π(f _IF +{circumflex over (f)} _D)t+{circumflex over (θ)} ₁) (18)
with the approximations {circumflex over (f)}_Dand {circumflex over (θ)}₁tracking closely the f_Dand θ₁of equation (6), and the generated code
x _C(t+{circumflex over (τ)}) (19)
has a {circumflex over (τ)} that is a close estimate of τ.
The code and the carrier measurement are applied to subsequent modules (not shown) that decode the navigation message, determine satellite ephemeris, and compute the pseudo-range, and with corresponding pseudo-ranges obtained by processing other satellites, the physical location of the receiver is computed (through quadralateration) and displayed.
All of the above is conventional, and the reader is invited to peruse the book “Global Positioning System” by Misra and Enge, Ganga-Jamuna Press, 2006 for further details. In general, the GPS literature is enormous. It describes alternate implementation to the above, where, for example, the code and carrier removal processes described by equations (7), (8) and (9) are done in different order. It also describes implementations that use correlator spacings other than those chosen in equations (16) and (17). The literature is also replete with discriminator strategies that differ from the simple “early minus late” strategy described here.
In commercial applications the C/A code is publicly known and, consequently, GPS receivers are vulnerable to spoofing. A hostile party can generate a facsimile of one or more satellite signals that carry incorrect information, and a GPS receiver that accepts the bogus signals will compute an incorrect position and, in fact, may be caused to compute a position that the hostile party wishes to have the receiver compute. However, spoofing is not a problem for those who are able to use the Y code because this code is not publicly known, so a hostile party cannot create a signal that appears bona fide. This problem is not unique to GPS receivers of course. It is endemic to all global positioning systems that rely on insecure signals.
The primary object of this disclosure is to create a method and a means for having confidence that a global position computation, or an assertion based on a global position, is bona fide.
Another object of this disclosure is to have global positioning computation devices, such as GPS receivers that, without having access to the information contained in a secure signal, or access to the code that makes the information secure (henceforth, the unknown signal), such as the Y code in the GPS signal, are nevertheless able to withstand spoofing attempts, for example an attack by a rogue user with access to an authorized receiver or an attack by a malicious agent attempting to dupe legitimate users.
Yet another object of this invention is to determine the location of a device by processing the unknown signal jointly at the two stations (or locations).
Still another object of this invention is to authenticate a claim regarding a location that such a computing device asserts in connection with information services, such as financial services.

SUMMARY OF THE INVENTION

The above and other objects are achieved, and an advance in the art is realized by effectively employing the unknown signal (e.g., the Y code) for authentication, and more particularly by receiving a first signal from a source (e.g., satellite n), which signal contains the unknown signal and is also adapted to make a statement (e.g., an assertion of a global position), receiving a second signal that also contains an unknown signal with which information is associated that is different from, but related to, the information associated with the first unknown signal, and processing the two unknown signals to authenticate the statement. Confidence in the authentication results from one of the signals being received in a manner that insures it being not affected by hostile signals that perhaps affect the first signal. Illustratively, the second signal is received by another receiver that is remote from the first receiver.
In one illustrative embodiment, the first receiver is an improved GPS receiver whose assertions of global position one wishes to authenticate, and the second receiver is an improved GPS receiver that, to the extent desired by the party that wishes to trust the authentication, is known to receive bona fide satellite signals. The first improved GPS receiver processes the signal that is putatively received from satellite n to develop accurate estimates of transit delay, Doppler frequency shift and carrier phase shift for the received signal—which estimates are typically developed in the course of determining the receiver's global position—and sends to the second improved GPS receiver a signal (signal A) that accounts for the estimated transit delay, Doppler frequency shift and carrier phase shift. The second improved GPS receiver employs signal A as well as a signal (signal B) that is developed from the signal the second receiver received from satellite n, and correlates the Y component signals in signals A and B. A test of the correlation determines whether to authenticate signal A. For example, a correlation that exceeds a selected threshold is concluded to be an authentication that the signal sent by the first improved GPS receiver indeed originated from satellite n.

BRIEF DESCRIPTION OF THE DRAWING

FIG. 1 is a block diagram of a GPS receiver;

FIG. 2 is a block diagram illustrating the processing performed in an acquisition module of a GPS receiver;

FIG. 3 is a block diagram illustrating the processing performed in a tracking module of a GPS receiver;

FIG. 4 depicts an arrangement where a first GPS receiving unit that is constructed in accord with the principles disclosed herein and which is embedded in a portable computer of an employee is communicating to a second GPS receiving unit that is correspondingly constructed in accord with the principles disclosed herein in a gateway to an employer's data network;

FIG. 5 illustrates the processing within the second GPS receiver when the first receiver obtains good estimates of transit delay, Doppler frequency shift and carrier phase shift, and provides a signal to the second GPS receiver with carrier wipeoff already carried out;

FIG. 6 illustrates the processing, within the second GPS receiver when the first receiver obtains good estimates of transit delay, Doppler frequency shift and carrier phase shift, and provides to the second GPS receiver a the raw signal that contains information about all satellites whose signals are received by the first GPS receiver, and the transit delay, Doppler frequency shift and carrier phase shift estimates of all of those satellites; and

FIG. 7 illustrates the processing within the second GPS receiver when the signal that the first GPS receiver sends is the raw signal only.

DETAILED DESCRIPTION

An important realization that is disclosed herein is that given a signal from a source that comprises a secure, though unknown, component and a corresponding known but not secure component, where both the known and unknown components are similarly affected by physical conditions and those effects are computed for the known component, it is possible to authenticate the known component by using a second signal that is a changed version of the signal from the source—where either the second signal or the given signal is known to be bona fide—through use of the unknown components of the given signal and of the second signal.
The following applies this insight to the problem where the source is one or more satellites that output signals which are used for various purposes, including global positioning; and more particularly to the aforementioned problem in the context of the Global Positioning System. It should be understood, however, that the principles disclosed herein are not limited to the illustrative embodiment presented below.
FIG. 4 represents one illustrative embodiment of the invention disclosed herein, where unit 201 is a GPS receiver that is modified in accord with the principles disclosed herein and which, illustratively, is embedded in portable computer 200 of an employee. For security reasons, the employer of this employee wishes to preclude access by that portable computer relative to at least some of the employer's resources (e.g., files pertaining to some project) unless that portable computer is at one of the employer's numerous locations. Therefore the employer installs unit 301 in gateway 300, which is the point of entry to the employer's data network of the employer, and unit 301 is a GPS receiver that is also modified in accord with the principles disclosed herein. For the illustrative example of FIG. 4, it is presumed that the employer is satisfied that receiver 301 receives bona fide satellite signals.
In addition to units 201 and 301, FIG. 4 includes a communication link 30 by which communication can flow between units 201 and 301. For purposes of the global location authentication that is described below, the communication link does not need to be secure. It is expected, however, that in some applications this link will need to be secure; for example, where this communication link is also used to send back authorizations.
Unit 201 receives the signals from a number of satellites and processes them as described above to compute the global position of unit 201 based on the received signals. In the course of processing the signal of satellite n, the signal of equation (12) is developed, and as part of developing this signal unit 201 creates a signal that corresponds to the received (and downshifted) signal of equation (6) multiplied by the phasor of equation (8). That is, unit 201 creates the signal (downshifted, carrier wipeoff relative to satellite n, but not C/A code wipeoff):
$\begin{matrix} A^{A} D^{A} (t - τ^{A}) x_{C}^{A} (t - {\hat{τ}}^{A}) {\begin{matrix} \cos (2 π (2 f_{IF} + f_{D}^{A} + {\hat{f}}_{D}^{A}) t + θ_{1}^{A} + {\hat{θ}}_{1}^{A}) + \\ \cos (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) - \\  \sin (2 π (2 f_{IF} + f_{D}^{A} + {\hat{f}}_{D}^{A}) t + θ_{1}^{A} + {\hat{θ}}_{1}^{A}) + \\  \sin (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) \end{matrix}} + B^{A} D^{A} (t - τ^{A}) x_{Y}^{A} (t - {\hat{τ}}^{A}) {\begin{matrix} \sin (2 π (2 f_{IF} + f_{D}^{A} + {\hat{f}}_{D}^{A}) t + θ_{1}^{A} + {\hat{θ}}_{1}^{A}) + \\ \sin (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) + \\  \cos (2 π (2 f_{IF} + f_{D}^{A} + {\hat{f}}_{D}^{A}) t + θ_{1}^{A} + {\hat{θ}}_{1}^{A}) - \\  \cos (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) \end{matrix}} . & (20) \end{matrix}$
where the superscript A designates the signal of unit 201.
A low pass filter discards the terms with frequency on the order of 2πf_IF, leaving
$\begin{matrix} A^{A} D^{A} (t - τ^{A}) x_{C}^{A} (t - {\hat{τ}}^{A}) {\begin{matrix} \cos (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) + \\  \sin (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) \end{matrix}} + B^{A} D^{A} (t - τ^{A}) x_{Y}^{A} (t - {\hat{τ}}^{A}) {\begin{matrix} \sin (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) - \\  \cos (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) \end{matrix}} & (21) \end{matrix}$
which can be written as
S ₁ ^A +iS _Q ^A (22)
where
$\begin{matrix} S_{I}^{A} = A^{A} D^{A} (t - τ^{A}) x_{C}^{A} (t - {\hat{τ}}^{A}) \cos (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) + B^{A} D^{A} (t - τ^{A}) x_{Y}^{A} (t - {\hat{τ}}^{A}) \sin (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) & (23) \\ and \\ S_{Q}^{A} = A^{A} D^{A} (t - τ^{A}) x_{C}^{A} (t - {\hat{τ}}^{A}) \sin (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) - B^{A} D^{A} (t - τ^{A}) x_{Y}^{A} (t - {\hat{τ}}^{A}) \cos (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) . & (24) \end{matrix}$
Approach A
In accordance with a first approach, unit 201 sends the quadrature signal of equation (24) to unit 301 over link 30, together with identification of the satellite whose signal the sent signal represents.
Unit 301 develops a similar signal; that is,
$\begin{matrix} S_{Q}^{B} = A^{B} D^{B} (t - τ^{B}) x_{C}^{B} (t - {\hat{τ}}^{B}) \sin (2 π (f_{D}^{B} - {\hat{f}}_{D}^{B}) t + θ_{1}^{B} - {\hat{θ}}_{1}^{B}) - B^{B} D^{B} (t - τ^{B}) x_{Y}^{B} (t - {\hat{τ}}^{B}) \cos (2 π (f_{D}^{B} - {\hat{f}}_{D}^{B}) t + θ_{1}^{B} - {\hat{θ}}_{1}^{B}) . & (25) \end{matrix}$
The transit time from a satellite to unit 201, τ^A, is different from the transit time from the same satellite to unit 301, {dot over (τ)}^B, so in accord with the first approach, the signal received from unit 201 is delayed by δ, where δ may be a positive or negative quantity, and a product of the signals S_Q ^A(delayed) and S_Q ^Bis integrated; i.e.,
$\begin{matrix} \begin{matrix} S = \int [S_{Q}^{A} (delayed) \times S_{Q}^{B}] \\ = \int [\begin{matrix} {\begin{matrix} A^{A} D^{A} (t - τ^{A} - δ) x_{C}^{A} (t - {\hat{τ}}^{A} - δ) \\ \sin (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) (t - δ) + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) - \\ B^{A} D^{A} (t - τ^{A} - δ) x_{Y}^{A} (t - {\hat{τ}}^{A} - δ) \\ \cos (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A} - {\hat{θ}}_{1}^{A}) \end{matrix}} \times \\ {\begin{matrix} A^{B} D^{B} (t - τ^{B}) x_{C}^{B} (t - {\hat{τ}}^{B}) \sin (2 π (f_{D}^{B} - {\hat{f}}_{D}^{B}) t + θ_{1}^{B} - {\hat{θ}}_{1}^{B}) - \\ B^{B} D^{B} (t - τ^{B}) x_{Y}^{B} (t - {\hat{τ}}^{B}) \cos (2 π (f_{D}^{B} - {\hat{f}}_{D}^{B}) t + θ_{1}^{B} - {\hat{θ}}_{1}^{B}) \end{matrix}} \end{matrix}] \end{matrix} & (26) \end{matrix}$
which can be written in more manageable form as
S=∫[XU−YU−XW+YW] (27)
where
X=A ^A D ^A(t−τ ^A−δ)x _C ^A(t−{circumflex over (τ)} ^A−δ)sin(2π(f _D ^A −{circumflex over (f)} _D ^A)t+θ ₁ ^A−{circumflex over (θ)}₁ ^A) (28)
Y=B ^A D ^A(t−τ ^A−δ)x _Y ^A(t−{circumflex over (τ)} ^A−δ)cos(2π(f _D ^A −{circumflex over (f)} _D ^A)t+θ ₁ ^A−{circumflex over (θ)}₁ ^A) (29)
U=A ^B D ^B(t−τ ^B)x _C ^B(t−{circumflex over (τ)} ^B)sin(2π(f _D ^B −{circumflex over (f)} _D ^B)t+θ ₁ ^B−{circumflex over (θ)}₁ ^B) (30)
and W=B ^B D ^B(t−τ ^B)x _Y ^B(t−{circumflex over (τ)} ^B)cos(2π(f _D ^B −{circumflex over (f)} _D ^B)t+θ ₁ ^B−{circumflex over (θ)}₁ ^b). (31)
As indicated above, the estimates of {circumflex over (τ)}^A, {circumflex over (f)}_D ^Aand {circumflex over (θ)}₁ ^A, are quite good, and so are the estimates of {circumflex over (τ)}^B, {circumflex over (f)}_D ^B, and {circumflex over (θ)}₁ ^B. Given accurate information about the phase shifts, unit 301 can perform coherent demodulation. Consequently, over the integration interval that needs to be employed for equation (26), the sin( ) terms can be replaced with 0 (i.e., X=U=0), and the cos( ) terms can be replaced with their respective coefficients. This leads to
S=B ^A B ^B ∫D ^A(t−τ ^A−δ)D^B(t−τ ^B)x _Y ^A(t−τ ^A−δ)x _Y ^B(t−τ ^B) (32)
Clearly, when the signal of unit 301 is bona fide and, therefore,
x_Y ^B(t−τ^B) is equal to x_Y ^A(t−τ^B).
D^A(t−τ^B) is equal to D^B(t−τ^B), and
(D^B(t−τ^B))²=1, because the message signal, D, can only have ±1 values.
Thus, the value of S in equation (32) is maximum when δ=τ^B−τ^A; i.e.,
S=B^A B ^B. (33)
Thus, without knowing the Y code signal x_Y(t−τ), the arrangement of FIG. 4 executes a method that recognizes—by the value of S for different values of δ—when a signal that is received by unit 201 and a signal that is received by unit 301 originate from a given source that outputs a signal that is modulated with a signal x_Y(t−τ), when that is the case; and conversely, recognizes when one of the signals is not from the given source.
One can appreciate that the receiver shown in FIG. 1 includes processor 100 and memory 110 that operate on digital signals and, therefore, can be implemented in a programmed general purpose processor. Similarly, unit 201 can include hardware elements that correspond to elements 10, 12, 15. 18, 20 and 22, and employ the computing power of portable computer 200 to carry out the various calculations disclosed above, which in the FIG. 1 embodiment would be performed in element 100 and its associated memory 110. The software that is necessary in unit 201 to augment the conventional receiver advantageously implements a filter to develop the signal of equation (24) from the signal of equation (20), and a module for sending to line 30 the signal of equation (24), and the identity of the satellite whose signal is represented by the sent signal. This extremely modest addition to the software is quite simple, which a skilled artisan can create without undue experimentation in any one of a number of techniques that are well known in the art.
The modification to the GPS receiver in unit 301 is somewhat greater than in unit 201, but still quite simple to implement in a programmed general purpose processor (which may be part of the processor that gateway 200 employs). FIG. 5 diagrammatically shows unit 301 to include a port to receive the signal sent by unit 201, a delay unit 21 that is responsive to the equation (25) signal, and a correlation module 25 that is responsive to the delayed signal at the output of delay unit 21 and to the signal of equation (25) that is extracted from the signals that the conventional GPS receiver creates in the course of determining its global position.
The correlation unit computes the integral of equation (26) with function S=function A(), and provides the developed value S to controller module 23. The correlation function provides an indication of the degree to which signal A, with some delay, is the same as signal B. When they are indeed the same, then the correlation outputs a high value, or a peak. Bogus signals, even when they are somewhat similar to the authentic signal, will result in lower correlation value regardless of what delay is chosen. One simple way, therefore, is to compare the strongest correlation peak to the next strongest peak. This is illustrated by the following function that module 23 executes:


	for δ (−N,+N, Δ N)
	do
	Call S=function A( δ )
	If S > S_{highWaterMark}then {
	S_nextHighest= S_{highWaterMark}
	S_{highWaterMark}= S }
	Done
	if (S_{highWaterMark}/S_nextHighest) > Threshold then output “OK”
	else output “NOT OK”
	end if

where N is greater than the expected delay difference (τ^B−τ^A) , and ΔN is the increment that a designer might choose to employ in seeking the maximum in the correlation function of equation (26). Of course, if unit 201 were to send the value of {circumflex over (τ)}^Balong with the signal of equation (24) then the range of N can be reduced significantly because it would be expected to find a maximum at δ=0.

It should be noted that the above is just one embodiment of the test that is performed on the correlation results. It may be noted, for example, that in embodiments that employ high sampling rates several large peaks may appear, but those peak are artifacts, and in such embodiments other tests are typically employed that factor in the sampling rate (as related to ΔN) and the relative position of the peaks, to determine which points to compare for the threshold.
It is recognized that in order to compute a global position, the signal of more than one satellite must be used. Therefore, authenticating the signal of one satellite, as disclosed above, does not, ipso facto, guarantee that unit 201 is not impacted by a bogus signal relative to the signal of another satellite that it is using for its global position computations. If it is so impacted, then one cannot trust its assertion regarding its global position. However, time can be divided into fairly long-duration frames, and during each frame a different one of the signals that unit 201 employs can be sent to unit 301 for authentication. If all of the signals are authenticated, then one can trust that the position asserted by unit 201 is valid in the sense that it has not been compromised by a hostile party causing it to receive bogus signals.
It should also be noted that the location can be computed using more than the minimum number of satellites (4 satellites to compute latitude, longitude, elevation and GPS time) and that not all of the satellite signals need to be authenticated. Having a majority of the signals authenticated can be used to test the consistency of non-authenticated signals, provided that the location estimate reported by unit 201 agrees with the location estimate developed using a subset of authenticated satellites.
Once confidence is gained about the signals provided by unit 201 that are used to compute a global position of unit 201 then one can also have confidence in an identification of the global position by unit 201 as asserted by unit 201. This assumes, of course, that unit 201 does compute its global position (in a completely conventional way) and reports its position to unit 301.
Alternatively, instead of trusting unit 201's assertion of its position, it is possible to have unit 301 compute the position of unit 201. This secure position determination is achieved by unit 201 sending the equation (24) signals of a number of satellites that is necessary to compute a position. Noting that the δ determined relative to a satellite informs of the transit delay from the satellite to unit 201 (τ^B=τ^A+δ), given a sufficient number of transit delays (combined with unit 301's global position and information about the satellites' locations) the global position of unit 201 can be ascertained through conventional calculations.
It may be appreciated that authenticating an asserted position, or securely determining a position, does not need to be done continually. At times the global position of unit 201 is immaterial. At other times, one can assume that unit 201 has not significantly wandered off the authenticated position. Therefore, in many applications it is acceptable if unit 201 sends only a signal segment, or snapshot, to unit 301. In other applications it may be advisable to send a signal snapshot on some regular basis.
It should be appreciated that the FIG. 4 arrangement where unit 201 is within computer 200 and utilizes the computing power that is otherwise available in the computer is merely illustrative. Unit 201 may have the full computing capabilities within itself (note the processor in unit 201), and it may be a stand-alone item, an item that is pluggable into a device such as portable 200, or it may be permanently (or semi-permanently) attached to an article and so transported from place to place; e.g., attached to a shipping container.
It should also be appreciated that unit 201 may contain a memory for storing one or more signal segments (raw, or processed), and the stored information may be communicated to unit 301 at some later time (i.e., a non-real time operation) by relatively direct connection; that is, without the use of a communication network that is shown in FIG. 4. The transfer of information may be initiated by a push-button switch in unit 201 (not explicitly shown in FIG. 4), by an electronic instruction from unit 301, by physically transferring the memory from unit 203 (see FIG. 7) to an appropriate connector on unit 301, or by some other conventional means.
The above discloses an arrangement where unit 201 sends to unit 301 the signal of equation (24), which is the signal after carrier wipeoff relative to satellite n. When sending the signals of M satellites, M such signals need to be sent. There are certainly applications where this is acceptable but if the N4 signals need to be sent concurrently, then the bandwidth of path 30 must be M times greater than the bandwidth required to send one signal.
In an alternative embodiment, shown in FIG. 6, rather than sending quadrature channel signal as described above, unit 201 sends to unit 302 the raw data and also sends the computed Doppler frequency and carrier phase estimates for at least each of the satellites that is used in computing its global position. The difference between unit 301 and 302 is that in unit 302 the raw data and the estimates are processed in processor 24 to develop the quadrature channel signal of equation (24). The bandwidth requirement (for sending the signal from unit 201 to unit 301) is essentially unchanged from the bandwidth needed for one satellite signal.
In some applications a small size for the device (unit 200 in FIG. 4) may be more important than the ability of the device to know its own global position. Indeed, in some applications it may be totally unimportant for the GPS receiver to know its location but, rather, it may suffice for the other receiver (e.g., unit 301 in FIG. 4) to know where unit 200 is, or has been. In other words, there are applications where it may not be necessary for the GPS receiver do the processing that is associated determining its global position. To that end, unit 203 (FIG. 7) needs to merely send its raw signal to receiver 303 (FIG. 7), or record signal segments internally for future delivery to unit 303.
Approach B
FIG. 7 depicts an arrangement with the GPS receiver 203 that is optionally devoid of the processing that involves carrier wipeoff and code wipeoff. The receiver, 203, only downshifts the received signal and sends this raw data to receiver 303 (without any delay, Doppler shift, or phase estimates), together, perhaps with some general information about its presumed (or asserted) location. The raw data might be sent immediately, or stored in a local memory, and sent at a later time. In other words, the signal that is provided to receiver 303 by receiver 203 is:
$\begin{matrix} S_{downshifted}^{A} = A^{A} D^{A} (t - τ^{A}) x_{C}^{A} (t - τ^{A}) \cos (2 π (f_{IF} + f_{D}^{A}) t + θ_{1}^{A}) + BD (t - τ^{A}) x_{Y}^{A} (t - τ^{A}) \sin (2 π (f_{IF} + f_{D}^{A}) t + θ_{1}^{A}) & (34) \end{matrix}$
and a rough location information which, from satellite orbit tables that are publicly Known, an estimate {circumflex over (f)}_D ^Ais obtained. The rough information may be in the form of an assertion as to the location of receiver 203. It is recognized that no information is available about the value of θ^A, and that the estimate {circumflex over (f)}_D ^Ais likely to be inaccurate but it is nevertheless helpful, as is demonstrated below. Absent information about θ^A, processor 24 executes non-coherent demodulation and multiplies the incoming signal by
cos 2π(f _1F+{circumflex over (F)}_D ^A)t+i sin2π(f _1F+{circumflex over (f)}_D ^A)t (35)
to result in
$\begin{matrix} A^{A} D^{A} (t - τ^{A}) x_{C}^{A} (t - τ^{A}) {\begin{matrix} \cos (2 π (2 f_{IF} + f_{D}^{A} + {\hat{f}}_{D}^{A}) t + θ_{1}^{A}) + \\ \cos (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A}) - \\  \sin (2 π (2 f_{IF} + f_{D}^{A} + {\hat{f}}_{D}^{A}) t + θ_{1}^{A}) + \\  \sin (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A}) \end{matrix}} + B^{A} D^{A} (t - τ^{A}) x_{Y}^{A} (t - τ^{A}) {\begin{matrix} \sin (2 π (2 f_{IF} + f_{D}^{A} + {\hat{f}}_{D}^{A}) t + θ_{1}^{A}) + \\ \sin (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A}) + \\  \cos (2 π (2 f_{IF} + f_{D}^{A} + {\hat{f}}_{D}^{A}) t + θ_{1}^{A}) - \\  \cos (2 π (f_{D}^{A} - {\hat{f}}_{D}^{A}) t + θ_{1}^{A}) \end{matrix}} & (36) \end{matrix}$
and recognizing that a later integration operation operates as a low pass filter that discards the signal components that include the 2f_1Ffrequency, equation (34) can be simplified to
S ₁ ^A +S _Q ^A=(W+X)+i(Y−Z) (37)
where
W=A ^A D ^A(t−τ ^A)x _C ^A(t−τ ^A)cos(2π(f _D ^A −{circumflex over (f)} _D ^A)t+θ ₁ ^A) (38)
X=B ^A D ^A(t−τ ^A)x_Y ^A(t−τ ^A)sin(2π(f _D ^A −{circumflex over (f)} _D ^A)t+θ ₁ ^A) (39)
Y=A ^A D ^A(t−τ ^A)x_C ^A(t−τ ^A)sin(2π(f _D ^A −{circumflex over (f)} _D ^A)t+θ ₁ ^A) (40)
and Z=B ^A D ^A(t−τ ^A)x_Y ^A(t−τ ^A)cos(2π(f _D ^A −{circumflex over (f)} _D ^A)t+θ ₁ ^A) (41)
Delay element 21 of FIG. 7 introduces delay δ, and element 26 in the FIG. 7 embodiment executes the integration
S=√{square root over (∫S₁ ^A(delayed)×S _Q ^B)²+(∫S _Q ^A(delayed)×S _Q ^B)²)}{square root over (∫S₁ ^A(delayed)×S _Q ^B)²+(∫S _Q ^A(delayed)×S _Q ^B)²)}. (42)
Noting that equation (25) specifies S_Q ^B, which can be expressed by
S _Q ^B =U+V
where
U=A ^B D ^B(t−τ ^B)x_C ^B(t−{circumflex over (τ)} ^B)sin(2π(f _D ^B −{circumflex over (f)} _D ^B)t+θ ₁ ^B−{circumflex over (θ)}₁ ^B) (43)
and V=−B ^B D ^B(t−τ ^B)x_Y ^B(t−{circumflex over (τ)} ^B)cos(2π(f _D ^B −{circumflex over (f)} _D ^B)t+θ ₁ ^B−{circumflex over (θ)}₁ ^B) (43)
equation (42) can be expressed as
$\begin{matrix} S = \sqrt{\begin{matrix} {(\int (W^{'} U + W^{'} V + X^{'} U + X^{'} V))}^{2} + \\ {(\int (Y^{'} U + Y^{'} V + Z^{'} U + Z^{'} V))}^{2} \end{matrix}} & (45) \end{matrix}$
where the primed variables (e.g., W′) are the delayed version of the unprimed variables (e.g., W).
A number of observations and approximations can be made that reduce the complexity of equation (45).

Since the approximations of the Doppler frequency and carrier phase shift for unit 303 signal are good, the U term can be replaced by 0, and the cos( ) term in the V term can be replaced by 1.
The W and the Y terms have the x_C ^A(t−τ ^A) code signal multiplier whereas the V term has the x_Y ^B(t−{circumflex over (τ)}^A) code signal multiplier, and since the two codes are orthogonal to each other, the contributions of the WV and the YV terms to the integral is roughly 0
As indicated above, the estimate {circumflex over (f)}_D ^Ais not necessarily an accurate estimate, but even it if a rough estimate, the resulting trigonometric function varies slowly relative to the chip rate of the Y code, which allows the non-trigonometric factors that are common to XV and ZV to be factored out, and then the sum of squared sin( ) and cos( ) terms that remain can be replaced by 1.

The above allows reducing equation (45) to
S=B ^A B ^B ∫D ^A( t−τ ^A−δ)D ^B(t−τ ^B)x _Y ^A(t−τ ^A−δ)x _Y ^B(t−{circumflex over (τ)} ^B), (46)
so it is quite clear that the integration result exhibits a maximum when τ^A+δ={circumflex over (τ)}^Band the code x_Y ^A(t)=x_x ^B(t).
As before, controller 23 finds the delay δ that provides the peak value of S, and compares it to other values in order to determine whether the signal send by unit 203 contains a bona fide signal from that particular satellite for which the processing operation of equation (46) was just executed.
Needless to say, Approaches A and B, described above, are simply two preferred implementations and many variations exist. For example, unit 201 could send C/A code information as well as Y code information. In this case, unit 301 could determine the relative timing, δ=τ^B−τ^A, for the C/A code as well as the Y code and insist that they agree. Other variations exist. Under Approach A, unit 201 performs code and carrier wipeoff and unit 301 coherently demodulates the data. Under Approach B, unit 201 does not perform code or carrier wipeoff. Rather, it sends, more primitive, downshifted data, and unit 301 performs non-coherent demodulation. This pairing is mutable. In other words, unit 201 could send downshifted data and unit 301 could perform coherent demodulation.
The software with which one might wish to implement a particular embodiment of the invention disclosed herein is fairly simple to implement; though, of course, it takes time to create, as all software does. Notwithstanding the fact that the software needed to implement the invention disclosed herein is totally straight forward and can be easily implemented without undue experimentation by any person skilled in the art, to assist the reader, an appendix is included herein of all actual embodiment.
The above illustrative embodiment has the first receiver in a portable computer and the second receiver in gateway that is remote from the portable computer. Perhaps it should be mentioned explicitly that the assumption is that the signal received by receiver 301 is not impacted by a bogus signal to which the portable computer may be subjected. A mere physical separation, when it is big enough so that the receivers are not subjected to the signal of a given (bogus) source, tends to insure this situation because a hostile party is not likely to be able to send a bogus signal to portable 200 and to also send an appropriate replica of the same bogus signal to receiver 301. Additionally, receiver 301 can take steps to insure that this does not happen by, for example, using antennas that are electronically directed to respond well to signals only from certain directions (where the satellites are expected to be) and to not respond well to signals from other directions.
The above illustrative embodiment focuses on the processing being done in gateway 300. This makes sense for the illustrative embodiment, but it should be realized that other embodiments are certainly possible where it may be desirable to perform the processing in a moving unit that contains the receivers that outputs signal A and which potentially is under electronic attack (e.g., an airplane), for example, where the action in response to the authentication takes place in moving unit and/or when there are so many moving units that processing in the unit that generates signal B might overload the capability of the processor that is available at that location.
It should also be noted that the receiver that generates signal B does not need to be stationary because, as indicated above, mutual authentication is possible if the distance between the two receivers is big enough so that the receivers are not subjected to the signal of a given (bogus) source.
The above illustrative embodiment is a two party example (portable 200 and gateway 300). FIG. 8 presents an illustrative example of a three party embodiment, involving a supplicant (e.g., portable 200), a resource (e.g., gateway 300) and an authentication authority. Signal A is provided by the supplicant, signal B is provided by the authentication authority and the processing is performed in any of the three locations, depending on the particular application and the desires of the parties. It may be noted that just as there is a memory in unit 201 of FIG. 4 for storing time segments of data, unit 301 can also include a memory for storing raw or processed data; particularly for applications where the at least some of the authentication processing is perform in other than the authentication authority.
One advantage of the FIG. 8 embodiment is that it efficiently supports many supplicant-resource pairs because it requires no GPS receiving or sophisticated processing by the resource, and because the authentication authority can afford to make greater efforts to insure that its signal B is authentic. For example, the supplicants can be bank customers, and the resources can be banks. High powered satellite antennas that are highly directional are expensive, and banks generally would be happy to not have to invest in such antennas but allow an authentication authority to guarantee that signal B is authentic. The authentication authority, on the other hand, can afford to employ expensive antenna arrangements and other techniques to insure the bona fide of signal B because the cost may be amortized over many customers of the authentication authority.
In addition (or in lieu of) using very directional antennas, the authentication authority can be located at some physically remote location that is secure from transmission by hostile parties. The remoteness makes it more likely than not that a hostile party will not succeed in transmitting to the directional antennas, and it will almost certainly ensure that whatever hostile signal is transmitted to units 201 will not correspond to the hostile signals to which the authentication authority might be subjected. By contrast, banks are situated in locations that are readily accessible to all.
Further, the authentication authority can be located permanently at its secure location and can make the effort to know its own global position with great accuracy, in contrast to banks that sometimes change locations. This allows the authentication authority to compute its location from the received signals and by comparing the computed location with the known location it can confirm that its received signals are bona fide. Moreover, since the authentication of a location is effectively decided by comparing an asserted location to a location computed relative to the location of the authentication authority, an accurate location of the authentication authority is important.
Further still, the authentication authority can itself receive other signals that it can process to confirm the bona fide of its signal B—for example, from locations that are greatly removed from the authentication authority location that receives signal B, or from other systems (e.g., LORAN).
In yet another improvement, the authentication authority has a number of facilities, at different locations around the globe, and the signal B that is used for processing is from a location that is selected truly randomly (in contrast to pseudorandomly) from among the different locations.
It should be noted that in the above example of bank customers, banks, and an authentication authority, the banks may be satisfied to direct customers to send signal A to the authentication authority and have the authentication authority provide the bank (via a securely transmitted message) the location of the supplicant customer and a confirmation that the location is authentic. Presumably, this would allow the bank to proceed with the transaction in which the bank customer wishes to engage. On the other hand, the bank may wish to merely receive signal B from the authentication authority and itself accept signal A from its customers and itself do the processing. In the first case, the processing is done at the authentication authority, while in the second case the processing is done at the resource.
Thus useful embodiments exist where the processing is performed in the supplicant's equipment, in the resource's equipment, or in the authentication authority equipment.
By way of example and not by way of limitation, the following illustrates a number of applications, in addition to the applications described above, to which the principles disclosed herein are applicable.

Information & Asset Protection: Determine location of a device, such as portable computer 201, and allow operation of that device or access to sensitive information on the device only if the device is at an authorized location or within an authorized zone.
Financial Transaction assurance: Verify that the person (or agent) at the other end of a communication channel is really who the person claims to be, by verifying that the communication originates from a known, authorized, and secure location.
Fraud Detection & Non-repudiation: Check whether a transaction originated from where it claims to have originated, and thereby acquire a confirmation that a document to which an electronic signature is affixed (or other means of verifying a transaction/communication) really did originate from where the message claims to have originated.
Asset Tracking & Route Auditing: Confirm where an object is and/or recreate the route that the object followed during a chosen time span (e.g., while being transported)—by recording signal segments and later processing the signal segments.
Internet & Online Security: Confirm that a party that provides information or seeks information (e.g., a web server) is located at a particular spot, which location presumably can be checked against online public databases or printed (and presumably secure/unmodified) versions of databases.
Secure Electronic communication: Use location to verify identity and to increase security of cryptographic key exchange between two or more parties. This includes distribution of encryption/decryption keys (either symmetric or asymmetric), where only a supplicant with the correct geo-location can obtain the cryptographic key; or even more securely, where the key is never communicated directly, even in encrypted form, and only a supplicant with the correct geo-location can determine the cryptographic key.
Smartcards & Access Control: Confirm location during an access-request transaction with a centralized access-granting authority.


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%	%
%	%
% CarrierWipeoff.m	%
%	%
% Carrier wipeoff for two-receiver P(Y)-code correlation.	%
% David S. De Lorenzo	%
%	%
% This function either performs exact carrier wipeoff using	%
% Doppler and carrier-phase estimates from signal tracking _OR_—	%
% performs approximate carrier wipeoff using a Doppler estimate	%
% from acquisition or A-GPS-like aiding.	%
% From exact carrier wipeoff, the C/A-code is isolated to the	%
% inphase I-channel while the P(Y)-code, being in phase	%
% quadrature, is isolated to the quadrature Q-channel;	%
% correlation processing therefore can select the Q-channel	%
% only for detection of the presence of P(Y)-code modulation.	%
% From approximate carrier wipeoff, the C/A-code and the	%
% P(Y)-code are not isolated to I/Q-channels; correlation	%
% processing must utilize both the I-channel and the Q-channel	%
% for detection of P(Y)-code modulation - and must rely on the	%
% signal from the other receiver to have undergone exact	%
% carrier wipeoff.	%
%	%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%	%

clear

exactDopplerWipeoff = ‘yes’;

% exactDopplerWipeoff = ‘no’;

load(‘trackResults_SU_1645_PRN23_1_2sec_CA_FRPA.mat’)

fidIn	= fopen(‘SU_1645_1’, ‘r’);
fidOut	= fopen(‘SU_1645_PRN23_2sec_CarrierWipeoff_IQ’, ‘w’);

% Skip samples at begining of file

fseek(fidIn, settings.bytesToSkip, ‘bof’);

% Skip samples from acquisition

% *** this only works if a cold-start acquisition was performed ***

% 1 or 2 for real/complex dataType

% 4 for ‘float32’ dataFormat

%

2 for number of acquisition blocks

if strcmp(settings.dataType, ‘complex’)

fseek(fidIn, 2*4*2*settings.samplesPer1ms* ...

settings.acqMsToProcess, ‘cof’);

elseif strcmp(settings.dataType, ‘real’)

fseek(fidIn, 1*4*2*settings.samplesPer1ms* ...

settings.acqMsToProcess, ‘cof’);

end

% Relative time/phase of each sample point w.r.t. the sampling epoch

timePoints	= (0:settings.samplesPer1ms−1) / settings.samplingFreq;
phasePoints	= 2 * pi * timePoints;

% Loop over blockNumber

for blockNumber = 1:settings.msToProcess−1,

if mod(blockNumber,100) == 1, disp(blockNumber), end

if strcmp(settings.dataType, ‘complex’)

% Read complex data as 2 rows of real-valued matrix

dataInTemp = ...

fread(fidIn, [2 settings.samplesPer1ms], ‘float32’);

% Build complex-valued data array

dataIn = complex(dataInTemp(1,:), dataInTemp(2,:));

elseif strcmp(settings.dataType, ‘real’)

% Read data as 1 row of real-valued matrix

dataIn = ...

fread(fidIn, [1 settings.samplesPer1ms], ‘float32’);

end

% Set value of carrier-phase and carrier frequency for this epoch

if blockNumber == 1

if strcmp(exactDopplerWipeoff, ‘yes’)

% Based on acquisition results

carrierFreq

= ...

acqResults.carrierFreq(trackResults.PRN);

carrierPhaseInt

= ...

acqResults.carrierPhase(trackResults.PRN);

carrierPhase

= mod(carrierPhaseInt, 2*pi);

elseif strcmp(exactDopplerWipeoff, ‘no’)

% Based on A-GPS estimates

carrierFreq

= ...

round(mean(trackResults.carrierFreq(end-500:end)));

carrierPhaseInt	= 0; % user specified value
carrierPhase	= mod(carrierPhaseInt, 2*pi);

end

else

% Based on propogated value of carrier-phase

carrierPhaseInt

= carrierPhaseInt + ...

2 * pi * settings.samplesPer1ms * ...

carrierFreq / settings.samplingFreq;

carrierPhase

= mod(carrierPhaseInt, 2*pi);

if strcmp(exactDopplerWipeoff, ‘yes’)

% Use ‘exact’ Doppler estimate from PLL

carrierFreq

= ...

1/2 * (trackResults.carrierFreq(blockNumber−1) + ...

trackResults.carrierFreq(blockNumber));

elseif strcmp(exactDopplerWipeoff, ‘no’)

% Use approximate Doppler, like if we had A-GPS

carrierFreq

= carrierFreq;

end

% Create the I & Q mixing vector (complex)

IQ = exp(−j * (carrierFreq * phasePoints + carrierPhase));

% Wipeoff the carrier (complex)

dataInIQ = IQ .* dataIn;

% Build real-valued data matrix

dataOut = [real(dataInIQ); imag(dataInIQ)];

% Write complex data as 2 rows of real-valued matrix

fwrite(fidOut, dataOut, ‘float32’);

end

% Close all files

fclose(‘all’);

figure(1)

subplot(2,1,1)

plot(real(dataInIQ))

subplot(2,1,2)

plot(imag(dataInIQ))

figure(2)

subplot(2,1,1)

hist(real(dataInIQ), 100)

subplot(2,1,2)

hist(imag(dataInIQ), 100)

CA	= settings.codeTable(trackResults.PRN,:);
codePts	= settings.codeFreq * settings.timePoints − ...
	acqResults.codePhase(trackResults.PRN);

replicaPrompt = CA(floor(mod(codePts, settings.chipsPer1ms)) + 1);

figure(11)

subplot(2,1,1)

plot(xcorr(replicaPrompt,real(dataInIQ)))

subplot(2,1,2)

plot(xcorr(replicaPrompt,imag(dataInIQ)))

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%	%
%	%
% AuthenticationDopplerSearchAndCorrelate.m	%
%	%
% Two-receiver P(Y)-code correlation using approximate Doppler.	%
% David S. De Lorenzo	%
%	%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%	%

clear

comparison = ‘dish2patch’;

% comparison = ‘patch2patch’;

% The following settings are user-specified values to perform rough

% alignment between Reference Station data file and User Device data

% file, as well as to control the size of the window over which to

% search in the Reference Station and the integration time for the

% two-receiver P(Y)-code correlation search.

if strcmp(comparison, ‘dish2patch’)

skip_ReferenceStation	= 1000; % ms to skip in ref station data
skip_UserDevice	= 600; % ms to skip in user device data
read_ReferenceStation	= 250; % data window at reference station
read_UserDevice	= 100; % data window at user device

elseif strcmp(comparison, ‘patch2patch’)

skip_ReferenceStation	= 1000; % ms to skip in ref station data
skip_UserDevice	= 800; % ms to skip in user device data
read_ReferenceStation	= 250; % data window at reference station
read_UserDevice	= 100; % data window at user device

end

%--- Load settings --------------------------------------------------%

if strcmp(comparison, ‘dish2patch’)

load(‘trackResults_SU_1645_PRN23_1_2sec_CA_FRPA.mat’, ‘settings’)

elseif strcmp(comparison, ‘patch2patch’)

load(‘trackResults_SU_1545_PRN23_1_2sec_CA_FRPA.mat’, ‘settings’)

end

samplingFreq	= settings.samplingFreq;
samplesPer1ms	= settings.samplesPer1ms;
dataType	= settings.dataType;
dataFormat	= settings.dataFormat;

clear(‘settings’)

%--- Load tracking results (need it for Doppler search) -------------%

if strcmp(comparison, ‘dish2patch’)

load(‘trackResults_CU_1645_PRN23_1_2sec_CA_FRPA.mat’, ...

‘trackResults’)

elseif strcmp(comparison, ‘patch2patch’)

load(‘trackResults_CU_1545_PRN23_1_2sec_CA_FRPA.mat’, ...

‘trackResults’)

end

trackResults_UserDevice = trackResults;

clear(‘trackResults’)

%--- Reference Station ----------------------------------------------%

% Open post-wipeoff data file for Reference Station

if strcmp(comparison, ‘dish2patch’)

fid_ReferenceStation = ...

fopen(‘SU_1645_PRN23_2sec_CarrierWipeoff_IQ’, ‘r’);

elseif strcmp(comparison, ‘patch2patch’)

fid_ReferenceStation = ...

fopen(‘SU_1545_PRN23_2sec_CarrierWipeoff_IQ’, ‘r’);

end

% Skip samples

% 2 for complex dataType

% 4 for ‘float32’ dataFormat

if strcmp(dataType, ‘complex’) && strcmp(dataFormat, ‘float32’)

fseek(fid_ReferenceStation, ...

2*4*skip_ReferenceStation*samplesPer1ms, ‘cof’);

else

disp(‘error’)

end

% Read samples

data_ReferenceStation = fread(fid_ReferenceStation, ...

[2 read_ReferenceStation*samplesPer1ms], dataFormat);

data_ReferenceStation = complex(data_ReferenceStation(1,:), ...

data_ReferenceStation(2,:));

% FFT

data_ReferenceStation_FFT_Qchannel = fft(imag(data_ReferenceStation));

%--- User Device ----------------------------------------------------%

% Open raw data file for User Device

if strcmp(comparison, ‘dish2patch’)

fid_UserDevice = fopen(‘CU_1645_1’, ‘r’);

elseif strcmp(comparison, ‘patch2patch’)

fid_UserDevice = fopen(‘CU_1545_1’, ‘r’);

end

% Skip samples

% 2 for complex dataType

% 4 for ‘float32’ dataFormat

if strcmp(dataType, ‘complex’) && strcmp(dataFormat, ‘float32’)

fseek(fid_UserDevice, 2*4*skip_UserDevice*samplesPer1ms, ‘cof’);

else

disp(‘error’)

end

% Read samples

data_UserDevice = fread(fid_UserDevice, ...

[2 read_UserDevice*samplesPer1ms], dataFormat);

data_UserDevice = complex(data_UserDevice(1,:), ...

data_UserDevice(2,:));

%--- Doppler Search -------------------------------------------------%

% Relative time/phase of each sample point w.r.t. the sampling epoch

timePoints	= (0:length(data_UserDevice)−1) / samplingFreq;
phasePoints	= 2 * pi * timePoints;

% Doppler center frequency and search bin spacing

carrierFreqCenter

= ...

mean(trackResults_UserDevice.carrierFreq(end−1000:end));

dopplerBinHz

= (1/5 / read_UserDevice) * 1000;

% Dimension results storage

results	= zeros(21,length(data_ReferenceStation_FFT_Qchannel)/100);
resultsMax	= zeros(size(data_ReferenceStation_FFT_Qchannel));

% Loop over Doppler estimate

for binNum

= −10:10,

disp([‘search bin number ‘ num2str(binNum + 11) ’ of 21’])

carrierFreq = carrierFreqCenter + binNum * dopplerBinHz;

% Create the I & Q mixing vector (complex)

IQ = exp(−j * carrierFreq * phasePoints);

% Wipeoff the carrier (complex)

data_UserDeviceIQ = IQ .* data_UserDevice;

% Correlate with Reference Station Q-channel

c = abs(ifft( ...

fft([imag(data_UserDeviceIQ) ...

zeros(1,length(data_ReferenceStation_FFT_Qchannel) − ...

length(data_UserDeviceIQ))]) .* ...

conj(data_ReferenceStation_FFT_Qchannel)));

[y,ii] = max(c);

results(binNum+11,:) = c(mod(ii,100):100:end);

if y > max(resultsMax)

resultsMax = c;

end

% Plot mesh of results

figure(1)

mesh((1:100:length(data_ReferenceStation)) / samplingFreq, ...

carrierFreqCenter + (−10:10)*dopplerBinHz, ...

results)

% Plot 2D results

figure(2)

plot((1:length(data_ReferenceStation)) / samplingFreq, resultsMax)

fclose(‘all’);

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%	%
%	%
% AuthenticationExactDopplerAndCorrelate.m	%
%	%
% Two-receiver P(Y)-code correlation using exact Doppler & phase.	%
% David S. De Lorenzo	%
%	%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%	%

clear

comparison = ‘dish2patch’;

% comparison = ‘patch2patch’;

% The following settings are user-specified values to perform rough

% alignment between Reference Station data file and User Device data

% file, as well as to control the size of the window over which to

% search in the Reference Station and the integration time for the

% two-receiver P(Y)-code correlation search.

if strcmp(comparison, ‘dish2patch’)

elseif strcmp(comparison, ‘patch2patch’)

end

%--- Load settings --------------------------------------------------%

if strcmp(comparison, ‘dish2patch’)

load(‘trackResults_SU_1645_PRN23_1_2sec_CA_FRPA.mat’, ‘settings’)

elseif strcmp(comparison, ‘patch2patch’)

load(‘trackResults_SU_1545_PRN23_1_2sec_CA_FRPA.mat’, ‘settings’)

end

clear(‘settings’)

%--- Reference Station ----------------------------------------------%

% Open post-wipeoff data file for Reference Station

if strcmp(comparison, ‘dish2patch’)

fid_ReferenceStation = ...

fopen(‘SU_1645_PRN23_2sec_CarrierWipeoff_IQ’, ‘r’);

elseif strcmp(comparison, ‘patch2patch’)

fid_ReferenceStation = ...

fopen(‘SU_1545_PRN23_2sec_CarrierWipeoff_IQ’, ‘r’);

end

% Skip samples

% 2 for complex dataType

% 4 for ‘float32’ dataFormat

if strcmp(dataType, ‘complex’) && strcmp(dataFormat, ‘float32’)

fseek(fid_ReferenceStation, 2*4*skip_ReferenceStation* ...

samplesPer1ms, ‘cof’);

else

disp(‘error’)

end

% Read samples

data_ReferenceStation = fread(fid_ReferenceStation, ...

[2 read_ReferenceStation*samplesPer1ms], dataFormat);

data_ReferenceStation = complex(data_ReferenceStation(1,:), ...

data_ReferenceStation(2,:));

% FFT

data_ReferenceStation_FFT_Ichannel = fft(real(data_ReferenceStation));

data_ReferenceStation_FFT_Qchannel = fft(imag(data_ReferenceStation));

%--- User Device ----------------------------------------------------%

% Open post-wipeoff data file for User Device

if strcmp(comparison, ‘dish2patch’)

fid_UserDevice = ...

fopen(‘CU_1645_PRN23_2sec_CarrierWipeoff_IQ’, ‘r’);

elseif strcmp(comparison, ‘patch2patch’)

fid_UserDevice = ...

fopen(‘CU_1545_PRN23_2sec_CarrierWipeoff_IQ’, ‘r’);

end

% Skip samples

% 2 for complex dataType

% 4 for ‘float32’ dataFormat

if strcmp(dataType, ‘complex’) && strcmp(dataFormat, ‘float32’)

fseek(fid_UserDevice, 2*4*skip_UserDevice*samplesPer1ms, ‘cof’);

else

disp(‘error’)

end

% Read samples

data_UserDevice = fread(fid_UserDevice, ...

[2 read_UserDevice*samplesPer1ms], dataFormat);

data_UserDevice = complex(data_UserDevice(1,:), ...

data_UserDevice(2,:));

%--- Correlation ----------------------------------------------------%

% Correlate with Reference Station I-channel

resultsI = abs(ifft( ...

fft([real(data_UserDevice) ...

zeros(1,length(data_ReferenceStation_FFT_Ichannel) − ...

length(data_UserDevice))]) .* ...

conj(data_ReferenceStation_FFT_Ichannel)));

% Correlate with Reference Station Q-channel

resultsQ = abs(ifft( ...

fft([imag(data_UserDevice) ...

zeros(1,length(data_ReferenceStation_FFT_Qchannel) − ...

length(data_UserDevice))]) .* ...

conj(data_ReferenceStation_FFT_Qchannel)));

%--- Plotting -------------------------------------------------------%

% Plot 2D results - I-channel --> should show no correlation peak

figure(3)

plot((1:length(data_ReferenceStation)) / samplingFreq, resultsI)

% Plot 2D results - Q-channel --> should show P(Y)-code peak

figure(4)

plot((1:length(data_ReferenceStation)) / samplingFreq, resultsQ)

fclose(‘all’);

Claims

1. An arrangement comprising:

a first receiver for receiving at least one signal from a source, which signal contains an unknown signal that is altered in course of transition from said source to said first receiver;

a second receiver for receiving at least one signal that purportedly is from said source and is altered in course of transition from said source to said second location; and

a processor for processing a signal portion of said at least one signal received by said first receiver and a signal portion from said at least one signal received by said second receiver.

2. The arrangement of claim 1 where said first receiver is adapted to ensure that each of said at least one signal originates from a satellite.

3. The arrangement of claim 2 where said first receiver employs a directional antenna.

4. The arrangement of claim 1 where said processing determines whether said second signal does originate from said source.

5. The arrangement of claim 4 where, in determining whether said second signal does originate from said source, said processing determines whether the unknown signal contained in said at least one signal received by said first receiver, corresponds to the unknown signal contained in said at least one signal received by said second receiver.

6. The arrangement of claim 5 where said determining whether the unknown signal contained in said at least one signal received by said First receiver corresponds to the unknown signal contained in said at least one signal received by said second receiver involves a correlation operation.

7. The arrangement of claim 4 where said processing further determines global position of said second receiver relative to global position of said first receiver.

8. The arrangement of claim 4 where the second location is significantly different from said first location.

9. The arrangement of claim 4 where said processing is at a situs of said second receiver.

10. The arrangement of claim 1 where said processing is at a situs of said first receiver.

11. The apparatus of claim 1 where said processing is at a situs other than situs of said first receiver or situs of said second receiver.