Matthew J. B. Robshaw. MD2, MD4, MD5, SHA and other hash functions. Technical Report TR-101, RSA Laboratories, 1995. version 4.0.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....input (plaintext) to the system are called synchronous (in contrast to asynchronous systems) These systems have the property that every plaintext character is enciphered independently of the others and an error in one character does not propagate to other parts of the ciphertext. As described in [29] this has two drawbacks: First, it limits the possibility to detect errors when decrypting. Second, an attacker can insert controlled changes to parts of the ciphertext and may achieve a wanted modification of the plaintext. Thus in a synchronous stream cipher a function of the internal state is ....

....register (LFSR) that can generate the same sequence. The length of this shortest LFSR is called the linear complexity of the sequence. A generalisation of this measure is the maximum order complexity [21] but it is in general harder to find. More tests and a thorough discussion can be found in [29]. 2.1 Linear Feedback Shift Registers In practice the keystream is produced by a finite state machine, giving a periodic output. The period is finite and thus the keystream may be regarded as generated by a linear feedback shift register. The Berlekamp Massey algorithm [24] can be used to find ....

M. Robshaw. Stream ciphers. Technical Report TR - 701, RSALabs, July 1995.

....appears in the ACL. This optimization does not impair security: even though in theory two di erent public keys could produce the same SHA 1 hash, such an event is extremely unlikely to occur in practice since SHA 1 is considered to be a cryptographically secure, collision resistant hash function [6, 7]. Indeed, despite extensive research, no SHA 1 collisions have been found to date. 1.3.2 ACL example Each le and each directory in SFS has an associated ACL similar to the one below: 13 sys:anyuser:rl: alias:savvides:rldiwa: alias:dm:rldiwa: localgroup:sfsdev:rliw: ....

M.J.B. Robshaw, MD2, MD4, MD5, SHA and Other Hash Functions, Technical Report TR-101, version 4.0, (RSA Laboratories, 1995)

.... in the form of random xed length bit sequences represented by a common base (e.g. 40 Hex digits representing 160 bits) The system assumes entries are roughly evenly distributed in both node and object namespaces, which can be achieved by using the output of hashing algorithms, such as SHA 1 [25]. 2.1 Routing Plaxton uses local routing maps at each node, which we call neighbor maps, to incrementally route overlay messages to the destination ID digit by digit (e.g. 8 9 8 5 9 8 4 5 9 8 where s represent wildcards) This approach is similar to longest pre x routing in the ....

Matthew J. B. Robshaw. MD2, MD4, MD5, SHA and other hash functions. Technical Report TR-101, RSA Laboratories, 1995. version 4.0.

.... in the form of random fixed length bit sequences represented by a common base (e.g. 40 Hex digits representing 160 bits) The system assumes entries are roughly evenly distributed in both node and object namespaces, which can be achieved by using the output of hashing algorithms, such as SHA 1 [25]. 2.1 Routing Plaxton uses local routing maps at each node, which we call neighbor maps, to incrementally route overlay messages to the destination ID digit by digit (e.g. 8 = 98 = 598 = 4598 where s represent wildcards) This approach is similar to longest prefix routing in the CIDR ....

Matthew J. B. Robshaw. MD2, MD4, MD5, SHA and other hash functions. Technical Report TR-101, RSA Laboratories, 1995. version 4.0.

....Y. Desmedt. Threshold Cryptography. European Transactions on Telecommunications, 5(4) 449 457, July, 1994. 10] A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proceedings of the 26th ACM Symposium on the Theory of Computing, pages 522 533, Santa Fe, 1994. [11] Y. Desmedt, G. Di Crescenzo, and M. Burmester. Multiplicative non abelian sharing schemes and their application to threshold cryptography. In J. Pieprzyk and R.Safavi Naini, editors, Proceedings ASIACRYPT 94, Lecture Notes in Computer Science 917, pages 21 32, Springer Verlag, 1995. 12] Y. ....

....amenable to analysis than many other block ciphers. Overview of Cryptanalytic Results Several techniques have been developed for analyzing the security of block ciphers, including exhaustive key search attack, statistical tests, differential cryptanalysis [2] and linear cryptanalysis [8] See [11] for detailed discussions. The last two types of attack, both considered substantial advances in recent years, are more sophisticated techniques for block cipher analysis. For differential cryptanalysis, the basic idea is to choose two plaintexts with a certain difference between them so that the ....

M.J.B. Robshaw. Block Ciphers. Technical Report TR-601, version 2.0, RSA Laboratories, July 1995.

....to the kernel. Two encryption algorithms have been incorporated into the socket layer of the Unix Server. Depending on the type of socket, connection oriented or connectionless, one of two encryption types are available: 1. If the socket is connection oriented, the user may select the RC4 [66, 67, 68] stream cipher encryption algorithm to be used on traffic passing through the socket. This is a synchronous stream cipher, meaning that the data must be in order and suffer no data loss. This is not a problem, since a reliable transport protocol such as TCP 8. SECURITY 106 guarantees these ....

M. Robshaw. Stream Ciphers. Technical Report TR-701, RSA Data Security, Inc., July 1995.

....to the kernel. Two encryption algorithms have been incorporated into the socket layer of the Unix Server. Depending on the type of socket, connection oriented or connectionless, one of two encryption types are available: 1. If the socket is connection oriented, the user may select the RC4 [66, 67, 68] stream cipher encryption algorithm to be used on traffic passing through the socket. This is a synchronous stream cipher, meaning that the data must be in order and suffer no data loss. This is not a problem, since a reliable transport protocol such as TCP 8. SECURITY 106 guarantees these ....

M. Robshaw. Security of RC4. Technical Report TR-401, RSA Data Security, Inc., July 1994.

....There are no known bad keys and though there is no proof for the lower bound of the periods of the sequences generated using RC4, theoretical analysis has established that the period is overwhelmingly likely to be greater than 10 100 . A thorough and extensive analysis into the security of RC4 [109] has found no reason to question the security offered by the RC4 keystream generator. 7.2 SEAL SEAL, which stands for software optimized encryption algorithm, is a recently published stream cipher designed by Rogaway and Coppersmith [110] SEAL is described as a length increasing pseudo random ....

M.J.B. Robshaw. Security of RC4. Technical Report TR - 401, RSA Laboratories. To appear.

....shift registers. 6.2.3 Boolean functions It is interesting to observe that with the topic of Boolean functions the design of stream ciphers and block ciphers are once again related. The interest in Boolean functions for block ciphers follows from the design of S boxes in DES like block ciphers [106]. Some of the conditions required for good S box design are essentially the same as the requirements for good combining functions. Meier and Staffelbach [85] consider a measure of the distance of an arbitrary Boolean function from the nearest linear function and introduce the idea of a perfect ....

M.J.B. Robshaw. Block Ciphers. Technical Report TR - 601, RSA Laboratories, revised July 1995.

No context found.

Matthew J. B. Robshaw. MD2, MD4, MD5, SHA and other hash functions. Technical Report TR-101, RSA Laboratories, 1995. version 4.0.

No context found.

M. J. B. Robshaw. Stream Ciphers. Technical Report TR-701, version 2.0, RSA Laboratories, July 1995.

No context found.

M. J. B. Robshaw. MD2, MD4, MD5, SHA and Other Hash Functions. Technical Report TR-101, version 4.0, RSA Laboratories, July 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC