KEY EXCHANGE PROTOCOL

Abstract

Methods, apparatus, and systems are provided for performing a secure communication between a sender device and receiver device. This includes encapsulating or encrypting, by the sender device, a message using a post-quantum cryptographic algorithm and quantum key (QK) material derived from QK distribution with a receiver device. Noise is added, by the sender device, to the encapsulated or encrypted message. The sender device sends the noisy encapsulated/encrypted message to the receiver device. On receipt of the noisy encapsulated or encrypted message from the sender device, the receiver device decapsulates or decrypts the received message using corresponding QK used by the sender device. The receiver device decapsulates or decrypts the QK decapsulated/decrypted message using the corresponding post-quantum cryptographic algorithm used by the sender, and the receiver device outputs or uses the message sent by the sender.

Claims

1. A computer-implemented method of secure communications for a sender device comprising: encapsulating or encrypting a message using a post-quantum cryptographic algorithm and quantum key, QK, material derived from QK distribution with a receiver device; adding noise to the encapsulated or encrypted message; and sending the noisy encapsulated or encrypted message to the receiver device.

2. The computer-implemented method of claim 1, further comprising: generating a random message M of length L using a random source.

3. The computer-implemented method of claim 1, wherein encapsulating or encrypting the message includes encoding the message using a published public key and the QK material to generate a codeword, wherein the published public key is published by the receiver device.

4. The computer-implemented method of claim 3, wherein encapsulating or encrypting the message includes generating a QK codeword by using the QK material to compute an exclusive-OR (XOR) of the QK material with the codeword.

5. The computer-implemented method of claim 4, wherein adding noise to the encapsulated or encrypted message includes generating a ciphertext, wherein a portion of the ciphertext is generated by corrupting or flipping random bits of the QK codeword; and wherein sending the noisy encapsulated or encrypted message to the receiver device includes sending the ciphertext to the receiver device.

6. A computer-implemented method of secure communications for a receiver device comprising: receiving a noisy encapsulated or encrypted message from a sender device, the noisy encapsulated or encrypted message having been encapsulated or encrypted using a post-quantum cryptographic algorithm and quantum key, QK, material derived from QK distribution with the sender device; decapsulating or decrypting the received message using the corresponding QK used by the sender device; decapsulating or decrypting the QK decapsulated or decrypted message using the corresponding post-quantum cryptographic algorithm used by the sender; and outputting the message for use by the receiver device.

7. The computer-implemented method of claim 6, further comprising: choosing a secret and publishing a public key.

8. The computer-implemented method of claim 7, wherein the received message is a random message M of length L generated by the sending device using a random source.

9. The computer-implemented method of claim 7, wherein the received message comprises a codeword, wherein the codeword is generated by encoding the message using the published public key.

10. The computer-implemented method of claim 9, wherein the received message comprises a ciphertext wherein a portion of the ciphertext is generated by corrupting or flipping random bits of a QK codeword, wherein the QK codeword is generated by using the quantum key material to compute an exclusive-OR, XOR, of the QK material with the codeword.

11. The computer-implemented method of claim 10, wherein receiving the noisy encapsulated or encrypted message includes receiving the ciphertext from the sender device; wherein decapsulating or decrypting the received message using the corresponding QK used by the sender device includes decapsulating or decrypting the portion of the ciphertext using the QK material; and wherein decapsulating or decrypting the QK-decrypted message using the corresponding post-quantum cryptographic algorithm includes further decapsulating decrypting the portion of the ciphertext using the post-quantum cryptography algorithm.

12. The computer-implemented method of claim 11, further comprising: generating a noisy codeword based on computing an exclusive-OR, XOR, of the QK material with the portion of the ciphertext; and decapsulating or decrypting the noisy codeword by applying an error decoding algorithm to recover the encoded message.

