B. Schneier, Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowfish) , Proceedings of the 1993 Cambridge Security Workshop, 191--204, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....null stacked file system. It transfers file pages but provides no name translation. Cryptfs adds file and name encryption; it uses a single, static key for the entire file system. Both Base and Cryptfs are samples from the FiST distribution [33] To provide a fair comparison, we replaced Blowfish [29] with Rijndael in Cryptfs, improving its performance. ZIA is as described in this paper. ZIANPC obtains a key on every disk access; it provides neither caching nor prefetching of keys. Each experiment consists of 20 runs. Before each set, we compile the same source in a separate location. This ....

....goals and shortcomings of CFS. A user supplies his keys only once; thereafter, the file system is empowered to decrypt files on the user s behalf. Cryptfs significantly outperforms CFS, and our benchmarks show Cryptfs in an even better light. This is primarily due to the replacement of Blowfish [29] with Rijndael [8] Microsoft Windows 2000 provides the Encrypting File System (EFS) 19] While EFS solves many administrative issues, it is essentially no di#erent from CFS or Cryptfs. A single password serves as the key encrypting key for on disk, per file keys. EFS still depends on screen ....

B. Schneier. Description of a new variable-length key, 64-bit block cipher (Blowfish). In Fast Software Encryption, Lecture Notes in Computer Science, pages 191--204. Spring-Verlag, 1994.

..... that is equal to encrypt(23; Tom; 70K; Maple; 40) The second is encrypted to 1000000000011101. equal to encrypt(860; Mary; 60K; Main; 80) We treat the encryption function as a black box in our discussion. Any block cipher technique such as AES [1] RSA [11] Blow sh [12], DES [3] etc. can be used to encrypt the tuples. The second column corresponds to the index on the employee ids. For example, value for attribute eid in the rst tuple is 23, and its corresponding partition is [0; 200] Since this partition is identi ed to 2, we store the value 2 as the ....

....for these tables: Lineitem : l shipdate, l discount, l quantity Orders : o orderdate,o custkey,o shippriority Customer : c custkey Partitions have been created based on the partitioning criteria described below. To encrypt the rows of the relations, we used the Blow sh encryption algorithm [12] implemented in Java. Partitioning Algorithm: We used equi width and equidepth histograms [9] to partition the data for two di erent classes of queries. Equi width and equi depth histograms have been widely used and investigated in the context of selectivity estimation in databases [7, 8] ....

B. Schneier. Description of a new variable-length key, block cipher (blow sh), fast software encryption. In Cambridge Security Workshop Proceedings, 1994.

....control via SSL certificates and use Tarzan tunnels as an anonymous VPN. All built in cryptographic operations are implemented by the SFS crypt library. The payloads of all Tarzan packets, which include encapsulated IP headers in data packets, are encrypted in CBC mode with a 20 byte Blowfish [24] key. Each packet includes an 8 byte random initialization vector. A pseudo random generator based on DSS generates symmetric keys, IVs, and flow identifier Pkt size Latency Throughput (bytes) sec) pkts s) Mbits s) 64 244 14000 7.2 512 376 8550 35.0 1024 601 7325 60.0 Table 2: Per hop ....

SCHNEIER, B. Description of a new variable-length key, 64-bit block cipher (Blowfish). Lecture Notes in Computer Science 809 (1994), 191--204.

....control via SSL certificates and use Tarzan tunnels as an anonymous VPN. All built in cryptographic operations are implemented by the SFS crypt library. The payloads of all Tarzan packets, which include encapsulated IP headers in data packets, are encrypted in CBC mode with a 20 byte Blowfish [23] key. Each packet includes an 8 byte random initialization vector. Tarzan uses the Rabin public key cryptosystem [29] to encrypt the forward path session key for tunnel establishment. The Rabin implementation is secure against adaptive chosen ciphertext attacks and is plaintext aware. 40 A ....

B. Schneier. Description of a new variable-length key, 64-bit block cipher (Blowfish). Lecture Notes in Computer Science, 809:191--204, 1994.

....than the number of input bits. In this way, it is very likely that the entries in the XOR distribution table of a randomly chosen injective s box will have only small values, making the block cipher resistant to differential cryptanalysis. Some proposed block ciphers, such as CAST [4] and Blowfish [5], take advantage of this property. On the other hand, Biham [6] proved that if for an r, x m s box described by f: Z Z we have m 2 r, then at least one linear combination of the output bits must be an affine combination of the input bits and the block cipher can be trivially broken by ....

