Reduction of Secondary Carboxamides to Imines

This article reports in detail on the discovery that zirconium(IV) salts of secondary amides and lactams are transformed by Cp(2)ZrHCl to N-substituted imines in one step. The method represents the first controlled reduction of amides and lactams to the corresponding imines, a transformation that is otherwise very difficult to achieve because imines are reduced more rapidly than carboxamides by most metal hydride reagents. No products of reductive cleavage of the carboxamides are observed. Efforts to replace 2 mol equiv of Cp(2)ZrHCl with simpler, less costly alternatives led to the finding that a diisobutylaluminum enolate can be substituted for the initial zirconium enolate. Such aluminum amides are smoothly reduced to the corresponding imine using Cp(2)ZrHCl in good yield. Moreover, aluminum amides are also reduced to imines using either low-valent titanium species or triethylsilane. In these alternative procedures, use of Cp(2)ZrHCl is eliminated altogether in the title transformation.     

Quantification of surface functional groups on polymer microspheres by supramolecular host-guest interactions

We introduce a method to determine the number of accessible functional groups on a polymer microsphere surface based on the interaction between the macrocyclic host cucurbit[7]uril (CB7) and a guest reacted to the microsphere surface. After centrifugation, CB7 in the supernatant is quantified by addition of a fluorescent dye. The difference between added and detected CB7 affords the number of accessible surface functional groups.     

Vectorial Approach to Fast Correlation Attacks

A new, vectorial approach to fast correlation attacks on binary memoryless combiners is proposed. Instead of individual input sequences or their linear combinations, the new attack is targeting subsets of input sequences as a whole thus exploiting the full correlation between the chosen subset and the output sequence. In particular, the set of all the input sequences can be chosen as the target. The attack is based on a novel iterative probabilistic algorithm which is also applicable to general memoryless combiners over finite fields or finite rings. To illustrate the effectiveness of the introduced approach, experimental results obtained for random balanced combining functions are presentedMost of this work was done while he was with Rome CryptoDesign Center, Gemplus, Italy     

On the Motion of a Dynamic System with Minimal Dissipation

The motion of a holonomic scleronomic non-conservative mechanicalsystem with minimal dissipation is considered. As applicationsof the theory several problems are studied in detail.     

Poisson traces,D-modules,and symplectic resolutions

We survey the theory of Poisson traces (or zeroth Poisson homology) developed by the authors in a series of recent papers. The goal is to understand this subtle invariant of (singular) Poisson varieties, conditions for it to be finite-dimensional, its relationship to the geometry and topology of symplectic resolutions, and its applications to quantizations. The main technique is the study of a canonical D-module on the variety. In the case the variety has finitely many symplectic leaves (such as for symplectic singularities and Hamiltonian reductions of symplectic vector spaces by reductive groups), the D-module is holonomic, and hence, the space of Poisson traces is finite-dimensional. As an application, there are finitely many irreducible finite-dimensional representations of every quantization of the variety. Conjecturally, the D-module is the pushforward of the canonical D-module under every symplectic resolution of singularities, which implies that the space of Poisson traces is dual to the top cohomology of the resolution. We explain many examples where the conjecture is proved, such as symmetric powers of du Val singularities and symplectic surfaces and Slodowy slices in the nilpotent cone of a semisimple Lie algebra. We compute the D-module in the case of surfaces with isolated singularities and show it is not always semisimple. We also explain generalizations to arbitrary Lie algebras of vector fields, connections to the Bernstein–Sato polynomial, relations to two-variable special polynomials such as Kostka polynomials and Tutte polynomials, and a conjectural relationship with deformations of symplectic resolutions. In the appendix we give a brief recollection of the theory of D-modules on singular varieties that we require.     

Fusion around the barrier for 7Li+12C

Fusion cross-sections for the ⁷Li + ¹²C reaction have been measured at energies above the Coulomb barrier by the direct detection of evaporation residues. The heavy evaporation residues with energies below 3 MeV could not be separated out from the α-particles in the spectrum and hence their contribution was estimated using statistical model calculations. The present work indicates that suppression of fusion cross-sections due to the breakup of ⁷Li may not be significant for ⁷Li + ¹²C reaction at energies around the barrier.     

Correlation Analysis of the Alternating Step Generator

The alternating step generator is a well-known keystream generator consisting of two stop/go clocked LFSRs, LFSR₁ and LFSR₂, whose clocks are controlled by another LFSR, LFSR₃, which is clocked regularly. A probabilistic analysis of this generator is conducted which shows that the posterior probabilites of individual bits of the first derivatives of the regularly clocked LFSR₁ and LFSR₂ sequences, when conditioned on a given segment of the first derivative of the keystream sequence, can be computed efficiently in a number of probabilistic models of interest. The expected values of these probabilities, for a random keystream sequence, are derived by an approximate theoretical analysis and are also verified by systematic computer experiments. It is pointed out that these posterior probabilities can be enhanced in a resynchronization scenario and thus used for a low-complexity fast correlation attack on the two LFSRs. More generally, it is argued that even without resynchronization these probabilities may be significantly different from one half for fast correlation attacks based on iterative decoding algorithms to be successful, although with incresead complexity. A related method for computing the posterior probabilities of individual bits of the LFSR₃ sequence, when conditioned on both the keystream sequence and the LFSR₁ and LFSR₂ sequences, is also developed. As these posterior probabilities are much more different from one half, they can be used for a low-complexity fast correlation attack on LFSR₃, provided that the initial states of LFSR₁ and LFSR₂ are previously reconstructed.