RFC 7183

Integrity Protection for the Neighborhood Discovery Protocol (NHDP) and Optimized Link State Routing Protocol Version 2 (OLSRv2)

πŸ“… published April 2014, from ietf

RFC 7183 πŸ’– Okay bestie, this is the one where the MANET routing folks finally said "we need to stop anyone from faking our messages." πŸ”₯

Authors: U. Herberg (Fujitsu Laboratories of America), C. Dearlove (BAE Systems ATC), and T. Clausen (LIX, Ecole Polytechnique) 🧚

Category: Standards Track ✨ ISSN: 2070-1721 🌈 Date: April 2014 πŸ“…

Updates: RFC 6130 and RFC 7181 πŸ¦‹ It's an upgrade to two existing protocols, so they're getting a bigger security glow-up πŸ’…

Publishing body: Internet Engineering Task Force (IETF) πŸ’œ


Abstract ✨

Okay so this doc spells out integrity and replay protection for the Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP) and the Optimized Link State Routing Protocol version 2 (OLSRv2). 🫢 The protection comes from two TLVs: an HMAC-SHA-256 Integrity Check Value (ICV) TLV and a Timestamp TLV based on Portable Operating System Interface (POSIX) time. It's giving layered security πŸ”

The same mechanism can also be used by other protocols that use the generalized packet/message format from RFC 5444. Main character energy, honestly πŸ‘‘

It also updates RFC 6130 and RFC 7181, which means it makes implementing this integrity and replay protection mandatory in NHDP and OLSRv2. No skipping it, periodt πŸ’…

Status of This Memo ⭐

This is an Internet Standards Track document. πŸŽ€

This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It went through public review and got approved for publication by the Internet Engineering Steering Group (IESG). Everyone agreed, it's iconic 🌸 If you want more on Internet Standards, check out Section 2 of RFC 5741.

Want the current status, any errata, or a way to give feedback? Head to http://www.rfc-editor.org/info/rfc7183 πŸ’Œ

Copyright (c) 2014 IETF Trust and the persons identified as the document authors. All rights reserved. πŸ”’

This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please read these carefully, because they describe your rights and restrictions for this document. πŸ“œ Code Components pulled out of this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions, and they come without warranty as described in the Simplified BSD License. πŸ“

Table of Contents πŸ—ΊοΈ

1. Introduction ....................................................3
2. Terminology .....................................................4
3. Applicability Statement .........................................5
4. Protocol Overview and Functioning ...............................6
5. Parameters ......................................................7
6. Message Generation and Processing ...............................9
   6.1. Message Content ............................................9
   6.2. Message Generation ........................................10
   6.3. Message Processing ........................................11
        6.3.1. Validating a Message Based on Timestamp ............11
        6.3.2. Validating a Message Based on Integrity Check ......12
7. Provisioning of Routers ........................................12
8. Security Considerations ........................................12
   8.1. Mitigated Attacks .........................................13
        8.1.1. Identity Spoofing ..................................13
        8.1.2. Link Spoofing ......................................13
        8.1.3. Replay Attack ......................................13
   8.2. Limitations ...............................................13
9. Acknowledgments ................................................14
10. References ....................................................14
    10.1. Normative References .....................................14
    10.2. Informative References ...................................14

1. Introduction 🌷

Here's the tea: this spec updates [RFC6130] and [RFC7181] by defining mandatory-to-implement security mechanisms for integrity and replay protection. πŸ”₯ A deployment is allowed to pick something else instead. For example, it could protect packets rather than messages, use a different Integrity Check Value (ICV) with properties it likes better, and/or use a different timestamp. A deployment may choose to use no such security mechanisms, but this is not recommended. πŸ™ˆ Not me saying that's a good plan.

The mechanisms here are an ICV that protects the protocols' control messages, plus timestamps in those messages to stop replay attacks. Both ride along using the TLV mechanism from [RFC5444]. The ICV and TIMESTAMP TLVs themselves are defined in [RFC7182] ✨

There are different ICV TLVs for HELLO messages in NHDP and TC (Topology Control) messages in OLSRv2. The HELLO one also protects the source address of the IP datagram carrying it. Why? NHDP uses that source address to figure out a neighbor interface's address, and the address isn't always in the HELLO message anywhere else. OLSRv2's TC message gets forwarded in a brand-new packet, so it doesn't have one single IP datagram source address. Lowkey logical, right? 🧚