B. Schneier. Description of a new variable-length key, 64-bit block cipher (Blowfish). Proc. of Fast Software Encryption Workshop, LNCS 809, Springer-Verlag, Berlin, pp. 191-204, 1994.

....than the number of input bits. In this way, it is very likely that the entries in the XOR distribution table of a randomly chosen injective s box will have only small values, making the block cipher resistant to differential cryptanalysis. Some proposed block ciphers, such as CAST [1] and Blowfish [11], take advantage of this property. On the other hand, Biham proved that if for an n x m s box described by f: g g we have m 2 n, then at least one linear combination of the output bits must be an affine combination of the input bits and the block cipher can be trivially broken by linear ....

....linear combination of the output bits must be an affine combination of the input bits and the block cipher can be trivially broken by linear cryptanalysis. Highly nonlinear 8 x 32 s boxes are particularly interesting because some practical ciphers are based on s boxes with these dimensions [1] [11]. The expected value of the nonlinearity of randomly selected injective s boxes is studied in [14] where it was found that the expected nonlinearity of a randomly selected 8 x 32 s boxes is about 72. Mister and Adams [9] presented a construction method for injective s boxes from bent functions. ....

B. Schneier. Description of a new variable-length key, 64-bit block cipher (Blowfish). Proc. of Fast Software Encryption Workshop, LNCS 809, SpringerVerlag, Berlin, pp. 191-204, 1994.

....cost over larger data. The second dimension is software versus hardware level implementation of encryption algorithms. Our results show that the choice makes significant impact on the performance. 5.1. Software level encryption We considered two encryption algorithms: a) RSA [10] and b) Blowfish [11]. We conducted experiments using both these algorithms and found that the performance of the Blowfish algorithm we implemented in Java is better than the RSA implementation available to us. We report on our experience with the Blowfish algorithm. Blowfish is fast, compact, and simple, compared to ....

B. Schneier. Description of a new variable-length key, block cipher (blowfish), fast software encryption. In Cambridge Security Workshop Proceedings, pages 191--204, 1994.

....5.2 JPHide JPHide is a steganographic system by Allan Latham. There are two versions: 0.3 and 0.5. Version 0.5 supports additional compression of the hidden message. As a result, they use slightly di erent headers to store embedding information. Before the content is embedded, it is Blow sh [16] encrypted with a usersupplied pass phrase. Because the DCT coecients are not selected continuously from the beginning, JPHide is more dicult to detect. The program uses a xed table that de nes classes of DCT coecients to determine in which order to modify the coecients. All coecients in the ....

Bruce Schneier. Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowsh). In Fast Software Encryption, Cambridge Security Workshop Proceedings, pages 191-204. Springer-Verlag, December 1993.

....5.2 JPHide JPHide is a steganographic system by Allan Latham. There are two versions: 0.3 and 0.5. Version 0.5 supports additional compression of the hidden message. As a result, they use slightly di erent headers to store embedding information. Before the content is embedded, it is Blow sh [12] encrypted with a user supplied pass phrase. Because the DCT coecients are not selected continuously from the beginning, JPHide is slightly more dicult to detect. The program uses a xed table that determines which coecient to modify next. The coecients are selected by the table in such a way ....

Bruce Schneier. Description of a New VariableLength Key, 64-Bit Block Cipher (Blowsh). In Fast Software Encryption, Cambridge Security Workshop Proceedings, pages 191-204. SpringerVerlag, December 1993.

....applied in the same way. The most famous examples of weak keys are perhaps those for DES [25] which exploit a structural property of the cipher. In the case of DES their existence has only a very limited security implication. Other ciphers with classes of weak keys are IDEA [19, 3] and Blowfish [30, 32] where the weakness might allow cryptanalysis of the cipher in some very limited, and typically unlikely, situations. Since the publication of RC5 there have been no reported examples of weak keys. This includes ones demonstrating a structural weakness or ones allowing a limited form of ....

B. Schneier. Description of a new variable-length key, 64-bit block cipher (Blowfish). In R. Anderson, editor, Fast Software Encryption, volume 809 of Lecture Notes in Computer Science, pages 191--204, 1994. Springer Verlag.

....and 3 Theta 2 51 chosen plaintexts against sixteen rounds. When the F function is safely kept private, one can detect whether it is weak or not with a differential attack using 2 22 plaintexts against eight rounds. Blowfish was proposed by Schneier in the Cambridge Security Workshop [6]. It appears to be a very fast encryption function when we always use the same private key. It is based on the Feistel cipher [4] Differential cryptanalysis [3] is known to be one of the most powerful attack on this kind of cipher. The design of Blowfish includes the new feature that the s boxes ....