13. A computer-implemented method of secure communication between a sender device and receiver device comprising: encapsulating or encrypting, by the sender device, a message using a post-quantum cryptographic algorithm and quantum key material, QK, derived from QK distribution with the receiver device; adding noise, by the sender device, to the encapsulated or encrypted message; and sending, by the sender device, the noisy encapsulated/encrypted message to the receiver device; receiving, by the receiver device, the noisy encapsulated or encrypted message from the sender device; decapsulating or decrypting, by the receiver device, the received message using the corresponding QK used by the sender device; decapsulating or decrypting, by the receiver device, the QK-decapsulated/decrypted message using the corresponding post-quantum cryptographic algorithm used by the sender; and outputting, by the receiver device, the message.

14. The computer-implemented method of claim 13, further comprising choosing, by the receiver device, a secret; and publishing, by the receiver device, a public key.

15. The computer-implemented method of claim 13, further comprising: generating, by the sender device, a random message M of length L using a random source.

16. The computer-implemented method of claim 14, wherein encapsulating or encrypting the message includes encoding, by the sender device, the message using the published public key and the QK material to generate a codeword.

17. The computer-implemented method of claim 16, wherein encapsulating or encrypting the message includes generating, by the sender device, a QK codeword by using the quantum key material to compute an exclusive-OR, XOR, of the QK material with the codeword.

18. The computer-implemented method of claim 17, wherein adding noise to the encapsulated or encrypted message includes generating, by the sender device, a ciphertext wherein a portion of the ciphertext is generated by corrupting or flipping random bits of the QK codeword; and wherein sending the noisy encapsulated or encrypted message to the receiver device includes sending, by the sender device, the ciphertext to the receiver device.

19. The computer-implemented method of claim 18, wherein receiving the noisy encapsulated or encrypted message includes receiving, by the receiver device, the ciphertext from the sender device; wherein decapsulating or decrypting the received message using the corresponding QK used by the sender device includes decapsulating or decrypting, by the receiver device, the portion of the ciphertext using the QK material; and wherein decapsulating or decrypting the QK-decapsulated or decrypted message using the corresponding post-quantum cryptography algorithm includes further decapsulating or decrypting, by the receiver device, the portion of the ciphertext, using the post-quantum cryptography algorithm.

20. The computer-implemented method of claim 19, further comprising: generating, by the receiver device, a noisy codeword based on computing an exclusive OR, XOR, of the QK material with the received portion of the ciphertext; and decapsulating or decrypting, by the receiver device, the noisy codeword by applying an error decoding algorithm to recover the encoded message.

21-27. (canceled)

28. The computer-implemented method of claim 20, wherein the error decoding algorithm is a medium density parity check code, MDPC, decoding algorithm.

29. The computer-implemented method according to claim 13, wherein the post-cryptographic algorithm is based on the bit-flipping key encapsulation, BIKE post quantum key encapsulation, KEM, cryptographic algorithm.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Embodiments of the invention will be described, by way of example, with reference to the following drawings, in which:

[0032] FIG. 1a is a schematic diagram illustrating an example BIKE encapsulation/encryption process for use according to some embodiments of the invention;

[0033] FIG. 1b is a schematic diagram illustrating another example BIKE decapsulation/decryption process for use with FIG. 1a according to some embodiments of the invention;

[0034] FIGS. 2a and 2b is a flow diagram illustrating an example encapsulation/encryption and decapsulation/decryption hybrid process(es) according to some embodiments of the invention;

[0035] FIGS. 2c to 2d are further schematic diagrams illustrating a further example encapsulation/encryption and decapsulation/decryption hybrid process(es) according to some embodiments of the invention;

[0036] FIG. 3 is a schematic diagram illustrating an example computing system, device or apparatus according to some embodiments of the invention; and

[0037] Common reference numerals are used throughout the figures to indicate similar features.

DETAILED DESCRIPTION

