| Secure communication system and method using shared random source for key changing -> Monitor Keywords |
|
Secure communication system and method using shared random source for key changingUSPTO Application #: 20060067533Title: Secure communication system and method using shared random source for key changing Abstract: Apparatus for use by a first party for key management for secure communication with a second party, said key management being to provide at each party, simultaneously remotely, identical keys for said secure communication without transferring said keys over any communication link, the apparatus comprising: a datastream extractor, for obtaining from data exchanged between said parties a bitstream, a random selector for selecting, from said bitstream, a series of bits in accordance with a randomization seeded by said data exchanged between said parties, a key generator for generating a key for encryption/decryption based on said series of bits, thereby to manage key generation in a manner repeatable at said parties. (end of abstract) Agent: Martin Moynihan Anthony Castorina - Arlington, VA, US Inventor: Eli Yanovsky USPTO Applicaton #: 20060067533 - Class: 380278000 (USPTO) Related Patent Categories: Cryptography, Key Management, Key Distribution The Patent Description & Claims data below is from USPTO Patent Application 20060067533. Brief Patent Description - Full Patent Description - Patent Application Claims BACKGROUND OF THE INVENTION [0001] Randomness is a basic and well-known tool in many disciplines of science and technology and finds application in fields such as communications, data security, access-control, and processes based on chaos theory. [0002] In some systems, such as frequency hopping based systems, there is a need for identical and simultaneous randomness at different remote locations. Furthermore, a random result employed at the remote locations is preferably confidential and unknown to an unauthorized party. Examples include [0003] (i) secret key data encryption methods, in which both communicating parties need to have the same secret key, which is typically a random key; [0004] (ii) remote access control, in which a distant operator needs to have the same password as that installed in a `machine` to be accessed--this password is preferably a random password; and [0005] (iii) chaos processes which are executed remotely. [0006] Encryption, in particular, is a necessary tool in electronic communications, wherein data of highly sensitive content is propagated through public networks. An ideal data security system using encryption technology as the principle tool should be able to provide the following three features: [0007] 1) provide identification and authentication of the data source and destination, [0008] 2) prevent unauthorized access to the data, and [0009] 3) protect the data from unauthorized tampering. [0010] Generally speaking, encryption involves turning a meaningful series of data into a meaningless and apparently random sequence. Recovery of the original meaningful sequence is only possible with certain additional information. Certain encryption systems allow a receiver of data to determine that the data has been altered following encryption. Likewise, certain ways of using encryption keys allows for electronic signature of the data, so that the receiver of the data is able to be sure who the sender is, and suitable use of the electronic signature allows both parties to be sure of the other party. [0011] The vast majority of encryption systems include two components, an algorithm, or encryption method, and a key, which, generally speaking, contains values to be used at various steps in the algorithm. [0012] For the most part, the algorithms used in encryption systems are known. The exceptions are in certain government applications, and generally it is very inadvisable for an encryption system to rely on the secrecy of the algorithm. Thus, the security of most encryption systems lies with the secrecy of the key. [0013] Generally speaking, encryption methods may be classified into groups as follows: [0014] symmetric (secret key) encryption,--as opposed to asymmetric (public key) encryption, [0015] random (one time pad) encryption,--as opposed to algorithmic encryption, [0016] block enciphering, as opposed to stream enciphering, etc. [0017] However, in each case, in the broad sense outlined above, in order to obtain a closed solution having all features of data security, there is the need to share secret information in order for the system to work [0018] Approaches for breaking into encryption systems to allow unauthorized access to the data, may be grouped into four. They are: [0019] 1. Reverse engineering [0020] 2. Cryptanalysis and mathematical methods, [0021] 3. Tape and retransmit, [0022] 4. Exploitation of human weakness. [0023] The above approaches are often used in combination and in general, secure encryption has to be based on the assumption that any key, after being used for a certain amount of time, will tend to become known. Secure communication thus requires frequent changes to the key. In particular, as available computing power is growing, key lifetime is becoming shorter and shorter. [0024] The process of regularly changing keys is known as key management, and key management is thus becoming a more and more important part of encryption and secure communication. [0025] When using symmetric encryption systems, the exact same key is needed at both parties and thus key management involves the transfer of the key from one party to another. [0026] When using asymmetric systems, key changeover is simpler. If one party changes his key, then internally he changes his private key, which is needed for reading any messages. He then only has to transmit the public key, which does not need to be kept secret. The public key is needed for encryption but is completely useless for decryption of the message. However, even in the case of asymmetric systems, there remains the issue of changeover occurrence. If one party starts to use the key before the other, then there will be a short period of unintelligible conversation. Furthermore, when one party receives a new key, he needs to be sure that the key he has received indeed comes from the other party and not from an eavesdropper. Generally, asymmetric systems use a system of mutually exchanging keys so that they are able to rely on each other. Nevertheless, difficulties remain, for example where authorized parties lose synchronization at the crucial moment of key exchange. [0027] One approach in key management involves the use of a trusted third party, a so-called certificate authority. The certificate authority manages key changes for all the users. However, the use of a certificate authority does not actually solve any of the key management problems as such, it simply moves them all on one stage. Continue reading... Full patent description for Secure communication system and method using shared random source for key changing Brief Patent Description - Full Patent Description - Patent Application Claims Click on the above for other options relating to this Secure communication system and method using shared random source for key changing patent application. ### 1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored. 3. Each week you receive an email with patent applications related to your keywords. Start now! - Receive info on patent apps like Secure communication system and method using shared random source for key changing or other areas of interest. ### Previous Patent Application: Communication unit and communication method Next Patent Application: Storage medium storing stereo enhancement processing program, stereo enhancement apparatus and stereo enhancement method Industry Class: Cryptography ### FreshPatents.com Support Thank you for viewing the Secure communication system and method using shared random source for key changing patent info. IP-related news and info Results in 0.1088 seconds Other interesting Feshpatents.com categories: Computers: Graphics , I/O , Processors , Dyn. Storage , Static Storage , Printers |
||