MEMORY MANAGEMENT METHOD

• US 20090164802A1
• Filed: 12/15/2008
• Published: 06/25/2009
• Est. Priority Date: 12/19/2007
• Status: Abandoned Application

• Current Assignee: Bouyant Holdings Limited
• Original Assignee: Cidway Technologies, Ltd.
• Inventors: Labaton, Isacc J.
• Application Number:
  US12/335,284
• Publication Number:
  US 20090164802A1
• Time in Patent Office: Days
• US Class Current: 713/189
• CPC Class Codes: G06F 21/31 User authentication
• CPC Class Codes: G06F 21/445 by mutual authentication, e.g. between devices or programs
• CPC Class Codes: G06F 21/554 involving event detection and direct action
• CPC Class Codes: G06F 21/6209 to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself
• CPC Class Codes: G06F 2221/2103 Challenge-response

Abstract

A mobile communicator including a CPU, communications software and application software for at least one application which can be launched only by using at least one application key, the at least one application key being scrambled using a scrambling function which is based on a seed, which seed is not stored in any computer memory used by the mobile communicator.

Claims

1. A mobile communicator comprising:

a CPU;

communications software; and

application software for at least one application which can be launched only by using at least one application key, said at least one application key being scrambled using a scrambling function which is based on a seed, which seed is not stored in any computer memory used by the mobile communicator.

2. A mobile communicator according to claim 1 and wherein, following scrambling thereof, said at least one application key is stored in a memory associated with said mobile communicator in a distributed manner.

3. A mobile communicator according to claim 2 and wherein said application employs said seed to generate an unscrambling function for unscrambling said at least one application key following retrieval thereof from said memory.

4. A mobile communicator according to claim 1 and wherein said seed is stored in a computer memory which is not used by the mobile communicator.

5. A mobile communicator according to claim 1 and wherein said application software is associated with personal user information.

6. A mobile communicator according to claim 1 and wherein said seed is provided by a user.

7. A mobile communicator according to claim 6 and wherein said user provides said seed each time said application is launched.

8. A mobile communicator according to claim 1 and wherein said application employs said at least one application key for generating a One Time Password (OTP).

9. A mobile communicator according to claim 1 and wherein said application employs said at least one application key for providing a response to a challenge provided by a challenging server.

10. A mobile communicator according to claim 1 and wherein said at least one application key comprises a private key forming part of a key pair associated with use of an asymmetric algorithm.

11. A method of securing data in a mobile communicator against unauthorized use comprising:

providing application software for at least one application which can be launched only by using at least one application key; and

scrambling said at least one application key by using a scrambling function which is based on a seed, which seed is not stored in any computer memory used by the mobile communicator.

12. A method according to claim 11, and also comprising installing and running said at least one application on the mobile communicator.

13. A method according to claim 11 and also comprising storing said at least one application key in a memory associated with said mobile communicator in a distributed manner.

14. A method according to claim 11 and also comprising storing said seed in a computer memory which is not used by said mobile communicator.

15. A method according to claim 11 and wherein said application software is associated with personal user information.

16. A method according to claim 11 and wherein said seed is provided by a user.

17. A method according to claim 16 and wherein said user provides said seed each time said application is launched.

18. A method according to claim 11 and wherein said at least one application key comprises a private key forming part of a key pair associated with use of an asymmetric algorithm.

19. A method according to claim 11 and wherein said scrambling comprises:

concatenating said at least one application key and a dimension corresponding to each of said at least one application key to form a contiguous vector; and

employing said seed in a random number generator to generate a scrambling function for scrambling said contiguous vector, thereby to obtain an incontiguous vector.

20. A method according to claim 19 and wherein said employing said seed in a random number generator to generate a scrambling function comprises:

employing said seed in a random number generator to obtain a random sequence;

employing said random sequence as a randomization seed in an algorithm, thereby to obtain a random arrangement;

using said random arrangement in said scrambling function; and

applying said scrambling function, using said random arrangement, to said contiguous vector.

21. A method according to claim 11 and also comprising employing said application and said at least one application key for generating a One Time Password (OTP).

22. A method according to claim 11 and also comprising employing said application and said at least one application key for providing a response to a challenge provided by a challenging server.

23. A method according to claim 21 and wherein said employing said application and said at least one application key comprises:

retrieving an incontiguous vector representing said at least one application key from a memory associated with said mobile communicator; and

unscrambling said incontiguous vector using an unscrambling function which is based on said seed, thereby to obtain said at least one application key.

24. A method according to claim 23 and wherein said unscrambling comprises:

employing said seed in a random number generator to obtain a random sequence;

employing said random sequence as a randomization seed in an algorithm, thereby to obtain a random arrangement;

using said random arrangement in said unscrambling function;

applying said unscrambling function, using said random arrangement, to said incontiguous vector, thereby to obtain a contiguous vector; and

segmenting said contiguous vector to retrieve said at least one application key.

25. A computer readable medium including, in computer readable form:

application software for at least one application which can be launched only by using at least one application key, said at least one application key being scrambled using a scrambling function which is based on a seed, which seed is not stored in any computer memory used by the mobile communicator.

26. A medium according to claim 25 and wherein said at least one application key is stored in a memory associated with said mobile communicator in a distributed manner.

27. A medium according to claim 25 and wherein said seed is stored in a computer memory which is not used by said mobile communicator.

28. A medium according to claim 25 and wherein said application software is associated with personal user information.

29. A medium according to claim 25 and wherein said at least one application key comprises a private key forming part of a key pair associated with use of an asymmetric algorithm.

30. A medium according to claim 25 and wherein said seed is provided by a user each time said application is launched.

31. A software module suitable for use in a mobile communicator, said software module being launchable only by using at least one application key which is scrambled using a scrambling function which is based on a seed, which seed is not stored in any computer memory used by the mobile communicator.

32. A software module according to claim 31 and wherein said at least one application key is stored in a memory associated with said mobile communicator in a distributed manner.

33. A software module according to claim 31 and wherein said seed is stored in a computer memory which is not used by said mobile communicator.

34. A software module according to claim 31 and wherein said software is associated with personal user information.

35. A software module according to claim 31 and wherein said at least one application key comprises a private key forming part of a key pair associated with use of an asymmetric algorithm.

36. A software module according to claim 31 and wherein said seed is provided by a user each time said application is launched.