This mechanism sits in the packet/message processing flow the way Figure 1 shows. It lives between the packet parsing/generation function from [RFC5444] and the message processing/generation function of NHDP and OLSRv2. πŸ¦‹

                          |                        |
               Incoming   |                       /|\ Outgoing
                packet   \|/                       |   packet
                          |                        |
                      +--------------------------------+
                      |                                |
                      |        RFC 5444 packet         |
                      |       parsing/generation       |
                      |                                |
                      +--------------------------------+
                          |                        |
               Messages   |                       /|\ Messages with
                         \|/                       |  added TLVs
                          |                        |
D                      +--------------------------------+
R  /__________________ |                                |
O  \      Messages     |     Mechanism specified in     |
P      (failed check)  |         this document          |
                      |                                |
                      +--------------------------------+
                          |                        |
             Messages     |                       /|\ Messages
          (passed check) \|/                       |
                          |                        |
                      +--------------------------------+
                      |                                |
                      |      NHDP/OLSRv2 message       |
                      |     processing/generation      |
                      |                                |
                      +--------------------------------+

       Figure 1: Relationship with RFC 5444 and NHDP/OLSRv2

2. Terminology πŸ“–

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in [RFC2119]. πŸ’… Those are the official BCP 14 vibes, so read them carefully.

On top of that, this doc uses the terminology and notation from [RFC5444], [RFC6130], [RFC7181], and [RFC7182]. Bring your notes, bestie πŸ“

3. Applicability Statement 🎯

Here's the situation: [RFC6130] and [RFC7181] let extensions add new reasons for rejecting a message as "badly formed and therefore invalid for processing." They even name security (integrity protection) as an example. This document is the mechanism that actually delivers that. ✨

Implementations of [RFC6130] and [RFC7181] MUST include this mechanism. Deployments of [RFC6130] and [RFC7181] SHOULD use it, unless a different security mechanism is a better fit. 🌟

The applicability of this mechanism depends on what it's like, and here's the list:

  • It specifies a security mechanism that conforming implementations of [RFC6130] and [RFC7181] are required to include. πŸ”
  • It associates ICVs with protocol messages, and it says how to treat a missing or invalid ICV as a reason to reject a message as "badly formed and therefore invalid for processing." 🚫
  • It implements an ICV Message TLV, defined in [RFC7182], using a SHA-256-based Hashed Message Authentication Code (HMAC) applied to the right message contents. For HELLO messages, the IP datagram source address gets included too. Implementations of [RFC6130] and [RFC7181] MUST support an HMAC-SHA-256 ICV TLV, and deployments SHOULD use it unless a different algorithm is more appropriate. An implementation MAY use more than one ICV TLV in a message, as long as each one uses a different algorithm or key to calculate the ICV. πŸ¦‹
  • It implements a TIMESTAMP Message TLV, defined in [RFC7182], to provide message replay protection. Implementations of [RFC6130] and [RFC7181] using this mechanism MUST support a timestamp based on POSIX time. Deployments SHOULD use it if the clocks in all routers in the network can be synchronized with sufficient precision. ⏰
  • It assumes that a router able to generate correct integrity check values is considered trusted. 🫑

Now the stuff this mechanism does NOT do, which is just as important 😭

  • It doesn't specify which key identifiers to use in a MANET where the routers share more than one secret key. (Those keys get told apart using the <key-id> field defined in an ICV TLV in [RFC7182].) πŸ”‘
  • It doesn't specify how to distribute cryptographic material (shared secret key(s)). πŸ“¦
  • It doesn't specify how to detect compromised routers that still have valid keys. πŸ•΅οΈ
  • It doesn't specify how to handle (revoke) compromised routers that still have valid keys. 🚷

That's the first third, bestie. More parts are on the way, so stay tuned! πŸŒˆπŸ’–

4. Protocol Overview and Functioning ✨

