We have recently synthesized Ti(BH4)3(THF)3 and V(BH4)2(TMEDA)2 complexes. The reaction of TiCl3(THF)3 with NaBH4 in dry THF gave flat blue crystals, Ti(BH4)3(THF)3. The reaction of VCl3 with NaBH4 in presence of N, N, N', N'- tetramethyle...

we have recently synthesized ti(bh4)3(thf)3 and v(bh4)2(tmeda)2 complexes. the reaction of ticl3(thf)3 with nabh4 in dry thf gave flat blue crystals, ti(bh4)3(thf)3. the reaction of vcl3 with nabh4 in presence of n, n, n', n'- tetramethylethylenediamine, tmeda, produced violet crystals, v(bh4)2(tmeda)2. vibrational and magnetic properties of ti(bh4)3(thf)3 and v(bh4)2(tmeda)2 have been studied.

MD6 [17] is one of the earliest announced SHA-3 candidates, presented by Rivest at CRYPTO’08 [16]. Since then, MD6 has received a fair share of attention and has resisted several initial cryptanalytic

We classify up to multiplier equivalence optimal (v, 3, 1) binary cyclically permutable constant weight (CPCW) codes with v ≤ 61. There is a one-to-one correspondence between optimal (v, 3, 1) CPCW codes, optimal cyclic binary constant weight codes with weight 3 and minimal distance 4, (v, 3; b(v − 1)/6c) difference packings, and optimal (v, 3, 1) optical orthogonal codes. Therefore the classif...

In this paper, we investigate the security of SHA-3 candidate BLAKE. We analyse the propagation of differences that are rotation-invariant in the internal function G. We show that by using them, it is possible to obtain near-collisions for the compression function reduced to 4 rounds out of 10. We also discuss the security of some variants of BLAKE.

BLAKE is a hash function selected by NIST as one of the 14 second round candidates for the SHA-3 Competition. In this paper, we follow a bottom-up approach to exhibit properties of BLAKE and of its building blocks: based on differential properties of the internal function G, we show that a round of BLAKE is a permutation on the message space, and present an efficient inversion algorithm. For 1....

BLAKE is a hash function selected by NIST as one of the 14 second round candidates for the SHA-3 Competition. In this paper, we follow a bottom-up approach to exhibit properties of BLAKE and of its building blocks: based on differential properties of the internal function G, we show that a round of BLAKE is a permutation on the message space, and present an efficient inversion algorithm. For 1....