Comparison of microwave-assisted and conventional preparations of cyclic imides

Microwave-assisted preparation of several cyclic imides was performed with four different cyclic anhydrides. All the reactions are significantly faster and the isolated yields are significantly higher compared to conventionally heated reactions. Furthermore, many of these reactions can be performed with a minimal amount of solvent, thereby enabling the synthetic chemist to obtain high quantities of pure cyclic imides in a matter of hours.     

On the complexity of the herding attack and some related attacks on hash functions

In this article, we analyze the complexity of the construction of the 2 ^k -diamond structure proposed by Kelsey and Kohno (LNCS, Vol 4004, pp 183–200, 2006). We point out a flaw in their analysis and show that their construction may not produce the desired diamond structure. We then give a more rigorous and detailed complexity analysis of the construction of a diamond structure. For this, we appeal to random graph theory (in particular, to the theory of random intersection graphs), which allows us to determine sharp necessary and sufficient conditions for the message complexity (i.e., the number of hash computations required to build the required structure). We also analyze the computational complexity for constructing a diamond structure, which has not been previously studied in the literature. Finally, we study the impact of our analysis on herding and other attacks that use the diamond structure as a subroutine. Precisely, our results shows the following:

1. The message complexity for the construction of a diamond structure is ${\sqrt{k}}$ times more than the amount previously stated in literature.

1. The time complexity is n times the message complexity, where n is the size of hash value.

Due to the above two results, the herding attack (Kelsey and Kohno, LNCS, Vol 4004, pp 183–200, 2006) and the second preimage attack (Andreeva et?al., LNCS, Vol 4965, pp 270–288, 2008) on iterated hash functions have increased complexity. We also show that the message complexity of herding and second preimage attacks on “hash twice” is n times the complexity claimed by Andreeva et?al. (LNCS, Vol 5867, pp 393–414, 2009), by giving a more detailed analysis of the attack.     

Field dependent nilpotent symmetry for gauge theories

We present predictions for the inclusive production of D mesons at the CERN LHC in the general-mass variable-flavor-number scheme at next-to-leading order. Detailed numerical results are compared to data where available, or presented in a way to ease future comparisons with experimental results. We also point out that measurements at large rapidity have the potential to pin down models of intrinsic charm.     

Synthesis of 1D β-MnO2 for high-performance supercapacitor application

Journal of Solid State Electrochemistry - Electrochemical supercapacitors (ESs) still need to overcome development obstacles in order to realize their full potential while being acknowledged as a...