okay so this mechanism gives you the following functionalities for use with messages from [RFC6130] and [RFC7181] πŸ’…

  • Generating ICV Message TLVs (as defined in [RFC7182]) to include in an outgoing message. An implementation of [RFC6130] and [RFC7181] MAY use more than one ICV TLV in a message, even with the same type extension, but these ICV TLVs MUST each use different keys or they MUST use a different algorithm to calculate the ICV, e.g., with different hash and/or cryptographic functions when using type extension 1 or 2. An implementation of [RFC6130] and [RFC7181] MUST at least be able to generate an ICV TLV using HMAC-SHA-256 and one or more secret keys shared by all routers.
  • Generating TIMESTAMP Message TLVs (as defined in [RFC7182]) to include in an outgoing message. An implementation of [RFC6130] and [RFC7181] MAY use more than one ICV TLV in a message, but it MUST NOT use the same type extension. An implementation of [RFC6130] and [RFC7181] that is able to synchronize the clocks in all routers in the network with sufficient precision MUST at least be able to generate a TIMESTAMP TLV using POSIX time.
  • Verifying ICV Message TLVs contained in a message, so the router can decide if the message MUST be rejected as "badly formed and therefore invalid for processing" [RFC6130] [RFC7181]. An implementation of [RFC6130] and [RFC7181] MUST at least be able to verify an ICV TLV using HMAC/SHA-256 and one or more secret keys shared by all routers.
  • Verifying TIMESTAMP Message TLVs (as defined in [RFC7182]) contained in a message, to figure out if that message MUST be rejected as "badly formed and therefore invalid for processing" [RFC6130] [RFC7181]. An implementation of [RFC6130] and [RFC7181] that is able to synchronize the clocks in all routers in the network with sufficient precision MUST at least be able to verify a TIMESTAMP TLV using POSIX time.

ICV Packet TLVs (as defined in [RFC7182]) MAY be used by a deployment of the multiplexing process defined in [RFC5444], either as well as or instead of the protection of the NHDP and OLSRv2 messages. (Note that in the case of NHDP, the packet protection is equally good, and also protects the packet header. In the case of OLSRv2, the packet protection has different properties than the message protection, especially for some forms of ICV. When packets contain more than one message, the packet protection has lower overheads in space and computation time.) 🧚

When a router generates a message on a MANET interface, this mechanism:

  • Specifies how to calculate an ICV for the message.
  • Specifies how to include that ICV using an ICV Message TLV.

[RFC6130] and [RFC7181] allow for the rejection of incoming messages prior to processing by NHDP or OLSRv2. This mechanism, when used, specifies that a message MUST be rejected if the ICV Message TLV is absent, or its value cannot be verified. Note that this means that routers whose implementation of NHDP and/or OLSRv2 does not include this specification will be ignored by routers using this mechanism, and these two sets of routers will, by design, form disjoint MANETs. (The unsecured MANET will retain some information about the secured MANET, but be unable to use it, not having any recognized symmetric links with the secured MANET.) πŸ₯Ί


5. Parameters

The following router parameters are specified for use by the two protocols; the first is required only by NHDP, but may be visible to OLSRv2, the second is required only by OLSRv2: 🌸

  • MAX_HELLO_TIMESTAMP_DIFF: the maximum age that a HELLO message to be validated may have. If the current POSIX time of the router validating the HELLO message, minus the timestamp indicated in the TIMESTAMP TLV of the HELLO message, is greater than MAX_HELLO_TIMESTAMP_DIFF, the HELLO message MUST be silently discarded.
  • MAX_TC_TIMESTAMP_DIFF: the maximum age that a TC message to be validated may have. If the current POSIX time of the router validating the TC message, minus the timestamp indicated in the TIMESTAMP TLV of the TC message, is greater than MAX_TC_TIMESTAMP_DIFF, the TC message MUST be silently discarded.

The following constraints apply to these parameters:

  • MAX_HELLO_TIMESTAMP_DIFF > 0
  • MAX_TC_TIMESTAMP_DIFF > 0