[0038] Embodiments of the present invention are described below by way of example only. These examples represent the best mode of putting the invention into practice that are currently known to the Applicant although they are not the only ways in which this could be achieved. The description sets forth the functions of the example and the sequence of steps for constructing and operating the example. However, the same or equivalent functions and sequences may be accomplished by different examples.

[0039] The present disclosure provides method(s), apparatus and system(s) for secure communication between a sender device and a receiver device using a hybrid mechanism or algorithm based on using quantum key distribution material and post-quantum cryptographic algorithms based on a combination of using components of post-quantum cryptographic algorithms and quantum key distribution (QKD) to allow a resulting algorithm to deliver security determined by the sum of the strengths of these components. The hybrid mechanism or algorithm including the post-quantum cryptographic algorithm and QKD components is adapted to enable at least two parties who hold some initial shared secret material for authentication purposes to agree additional shared material over an insecure public channel such that, without limitation, for example: a successful attack on the QKD components of the hybrid mechanism/algorithm will be insufficient to recover the shared key due to a failure to also compromise the post-quantum cryptographic algorithmic component (e.g. the cryptographic key exchanged and used between the at least two parties); a successful attack on the post-quantum cryptographic algorithmic component of the hybrid mechanism/algorithm will be insufficient to recover the shared key due to a failure to also compromise the QKD component. The hybrid mechanism/algorithm, apparatus, method and/or system is configured to combine QKD with modifications to the bit-flipping key encapsulation (BIKE) post quantum key encapsulation (KEM) cryptographic algorithm.

[0040] For example, hybrid mechanism/algorithm, apparatus, method and/or system(s) are provided for performing a secure communication between a sender device and receiver device. This includes encapsulating or encrypting, by the sender device, a message using a post-quantum cryptographic algorithm and quantum key (QK) material derived from QK distribution with a receiver device. Noise is added, by the sender device, to the encapsulated or encrypted message. The sender device sends the noisy encapsulated/encrypted message to the receiver device. On receipt of the noisy encapsulated or encrypted message from the sender device, the receiver device decapsulates or decrypts the received message using corresponding QK used by the sender device. The receiver device decapsulates or decrypts the QK decapsulated/decrypted message using the corresponding post-quantum cryptographic algorithm used by the sender, and the receiver device outputs or uses the message sent by the sender. The post-quantum cryptographic algorithm is the BIKE algorithm, which may use medium density parity check codes, MDPC, decoding algorithms. The sender and receiver may be a sender device and a receiver device, respectively. The sender and/or receiver device may each be any device or communication device capable of communicating with each other and capable of performing post-quantum cryptography and quantum key distribution for exchanging quantum key materials with each other, such that the QK materials are known by the sender and receiver. The hybrid mechanism/algorithm, apparatus, method and/or system(s) as described herein may be used to protect, without limitation, for example communications between receiver and senders/transmitters, cloud services and/or transactions and the like.

[0041] Post-quantum algorithms offer an alternative to classical encryption algorithms but suffer from the possibility of yet-to-be-discovered mathematical attacks on their foundations. Meanwhile, quantum key distribution offers unconditionally-secure agreement of keys between two parties which possess an initial amount of shared secret material but, due to its reliance on physical implementations, the possibility of malfunctions or physical attacks remains.

[0042] The hybrid mechanism or algorithm as herein described provides a combination of these two techniques that allows the resulting hybrid algorithm to deliver security determined by the sum of the strengths of the components. In practical terms, the inventions allows two parties who hold some initial shared secret material (e.g. quantum key distributed material) for authentication purposes to agree additional shared material over an insecure public channel such that: a successful attack on the QKD components of the hybrid algorithm will be insufficient to recover the shared key due to a failure to also compromise the post-quantum algorithmic component; and a successful attack on the post-quantum algorithmic component of the hybrid algorithm will be insufficient to recover the shared key due to a failure to also compromise the QKD component. In particular, the strengths of each of the post-quantum algorithmic component and the QKD component compensate for the weaknesses of the other to provide a more robust and secure system.