....weak keys, a differential cryptanalysis may be successful. This paper shows the first analysis of Blowfish, as an answer to the Dr Dobb s Journal Blowfish Cryptanalysis Contest proposed in [7] 1 Blowfish Blowfish encrypts a 64 bit plaintext into a 64 bit ciphertext using a variable key length [6]. The encryption proceeds with a suggested number of Laboratoire d Informatique de l Ecole Normale Sup erieure, research group affiliated with the CNRS 1 t = 16 rounds. In the following, we may consider a smaller number of rounds t. First, the key is expanded into a 4168 bytes key following a ....

B. Schneier. Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowfish). In Fast Software Encryption -- Proceedings of the Cambridge Security Workshop, Cambridge, United Kingdom, Lectures Notes in Computer Science 809, pp. 191--204, Springer-Verlag, 1994.

....(with no round dependence) then such cipher can be attacked easily using slide attacks. This shows that slide attacks are not restricted to ciphers with weak key scheduling algorithms. For an example of how this might work consider a cipher called Blow sh, which was designed by Bruce Schneier [14]. This is a Feistel cipher with 64 bit block, 16 rounds and up to 448 bits of the secret key. These are expanded into a table consisting of four S boxes from 8 to 32 bits (4096 bytes total) S boxes are key dependent and unknown to the attacker. Also in each round a 32 bit subkey P i is xored to ....

B. Schneier, Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowsh), LNCS 809, FSE'94 Proceedings, pp.191-204, Springer-Verlag, 1994.

No context found.

B. Schneier, Description of a New Variable-Length Key, 64-Bit Block Cipher (Blow sh), in R. Anderson, ed., Fast Software Encryption, Cambridge Security Workshop Proceedings (Springer-Verlag, 1994) 191-204.

No context found.

B. Schneier, \Description of a New Variable-Length Key, 64-Bit Block Cipher (Blow sh)," Fast Software Encryption, Cambridge Security Workshop Proceedings, Springer-Verlag, 1994, pp. 191-204.

No context found.

B. Schneier, \Description of a New Variable-Length Key, 64-Bit Block Cipher (Blow sh)," Fast Software Encryption, Cambridge Security Workshop Proceedings, Springer-Verlag, 1994, pp. 191-204.

No context found.

B. Schneier, \Description of a New Variable-Length Key, 64-Bit Block Cipher (Blow sh)," Fast Software Encryption, Cambridge Security Workshop Proceedings, Springer-Verlag, 1994, pp. 191-204.

No context found.

B. Schneier, \Description of a New Variable-Length Key, 64-Bit Block Cipher (Blow sh)," Fast Software Encryption, Cambridge Security Workshop Proceedings, Springer-Verlag, 1994, pp. 191-204.

No context found.

B. Schneier, \Description of a New Variable-Length Key, 64-Bit Block Cipher (Blow sh)," Fast Software Encryption, Cambridge Security Workshop Proceedings, Springer-Verlag, 1994, pp. 191-204.

No context found.

B. Schneier, \Description of a New Variable-Length Key, 64-Bit Block Cipher (Blow sh)," Fast Software Encryption, Cambridge Security Workshop Proceedings, Springer-Verlag, 1994, pp. 191-204.

No context found.

B. Schneier, Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowfish) , Proceedings of the 1993 Cambridge Security Workshop, 191--204, 1994.

No context found.

B. Schneier. Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowfish). In Fast Software Encryption, Cambridge Security Workshop Proceedings, pages 191--204. Springer-Verlag, December 1993.

No context found.

B. Schneier. Description of a new variable-length key, 64-bit block cipher (Blow sh). In, R. Anderson editor, Proceedings of FSE 1, LNCS 809, pages 191-204, 1994.

No context found.

B. Schneier. Description of a new variable-length key, 64-bit block cipher (Blowfish). In Lecture Notes in Computer Science, Fast Software Encryption --- Cambridge Security Workshop Proceedings, vol. 809, pp. 191--204. Springer-Verlag, 1994. 12

No context found.

SCHNEIER, B. Description of a new variable-length key, 64-bit block cipher (Blowfish). In Fast Software Encryption, Cambridge Security Workshop Proceedings (December 1993), Springer-Verlag, pp. 191-- 204.

No context found.

B. Schneier. Description of a new variable-length key, 64-bit block cipher (Blowfish). Lecture Notes in Computer Science, 809:191--204, 1994.

First 50 documents

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