However, these bounds are insufficient: MAX_HELLO_TIMESTAMP_DIFF and MAX_TC_TIMESTAMP_DIFF MUST be least as great as the maximum expected "age" of a message (i.e., the time difference between a message has been sent by a router and received by all intended destinations). For HELLO messages, this needs only cover a single hop, but TC messages may have been forwarded a number of times. In particular, for TC messages, if using jitter as specified in [RFC7181] and [RFC5148], the largest contribution the age may be a delay of up to F_MAXJITTER per hop (except the final hop) that the message has traveled. Other factors in the delay of both message types, per hop, may include the link-layer that is used in the MANET, and CPU and memory resources of routers (e.g., queuing delays, and delays for processing ICVs). An implementation MAY set lower and/or upper bounds on these parameters, if so, then these MUST allow values meeting these requirements. An implementation MAY make its value of MAX_TC_TIMESTAMP_DIFF dependent on the number of hops that a TC message has traveled. πŸ¦‹

The above constraints assume ideal time synchronization of the clock in all routers in the network. The parameters MAX_HELLO_TIMESTAMP_DIFF and MAX_TC_TIMESTAMP_DIFF (and any constraints on them) MAY be increased to allow for expected timing differences between routers (between neighboring routers for MAX_HELLO_TIMESTAMP_DIFF, allowing for greater separation, but usually not per hop, for MAX_TC_TIMESTAMP_DIFF).

Note that excessively large values of these parameters defeats their objectives, so these parameters SHOULD be as large as is required, but not significantly larger. πŸ’€

Using POSIX time allows a resolution of no more than one second. In many MANET use cases, time synchronization much below one second is not possible because of unreliable and high-delay channels, mobility, interrupted communication, and possible resource limitations. πŸ™ˆ

In addition, when using the default message intervals and validity times as specified in [RFC6130] and [RFC7181], where the shortest periodic message interval is 2 seconds, repeating the message within a second is actually beneficial rather than harmful (at a small bandwidth cost). Also, the use of [RFC5148] jitter can cause a message to take that long or longer to traverse the MANET, thus even in a perfectly synchronized network, the TC maximum delay would usually be greater than 1 second.

A finer granularity than 1 second, and thus the use of an alternative timestamp, is however RECOMMENDED in cases where, possibly due to fast moving routers, message validity times are below 1 second. ⚑


6. Message Generation and Processing

This section specifies how messages are generated and processed by [RFC6130] and [RFC7181] when using this mechanism. πŸŽ€

6.1. Message Content

Messages MUST have the content specified in [RFC6130] and [RFC7181], respectively. In addition, messages that conform to this mechanism MUST contain:

  • At least one ICV Message TLV (as specified in [RFC7182]), generated according to Section 6.2. Implementations of [RFC6130] and [RFC7181] MUST support the following version of the ICV TLV, but other versions MAY be used instead, or in addition, in a deployment, if more appropriate:
    • For TC messages:
      • type-extension := 1
    • For HELLO messages:
      • type-extension := 2
    • hash-function := 3 (SHA-256)
    • cryptographic-function := 3 (HMAC)

The ICV Value MAY be truncated as specified in [RFC7182]; the selection of an appropriate length MAY be administratively configured. A message MAY contain several ICV Message TLVs.

  • At least one TIMESTAMP Message TLV (as specified in [RFC7182]), generated according to Section 6.2. Implementations of [RFC6130] and [RFC7181] using this mechanism MUST support the following version of the TIMESTAMP TLV, but other versions MAY be used instead, or in addition, in a deployment, if more appropriate:
    • type-extension := 1

6.2. Message Generation

After message generation (Section 11.1 of [RFC6130] and Section 16.1. of [RFC7181]) and before message transmission (Section 11.2 of [RFC6130] and Section 16.2 of [RFC7181]), the additional TLVs specified in Section 6.1 MUST (unless already present) be added to an outgoing message when using this mechanism. 🫢

The following processing steps (when using a single timestamp version and a single ICV algorithm) MUST be performed for a cryptographic algorithm that is used for generating an ICV for a message:

  1. All ICV TLVs (if any) are temporarily removed from the message. Any temporarily removed ICV TLVs MUST be stored, in order to be reinserted into the message in step 5. The message size and Message TLV Block size are updated accordingly.
  2. <msg-hop-count> and <msg-hop-limit>, if present, are temporarily set to 0.
  3. A TLV of type TIMESTAMP, as specified in Section 6.1, is added to the Message TLV Block. The message size and Message TLV Block size are updated accordingly.
  4. A TLV of type ICV, as specified in Section 6.1, is added to the Message TLV Block. The message size and Message TLV Block size are updated accordingly.
  5. All ICV TLVs that were temporary removed in step 1, are restored. The message size and Message TLV Block size are updated accordingly.
  6. <msg-hop-count> and <msg-hop-limit>, if present, are restored to their previous values.