[0043] An example of the hybrid algorithm/mechanism is described, by way of example only and is not limited to, combining QKD with the BIKE (bit-flipping key encapsulation) post quantum key encapsulation mechanism (KEM) algorithm.

[0044] FIG. 1a is a schematic diagram illustrating an example of a BIKE encapsulation (encryption) algorithm 100 for encoding a key for use with some embodiments of the invention. In general, the BIKE algorithm relies on the sender (e.g. Alice) encoding a secret key, or message M of randomly generated bits, and then corrupting a number of randomly-chosen bit positions of the encoded key before transmitting to the receiver (e.g. Bob). Note: the BIKE ‘family’ of algorithms comprises a single parameterised variant, with previous versions of BIKE having featured additional variants. The receiver possesses privileged information (e.g. a private key) which allows them to efficiently decode the corrupted codeword, recovering the encoded secret key. The BIKE encapsulation (encryption) algorithm 100 is based on the following steps of: In step 102, Bob (the receiver) chooses a secret (p, q) and publishes a public key based on p/q modulo a quotient polynomial as a cyclic code. In step 104, Alice (the sender) generates, in this example, a cryptographic key represented by a random message M of length L (e.g. L=256) using a random source 105. In step 106, Alice encodes the message M using Bob's public key to produce codeword (e.g. E1*h) to which noise (e.g. E_0) is added (e.g. added using an exclusive or (XOR) operation, E_0 XOR E1*h) to generate a ciphertext consisting of c_0 and c_1, where c_0 represents a ‘noisy’ codeword in which features approximately sqrt(n) bits which have been flipped or corrupted. The ciphertext c_0 and c_1 is sent to Bob.

[0045] FIG. 1b is a schematic diagram illustrating an example of a BIKE decapsulation algorithm 110 for decoding the message M or key sent from Alice in FIG. 1a for use with some embodiments of the invention. The BIKE decapsulation algorithm 110 includes the following steps of: In step 112, Bob receives the ciphertext c_0 and c_1 from Alice. In step 114, Bob, using his private key (corresponding to the published public key that was published in step 102 of FIG. 11a), employs a Medium Density Parity Check (MDPC) decoding algorithm to resolve the noisy codeword c_0 into the message M chosen by Alice. Bob may use message M for, without limitation, for example encrypting communications between Bob and Alice and vice versa.

[0046] Conventional QKD includes the following steps of: 1) Alice and Bob a priori possess a volume of secret key material known only to Alice and Bob; 2) Alice and Bob engage in a number of QKD ‘rounds’ in which their existing shared key material is used for process authentication and allows them to progressively expand the volume of shared key material they hold; 3) Surplus shared key material (beyond that required to sustain future QKD rounds) is made available for securing classical communications.

[0047] Although the BIKE encapsulation (encryption) algorithm 100 and BIKE decapsulation (decryption) was described in relation to sending a cryptographic key from Alice to Bob, this is by way of example only and the invention is not so limited, it is to be appreciated by the skilled person that the random message M generated by Alice may instead be a message M that Alice wishes to send to Bob, where the message M has been encrypted with a generated cryptographic key. For example, in step 104 the random source may generate a cryptographic key which may be XORed with the information Alice wishes to send to generate the message M. Thus, Alice sends, using codewords c_0 and c_1, the ciphertext representing the message M in FIG. 1a, which Bob subsequently decrypts/decapsulates in FIG. 1b.

[0048] FIG. 2a is a schematic diagram illustrating an example hybrid encapsulation (encryption) process 200 between a sender and a receiver according to some embodiments of the invention. FIG. 2b is a schematic diagram illustrating an example hybrid decapsulation (decryption) process 210 for use with the hybrid encapsulation (encryption) process 200 of FIG. 2a according to some embodiments of the invention. The hybrid encapsulation process 200 uses a combination of QKD material or quantum key (QK) material and post-quantum cryptographic components such as, for example, the BIKE algorithm as described with reference to FIGS. 1a and 1b, combinations thereof, modifications thereto, and the like and/or as the application demands. The sender and receiver may be a sender device and a receiver device, respectively. The sender and/or receiver device may each be any device or communication device capable of communicating with each other and capable of performing post-quantum cryptography and quantum key distribution for exchanging quantum key materials with each other.

