Method of supporting SSL/TLS protocols in a resource-constrained device

• US 20060041938A1
• Filed: 08/20/2004
• Published: 02/23/2006
• Est. Priority Date: 08/20/2004
• Status: Abandoned Application

• Current Assignee: Axalto S A
• Original Assignee: Axalto S A
• Inventors: Ali, Asad Mahboob
• Application Number:
  US10/923,374
• Publication Number:
  US 20060041938A1
• Time in Patent Office: Days
• US Class Current: 726/14
• CPC Class Codes: G06F 2221/2153 Using hardware token as a secondary aspect
• CPC Class Codes: G06Q 20/341 Active cards, i.e. cards including their own processing means, e.g. including an IC or chip
• CPC Class Codes: G06Q 20/40975 using encryption therefor
• CPC Class Codes: G07F 7/1008 Active credit-cards provided with means to personalise their use, e.g. with PIN-introduction/comparison system
• CPC Class Codes: H04L 63/166 at the transport layer

Abstract

System and method for secure communication between a resource constrained device and a remote node over a computer network. The system and method according to the invention supports an SSL/TLS protocol stack on the resource-constrained device by performing at least one optimization step to reduce the resources required to support the SSL/TLS protocol stack on the resource constrained device.

Claims

1. A method of providing secure communication between a resource constrained device and a remote node over a computer network, comprising:

supporting an SSL/TLS protocol stack on the resource-constrained device by performing at least one optimization step to reduce the resources required to support the SSL/TLS protocol stack on the resource constrained device.

2. The method of claim 1 wherein the optimization step comprises:

memory management optmization wherein stack depth is minimized by reducing data passed via function calls.

3. The method of claim 2 wherein the stack depth is reduced by allocating variables on a RAM heap.

4. The method of claim 1 wherein the optimization step comprises a memory management optimization including RAM heap management wherein freed memory blocks are made available for subsequent memory requests.

5. The method of claim 4 further comprising placing freed memory blocks in a linked list and in response to a memory request, seeking the linked list for a suitable available memory block.

6. The method of claim 4 wherein the optimization step comprises:

maintaining a startpointer indicating the location of a next free memory buffer;

in response to a request to allocate a memory buffer of size n, searching the RAM heap beginning at the startpointer for a memory buffer of size n, by;

examining the size of the memory buffer pointed to by the startpointer, if the memory buffer pointed to by the startpointer smaller than n, moving the startpointer to the next free RAM heap block and continue searching, otherwise, allocate a memory buffer of size n located at the end of the RAM block pointed to by the startpointer.

7. The method of claim 4 wherein the optimization step comprises:

in response to a request to release a previously allocated block, determining whether an adjacent block is freeand if the adjacent block is free, combine the adjacent block with the block being freed whereby forming a larger contiguous block.

8. The method of claim 4 wherein the optimization step comprises:

reusing an allocated buffer without returning the buffer to the RAM heap.

9. The method of claim 8 wherein the step of reusing an allocated buffer comprises storing a pre-master secret and a master secret in a common buffer during TLS handshake phase.

10. The method of claim 8 wherein the step of reusing an allocated buffer comprises storing a pre-master secret in a global I/O buffer used for reading all incoming TLS messages.

11. The method of claim 8 wherein the step of reusing an allocated buffer comprises performing DES encryption and decryption using a single RAM heap buffer for both input and output.

12. The method of claim 1 wherein the optimization step comprises:

swapping unused data from the RAM to a non-volatile memory (NVM) heap.

13. The method of claim 12 wherein the swapping of unused data comprises:

selecting a first buffer from the RAM heap for swapping to NVM wherein the first buffer contains data from a first process;

allocating a second buffer in the NVM;

writing the contents of the first buffer into the second buffer;

permitting a second process requiring use of RAM to use the first buffer;

operating the second process and using the first buffer to store data from the second process up to a state in which the second process no longer requires use of the first buffer;

reading the data from the second buffer and writing the data into the first buffer.

14. The method of claim 12 wherein the swapping of unused data comprises selecting for swapping only RAM buffers sufficiently large to justify overhead associated with swapping.

15. The method of claim 12 wherein the swapping of unused data comprises selecting for swapping only RAM buffers that do not contain data that are required concurrently.

16. The method of claim 1 wherein the optimization step comprises:

computing a message authentication code (MAC) digest using a single digest context during TLS handshake with a remote TLS client.

17. The method of claim 16 wherein the computing message authentication code (MAC) step comprises generating an intermediate hash value and a final hash value from a single digest context.

18. The method of claim 17 wherein the step of generating an intermediate hash value and a final value from a single digest context comprises:

(a) allocating and initializing a new digest context;

(b) in response to a new handshake message, check the message number and determine how to digest the message;

(c) if the message is anything other than a client-finish message or server—

finish message, update the digest with the message contents and return to step (b);

(d) if the message is a client-finish message;

swap the digest to a non-volatile memory (NVM) heap;

finalize the digest context to obtain a hash value (the intermediate digest value);

compare the intermediate digest value to a corresponding value received from the remote TLS client;

restore the digest context from the NVM heap;

update the digest by adding the client-finish message to the digest;

return to step (b);

(e) if the message is a server-finish message;

finalize the digest context to obtain a hash value (the final digest value);

transmit the final digest value to the remote TLS client;

release the RAM buffer for the digest context back to the RAM heap.

19. The method of claim 1 wherein the optimization step comprises:

receiving a TLS record to be passed on to an application as a sequence of blocks;

for each block, write the block to a non-volatile memory heap;

verify message authentication code (MAC) integrity on the entire record;

if the MAC integrity is confirmed, pass the TLS record to the application.

20. The method of claim 1 wherein the optimization step comprises:

receiving a TLS record to passed on to an application as a sequence of blocks;

maintain a global flag indicating whether the entire TLS record has been received;

for each block received and the global flag indicates that the entire TLS record has not been received, the block is passed to the application;

if the entire record is read or the remaining data is read, then;

verify message authentication code (MAC) integrity on the entire record; and

if the MAC integrity is confirmed, set the global flag to indicate that the complete record has been received and pass the block of data to the application;

if the MAC integrity fails, an error flag is set.