An implementation MAY add either alternative TIMESTAMP and/or ICV TLVs or more than one TIMESTAMP and/or ICV TLVs. All TIMESTAMP TLVs MUST be inserted before adding ICV TLVs. ✨

6.3. Message Processing ✨

bestie, okay so [RFC6130] and [RFC7181] both specify that: πŸ’–

On receiving a ... message, a router MUST first check if the message is invalid for processing by this router

they then give a whole list of conditions that each get a message rejected as "badly formed and therefore invalid for processing" πŸ™ˆ when you're using a single timestamp version and a single ICV algorithm, you add these extra conditions to that list. each one that's true MUST cause NHDP or OLSRv2 (as appropriate) to treat the message as invalid for processing when using this mechanism πŸ”₯:

  1. The Message TLV Block of the message does not contain exactly one TIMESTAMP TLV of the selected version. This version specification includes the type extension. (The Message TLV Block may also contain TIMESTAMP TLVs of other versions.)
  2. The Message TLV Block does not contain exactly one ICV TLV using the selected algorithm and key identifier. This algorithm specification includes the type extension, and for type extensions 1 and 2, the hash function and cryptographic function. (The Message TLV Block may also contain ICV TLVs using other algorithms and key identifiers.)
  3. Validation of the identified (in step 1) TIMESTAMP TLV in the Message TLV Block of the message fails, as according to Section 6.3.1.
  4. Validation of the identified (in step 2) ICV TLV in the Message TLV Block of the message fails, as according to Section 6.3.2.

an implementation MAY check the existence of, and verify, either an alternative TIMESTAMP and/or ICV TLVs or more than one TIMESTAMP and/or ICV TLVs. ✨


6.3.1. Validating a Message Based on Timestamp ⏰

for a TIMESTAMP Message TLV with type extension 1 (POSIX time) identified as described in Section 6.2:

  1. If the current POSIX time minus the value of that TIMESTAMP TLV is greater than MAX_HELLO_TIMESTAMP_DIFF (for a HELLO message) or MAX_TC_TIMESTAMP_DIFF (for a TC message), then the message validation fails.
  2. Otherwise, the message validation succeeds.

if a deployment chooses to use a different type extension from 1, appropriate measures MUST be taken to verify freshness of the message. 🫢


6.3.2. Validating a Message Based on Integrity Check πŸ”