[0049] The hybrid encapsulation (encryption) process 200 includes the following steps of: In step 202, a sender may encrypt a message using BIKE algorithm; In step 204, the sender may encrypt further using quantum key (QK) material (e.g. the QK one-time-pad (OTP) material); In step 206, the sender adds noise to the BIKE and QK encrypted message. The process of adding noise may be carried out as described above in relation to FIG. 1a. The BIKE and QK encrypted message may be sent from the sender to the receiver. Referring to FIG. 2b, on receiving the BIKE and QK encrypted message from the sender, the receiver may perform the hybrid decapsulation process 210 based on the following steps of: In step 212, decrypt using quantum key (QK) material (e.g. the QK one-time-pad (OTP) material); In step 214, remove the noise and decrypt using BIKE algorithm.

[0050] For example, the QK one-time-pad (OTP) material used by the sender and receiver may have been previously shared between sender and receiver using a QKD protocol and the like. So, essentially, the QK material may be considered to be known by sender and receiver.

[0051] Thus, instead of removing noise prior to decrypting using the QK material, the hybrid encapsulation/decapsulation (encryption/decryption) process(es) 200 and 210 first decrypts using the QKD material, then removes noise using the BIKE algorithm. Thus, the noise removal procedure is inverted, which is made possible by the nature of BIKE and its compatibility with one-time pad encryption using QKD-sourced material. In security terms, this confers the advantage that, even if an attacker were able to break the BIKE encryption (encapsulation), leveraging this ability (even in a partial sense) would not be possible without breaking the QKD one-time pad encryption first.

[0052] FIGS. 2c and 2d are further schematic diagrams illustrating further examples of hybrid encapsulation/decapsulation (encryption/decryption) processes 220 and 230 with further modifications to the hybrid encapsulation/decapsulation (encryption/decryption) processes 200 and 210 as described with reference to FIGS. 2a and 2b according to some embodiments of the invention. Referring to FIG. 2c, the hybrid encapsulation (encryption) process 220 includes the following steps of: In step 222, Bob (the receiver) chooses a secret (p, q) and publishes a public key based on p/q modulo a quotient polynomial as a cyclic code. In step 224, Alice (the sender) generates, in this example, a cryptographic key represented by a random message M of length L (e.g. L=256) using a random source 225. In step 226, Alice encodes the message M using Bob's public key (e.g. E1*h) and also uses quantum key material 227 to encode the codeword (e.g. E1*h). Alice takes the quantum key material 227 (known also only to Bob) and computes the exclusive-OR (XOR) of this quantum key material 227 with the codeword (e.g. E1*h) to produce a QK codeword (e.g. QK codeword=[QKD_OTP XOR (E1*h)]). Then, from the QK codeword, Alice produces a ciphertext consisting of c_0 (e.g. QK Codeword XOR (E_0(noise)) and c_1, where c_0 represents a ‘noisy’ codeword which features approximately sqrt(n) bits which have been flipped or corrupted (e.g. E_0 (noise)). As an option, Alice may corrupt or flip approximately sqrt(n) bits of the resulting value and transmit the result to Bob along with a nonce. In step 228, Alice sends c_0 and c_1 to Bob (the receiver).

