摘要:
Use of a centralized control architecture in a network. Policy declaration, routing computation, and permission checks are managed by a logically centralized controller. By default, hosts on the network can only route to the network controller. Hosts and users must first authenticate themselves with the controller before they can request access to the network resources. The controller uses the first packet of each flow for connection setup. When a packet arrives at the controller, the controller decides whether the flow represented by that packet should be allowed. The switches use a simple flow table to forward packets under the direction of the controller. When a packet arrives that is not in the flow table, it is forwarded to the controller, along with information about which port the packet arrived on. When a packet arrives that is in the flow table, it is forwarded according to the controller's directive.
摘要:
A useful method of verifying the integrity of a cryptosystem involves using erroneous outputs to obtain secret information. In certain signature schemes which use the Chinese Remainder Theorem, a correct signature of a message and an erroneous signature of the same message permit the modulus to be easily obtained. If the content of the message is known, such cryptosystems may be cracked with only an erroneous signature of the message. Certain other authorization schemes may be cracked by analyzing a number of erroneous outputs caused by a particular type of error called a “register fault.” A security expert or cryptosystem designer may intentionally induce a tamper proof device generate a faulty computation by subjecting the device, such as a smart card, to physical stress, such as certain types of radiation, atypical voltage levels, or a higher clock rate than the device was designed to accommodate. Cryptosystems should be impervious to the attacks described herein. If not, the system should be modified or discarded.
摘要:
A word-oriented technique for generating a pseudo-random sequence, e.g., a keystream (17) for use in a stream cipher. Specifically, the technique utilizes two different arrays (653, 657) with each array having illustratively 256 32-bit elements. One array (653) contains a 256 element 32-bit S-box. An output stream generated by the S-box, i.e., St, is applied as one input to a first hash function. This hash function, in response to input St multiplied by a variable, C, provides the output keystream. S-box element St is then updated through a second hash function having, as its input, the current value of St multiplied by the variable C. The variable, C, initially a random variable, is itself updated, for use during a next iteration, through an additive combination, of its current value and a corresponding element in the second array (G), i.e., Gt. Both the S-box and G array can be initialized by, e.g., entirely filling each of these arrays with random 32-bit values. This technique, when used to generate a keystream for a stream cipher, appears to be just as secure as a conventional RC4 cipher and, by operating on a word- rather than a byte-level, is considerably faster than an RC4 keystream generator. Hence, this technique, when used in cryptographic applications, is particularly well suited for use in devices that have limited computational resources and would not be amenable to use of the RC4 stream cipher.