for an ICV Message TLV identified as described in Section 6.2:

  1. All ICV Message TLVs (including the identified ICV Message TLV) are temporarily removed from the message, and the message size and Message TLV Block size are updated accordingly.
  2. The message's <msg-hop-count> and <msg-hop-limit> fields are temporarily set to 0.
  3. Calculate the ICV for the parameters specified in the identified ICV Message TLV, as specified in [RFC7182].
  4. If this ICV differs from the value of <ICV-data> in the ICV Message TLV, then the message validation fails. If the <ICV-data> has been truncated (as specified in [RFC7182], the ICV calculated in the previous step MUST be truncated to the TLV length of the ICV Message TLV before comparing it with the <ICV-data>.
  5. Otherwise, the message validation succeeds. The message's <msg-hop-count> and <msg-hop-limit> fields are restored to their previous value, and the ICV Message TLVs are returned to the message, whose size is updated accordingly.

7. Provisioning of Routers πŸ”‘

okay this part is the vibe check πŸ’…: before a router using this mechanism can generate ICVs or validate messages, it MUST acquire the shared secret key(s) to be used by all routers that are to participate in the network. this spec does not define how a router acquires secret keys πŸ™ˆ. once a router has acquired suitable key(s), it MAY be configured to use, or not use, this mechanism. Section 23.6 of [RFC7181] gives the rationale, based on [BCP107], for why no key management is specified for OLSRv2.


8. Security Considerations 🚨

bestie, this section is SERIOUS 😭 and we are not skipping any of it. this document specifies a security mechanism for use with NHDP and OLSRv2 that allows for mitigating several security threats πŸ›‘οΈ.

8.1. Mitigated Attacks

this section briefly summarizes the security threats that the mechanism in this document mitigates.

8.1.1. Identity Spoofing 🎭

only routers holding the selected shared secret key are able to add a valid ICV TLV to a message, so identity spoofing (where an attacker falsely claims the identity of a valid router) is countered. when you use one or more shared keys for all routers in the MANET, you can only tell that a router is a valid one in the network, not which particular router it is. so a malicious router with valid keys (e.g., a compromised router) may still spoof the identity of another router using the same key πŸ’€.

link spoofing, where an attacker falsely represents the existence of a nonexistent link or otherwise misrepresents a link's state, is countered by the mechanism specified in this document, using the same argument as in Section 8.1.1. πŸ”₯

8.1.3. Replay Attack ⏳

replay attacks are partly countered by the mechanism specified in this document, but this depends on synchronized clocks of all routers in the MANET. an attacker that records messages to replay them later can only do so in the selected time interval after the timestamp contained in the message. as an attacker cannot modify the content of this timestamp (because it is protected by the identity check value), an attacker cannot replay messages after this time. within this time interval it is still possible to perform replay attacks, however the limits on the time interval are specified so that this will have a limited effect on the operation of the protocol. 🌸

8.2. Limitations

if no synchronized clocks are available in the MANET, replay attacks cannot be countered by the mechanism provided by this document. an alternative version of the TIMESTAMP TLV defined in [RFC7182], with a monotonic sequence number, may have some partial value in this case, but it will necessitate adding state to record observed message sequence number information. 🧠

the mechanism provided by this document does not avoid or detect security attacks by routers possessing the shared secret key that is used to generate integrity check values for messages. 😀

this mechanism relies on an out-of-band protocol or mechanism for distributing the shared secret key(s) (and if an alternative integrity check value is used, any additional cryptographic parameters). πŸ—οΈ

this mechanism does not provide a key management mechanism. refer to Section 23.6 of [RFC7181] for a detailed discussion of why the automated key management requirements specified in [BCP107] do not apply to OLSRv2 and NHDP. πŸ“š


9. Acknowledgments 🫢

the authors would like to gratefully acknowledge the following people: Justin Dean (NRL) and Henning Rogge (Frauenhofer FKIE). 🌈


10. References πŸ“–

10.1. Normative References

  • [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, March 1997.
  • [RFC5444] Clausen, T., Dearlove, C., Dean, J., and C. Adjih, "Generalized Mobile Ad Hoc Network (MANET) Packet/Message Format", RFC 5444, February 2009.
  • [RFC6130] Clausen, T., Dearlove, C., and J. Dean, "Mobile Ad Hoc Network (MANET) Neighborhood Discovery Protocol (NHDP)", RFC 6130, April 2011.
  • [RFC7181] Clausen, T., Dearlove, C., Jacquet, P., and U. Herberg, "The Optimized Link State Routing Protocol Version 2", RFC 7181, April 2014.
  • [RFC7182] Herberg, U., Clausen, T., and C. Dearlove, "Integrity Check Value and Timestamp TLV Definitions for Mobile Ad Hoc Networks (MANETs)", RFC 7182, April 2014.

10.2. Informative References

  • [BCP107] Bellovin, S. and R. Housley, "Guidelines for Cryptographic Key Management", BCP 107, RFC 4107, June 2005.
  • [RFC5148] Clausen, T., Dearlove, C., and B. Adamson, "Jitter Considerations in Mobile Ad Hoc Networks (MANETs)", RFC 5148, February 2008.

Authors' Addresses πŸ’Œ

Ulrich Herberg
Fujitsu Laboratories of America
1240 E. Arques Ave.
Sunnyvale, CA, 94085
USA

EMail: ulrich@herberg.name
URI:   http://www.herberg.name/


Christopher Dearlove
BAE Systems Advanced Technology Centre
West Hanningfield Road
Great Baddow, Chelmsford
United Kingdom

Phone: +44 1245 242194
EMail: chris.dearlove@baesystems.com
URI:   http://www.baesystems.com/


Thomas Heide Clausen
LIX, Ecole Polytechnique
91128 Palaiseau Cedex
France

Phone: +33 6 6058 9349
EMail: T.Clausen@computer.org
URI:   http://www.thomasclausen.org/
πŸ“¦ where this page comes from