[0053] Referring to FIG. 2d, the hybrid decapsulation (decryption) process 230 is used by the receiver (e.g. Bob) on receiving the c_0 and c_1 ciphertext from Alice transmitted at end of the hybrid encapsulation (encryption) process 220 of FIG. 2c. The hybrid decapsulation (decryption) process 230 includes the following steps of: In step 232, Bob receives the ciphertext (e.g. c_0 and c_1) from Alice. In step 234, on receipt of the ciphertext c_0 and c_1 from Alice, Bob decrypts or decapsulates the cipher text c_0 using QK material first then decrypts or decapsulates using the post quantum cryptography algorithm (e.g. BIKE decapsulation/decryption) thereafter. In step 234a, Bob (e.g. the receiver) uses the quantum key (QK) material 227 (e.g. QKD OTP) (also known by Alice) and XORs this with the noisy codeword (e.g. c_0 XOR QKD OTP) to decrypt the QK codeword into a noisy codeword. In step 234b, this noisy codeword is decrypted/decapsulated by applying the MDPC decoding algorithm to recover the encoded message M (or secret), which is output in step 236.

[0054] Although the hybrid encapsulation (encryption) algorithm 220 and hybrid decapsulation (decryption) algorithm 230 as described with reference to FIGS. 2c and 2d was described in relation to sending a cryptographic key (or random message M) from Alice to Bob, this is by way of example only and the invention is not so limited, it is to be appreciated by the skilled person that the random message M generated by Alice may instead be a message M that Alice wishes to send to Bob, where the message M has been encrypted with a generated cryptographic key. For example, in step 224 the random source may generate a cryptographic key which may be XORed with the information Alice wishes to send to generate the message M. Thus, Alice sends, using codewords c_0 and c_1, the ciphertext representing the message M in FIG. 2c, which Bob subsequently decrypts/decapsulates in FIG. 2d.

[0055] Furthermore, the Quantum key (QK) material can be re-used, conditioned on hash-function being unbreakable and nonces being of sufficient size. If nonces are used, then, for security purposes or one or more use cases, they should never be used more than once and should be random and independent. However, this restriction may be relaxed depending on the use case and/or as the application demands.

[0056] Further modifications and/or alternative applications may be applied to the hybrid encapsulation and/or decapsulation process(es) 200, 210, 220, and/or 230 of FIGS. 2a to 2c according to some embodiments of the invention. There may be different methods of using and/or combining the quantum key (QK) material (or quantum key) with the post-quantum cryptographic algorithm ciphertext (e.g. BIKE). For example, a first use case may involve a QKD-sourced one-time pad key that is used directly. While highly secure, this has the disadvantage that it leads to the consumption of one-time pad material which may be scarce in practice. As well, the post cryptographic algorithm, (e.g. BIKE), would consume on the order of, without limitation, for example 25,000 bits of such one-time pad material for each encryption). In an alternative or second user case, a cryptographically-secure mask-generation function may be employed along with a nonce (number used once) in step 226 such that the one-time pad key is concatenated with the nonce and the mask generation function used to generate a sequence of bits of the required length for XORing with the result of step 224. The nonce would then accompany the resulting ciphertext in step 228, allowing the recipient Bob to recreate the mask value in step 234. This optimisation allows secure re-use of QKD-derived one-time pad material, at the expense of relying on the security of a cryptographically-secure mask generation function.

[0057] During the process of establishing a key via QKD a certain level of errors are expected to occur via natural processes and potential attempts at eavesdropping. In normal usage these errors are identified and removed. It is possible that these errors could be instead used as an input to the bit-flipping corruption of approximately sqrt(n) bits of the codeword produced by BIKE, removing the need to source this randomness from an external process

[0058] It is noted that in the BIKE algorithm, the second ciphertext component is denoted c_1 and, assuming that the SHA384 hash function is secure, does not necessarily need protection using one-time pad material in the hybrid encapsulation/decapsulation process(es) 200, 210, 220 and/or 240. As an option, the additional protection of the c_1 value using QKD-derived one-time pad material may lend to further enhanced security at the cost of increased one-time-pad (OTP) consumption.

[0059] FIG. 3a is a schematic diagram of an example computing system 300 for use in implementing and/or performing a hybrid encapsulation/decapsulation mechanism/process according to aspects of the invention. Computing system 300 may be used to implement one or more aspects of the systems, apparatus, methods, process(es), device(s) and/or use cases as described with reference to FIGS. 1a-2d, combinations thereof, modifications thereto, as herein describe and/or as the application demands. Computing system 300 includes a computing device or apparatus 302 (e.g. sender, receiver, sender device or receiver device etc.). The computing device or apparatus includes one or more processor unit(s) 304, memory unit 306 and a communication interface 308. The computing device or apparatus may also include, without limitation, for example, a first conventional communication interface 308a and/or a second quantum communication interface 308b, a random symbol/number generator 310. For example, the first conventional communication interface 308a may be adapted for communicating over classical communications networks and the second quantum communication interface 308b may be adapted for communicating over quantum communication channels. These may be used for performing post-quantum cryptography, key exchange, and/or QKD process(es) and the like. The one or more processor unit(s) 304 are connected to the memory unit 306, the communication interface 308 (e.g. the first communication interface 308a and the second quantum communication interface 308b), and/or the random symbol/number generator 310. The communications interface 308 may connect the computing device or apparatus 302 with one or more other computing devices and/or apparatus (e.g. intermediary device, first and/or second device(s)) (not shown). The memory unit 306 may store one or more program instructions, code or components such as, by way of example only but not limited to, an operating system 306a for operating computing device 302, and a data store 306b for storing computer program instructions, executable code, code and/or components associated with implementing the functionality and/or one or more function(s) or functionality associated with one or more hybrid encapsulation/decapsulation (encryption/decryption) mechanisms/systems and/or process(es) QKD protocol(s) of performing a the hybrid encapsulation/decapsulation (encryption/decryption) process(es)/apparatus according to the invention, system(s)/platforms, combinations thereof, modifications there to, and/or as described herein with reference to at least any one of figure(s) 1a to 2d.

[0060] In the embodiment described above the server may comprise a single server or network of servers. In some examples the functionality of the server may be provided by a network of servers distributed across a geographical area, such as a worldwide distributed network of servers, and a user may be connected to an appropriate one of the network of servers based upon a user location.

[0061] The above description discusses embodiments of the invention with reference to a single user for clarity. It will be understood that in practice the system may be shared by a plurality of users, and possibly by a very large number of users simultaneously.

[0062] The embodiments described above are fully automatic. In some examples a user or operator of the system may manually instruct some steps of the method to be carried out.

[0063] In the described embodiments of the invention the system may be implemented as any form of a computing and/or electronic device. Such a device may comprise one or more processors which may be microprocessors, controllers or any other suitable type of processors for processing computer executable instructions to control the operation of the device in order to gather and record routing information. In some examples, for example where a system on a chip architecture is used, the processors may include one or more fixed function blocks (also referred to as accelerators) which implement a part of the method in hardware (rather than software or firmware). Platform software comprising an operating system or any other suitable platform software may be provided at the computing-based device to enable application software to be executed on the device.

[0064] Various functions described herein can be implemented in hardware, software, or any combination thereof. If implemented in software, the functions can be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media may include, for example, computer-readable storage media. Computer-readable storage media may include volatile or non-volatile, removable or non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. A computer-readable storage media can be any available storage media that may be accessed by a computer. By way of example, and not limitation, such computer-readable storage media may comprise RAM, ROM, EEPROM, flash memory or other memory devices, CD-ROM or other optical disc storage, magnetic disc storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Disc and disk, as used herein, include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and blu-ray disc (BD). Further, a propagated signal is not included within the scope of computer-readable storage media. Computer-readable media also includes communication media including any medium that facilitates transfer of a computer program from one place to another. A connection, for instance, can be a communication medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of communication medium. Combinations of the above should also be included within the scope of computer-readable media.

[0065] Alternatively, or in addition, the functionality described herein can be performed, at least in part, by one or more hardware logic components. For example, and without limitation, hardware logic components that can be used may include Field-programmable Gate Arrays (FPGAs), Application-Program-specific Integrated Circuits (ASICs), Application-Program-specific Standard Products (ASSPs), System-on-a-chip systems (SOCs), Complex Programmable Logic Devices (CPLDs), etc.

[0066] Although illustrated as a single system, it is to be understood that the computing device may be a distributed system. Thus, for instance, several devices may be in communication by way of a network connection and may collectively perform tasks described as being performed by the computing device.

[0067] Although illustrated as a local device it will be appreciated that the computing device may be located remotely and accessed via a network or other communication link (for example using a communication interface).

[0068] The term ‘computer’ is used herein to refer to any device with processing capability such that it can execute instructions. Those skilled in the art will realise that such processing capabilities are incorporated into many different devices and therefore the term ‘computer’ includes PCs, servers, mobile telephones, personal digital assistants and many other devices.

[0069] Those skilled in the art will realise that storage devices utilised to store program instructions can be distributed across a network. For example, a remote computer may store an example of the process described as software. A local or terminal computer may access the remote computer and download a part or all of the software to run the program. Alternatively, the local computer may download pieces of the software as needed, or execute some software instructions at the local terminal and some at the remote computer (or computer network). Those skilled in the art will also realise that by utilising conventional techniques known to those skilled in the art that all, or a portion of the software instructions may be carried out by a dedicated circuit, such as a DSP, programmable logic array, or the like.

[0070] It will be understood that the benefits and advantages described above may relate to one embodiment or may relate to several embodiments. The embodiments are not limited to those that solve any or all of the stated problems or those that have any or all of the stated benefits and advantages. Variants should be considered to be included into the scope of the invention.

[0071] Any reference to ‘an’ item refers to one or more of those items. The term ‘comprising’ is used herein to mean including the method steps or elements identified, but that such steps or elements do not comprise an exclusive list and a method or apparatus may contain additional steps or elements.

[0072] As used herein, the terms “component” and “system” are intended to encompass computer-readable data storage that is configured with computer-executable instructions that cause certain functionality to be performed when executed by a processor. The computer-executable instructions may include a routine, a function, or the like. It is also to be understood that a component or system may be localized on a single device or distributed across several devices.

[0073] Further, as used herein, the term “exemplary” is intended to mean “serving as an illustration or example of something”.

[0074] Further, to the extent that the term “includes” is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim.

[0075] The figures illustrate exemplary methods. While the methods are shown and described as being a series of acts that are performed in a particular sequence, it is to be understood and appreciated that the methods are not limited by the order of the sequence. For example, some acts can occur in a different order than what is described herein. In addition, an act can occur concurrently with another act. Further, in some instances, not all acts may be required to implement a method described herein.

[0076] Moreover, the acts described herein may comprise computer-executable instructions that can be implemented by one or more processors and/or stored on a computer-readable medium or media. The computer-executable instructions can include routines, sub-routines, programs, threads of execution, and/or the like. Still further, results of acts of the methods can be stored in a computer-readable medium, displayed on a display device, and/or the like.

[0077] The order of the steps of the methods described herein is exemplary, but the steps may be carried out in any suitable order, or simultaneously where appropriate. Additionally, steps may be added or substituted in, or individual steps may be deleted from any of the methods without departing from the scope of the subject matter described herein. Aspects of any of the examples described above may be combined with aspects of any of the other examples described to form further examples without losing the effect sought.

[0078] It will be understood that the above description of a preferred embodiment is given by way of example only and that various modifications may be made by those skilled in the art. What has been described above includes examples of one or more embodiments. It is, of course, not possible to describe every conceivable modification and alteration of the above devices or methods for purposes of describing the aforementioned aspects, but one of ordinary skill in the art can recognize that many further modifications and permutations of various aspects are possible. Accordingly, the described aspects are intended to embrace all such alterations, modifications, and variations that fall within the scope of the appended claims.