The use of FK-506 for small intestine llotransplantation: Inhibition of acute rejection and prevention of fatal graft-versus-host disease

Small intestine allotransplantation in humans is not yet feasible due to the failure of the current methods of immunosuppression. FK-506, a powerful new immunosuppressive agent that is synergistic with cyclosporine, allows long-term survival of recipients of cardiac, renal, and hepatic allografts. This study compares the effects of FK-506 and cyclosporine on host survival, graft rejection, and graft-versus-host-disease in a rat small intestine transplantation model. Transplants between strongly histoincompatible ACI and Lewis (LEW) strain rats, and their Fi progeny are performed so that graft rejection alone is genetically permitted (F1→LEW) or GVHD alone permitted (LEW→F1) or that both immunologic processes are allowed to occur simultaneously (ACI—»LEW). Specific doses of FK-506 result in prolonged graft and host survival in all genetic combinations tested. Furthermore, graft rejection is prevented (ACI→LEW model) or inhibited (rejection only model) and lethal acute GVHD is eliminated. Even at very high doses, cyclosporine did not prevent graft rejection or lethal GVHD, nor did it allow long-term survival of the intestinal graft or the host. Animals receiving low doses of cyclosporine have outcomes similar to the untreated control groups. No toxicity specific to FK-506 is noted, but earlier studies by other investigators suggest otherwise. © 1990 by Williams & Wilkin

On effects of regular S=1 dilution of S=1/2 antiferromagnetic Heisenberg chains by a quantum Monte Carlo simulation

The effects of regular S=1 dilution of S=1/2 isotropic antiferromagnetic chain are investigated by the quantum Monte Carlo loop/cluster algorithm. Our numerical results show that there are two kinds of ground-state phases which alternate with the variation of $S^1=1$ concentration. When the effective spin of a unit cell is half-integer, the ground state is ferrimagnetic with gapless energy spectrum and the magnetism becomes weaker with decreasing of the $S^1$ concentration $\rho = 1/M$. While it is integer, a non-magnetic ground state with gaped spectrum emerges and the gap gradually becomes narrowed as fitted by a relation of $\Delta \approx 1.25\sqrt{\rho}$.Comment: 6 pages, 9 figure

Entanglement and quantum phase transition in quantum mixed spin chains

The ground entanglement and thermal entanglement in quantum mixed spin chains consisting of two integer spins 1 and two half integer spins 1/2 arrayed as ${1/2}-{1/2}-1-1$ in a unit cell with antiferromagnetic nearest-neighbor couplings $J_1$($J_2$) between the spins of equal (different) magnitudes, are investigated by adopting the log-negativity. The ground entanglement transition found here is closely related with the valence bond state transition, and the thermal entanglement near the critical point is calculated and shown that two distinct behaviors exist in the nearest neighbor same kind of spins and different kind of spins, respectively. The potential application of our results on the quantum information processing is also discussed.Comment: 5 pages, 4 figures, RevTex4, A minor correction is added into the figure captio

Critical phase of a magnetic hard hexagon model on triangular lattice

We introduce a magnetic hard hexagon model with two-body restrictions for configurations of hard hexagons and investigate its critical behavior by using Monte Carlo simulations and a finite size scaling method for discreate values of activity. It turns out that the restrictions bring about a critical phase which the usual hard hexagon model does not have. An upper and a lower critical value of the discrete activity for the critical phase of the newly proposed model are estimated as 4 and 6, respectively.Comment: 11 pages, 8 Postscript figures, uses revtex.st

Lower Bounds on the Degree of Block Ciphers

Only the method to estimate the upper bound of the algebraic degree on block ciphers is known so far, but it is not useful for the designer to guarantee the security. In this paper we provide meaningful lower bounds on the algebraic degree of modern block ciphers

Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly

The cube attack is an important technique for the cryptanalysis of symmetric key primitives, especially for stream ciphers. Aiming at recovering some secret key bits, the adversary reconstructs a superpoly with the secret key bits involved, by summing over a set of the plaintexts/IV which is called a cube. Traditional cube attack only exploits linear/quadratic superpolies. Moreover, for a long time after its proposal, the size of the cubes has been largely confined to an experimental range, e.g., typically 40. These limits were first overcome by the division property based cube attacks proposed by Todo et al. at CRYPTO 2017. Based on MILP modelled division property, for a cube (index set) II, they identify the small (index) subset JJ of the secret key bits involved in the resultant superpoly. During the precomputation phase which dominates the complexity of the cube attacks, 2|I|+|J|2|I|+|J| encryptions are required to recover the superpoly. Therefore, their attacks can only be available when the restriction |I|+|J|<n|I|+|J|<n is met. In this paper, we introduced several techniques to improve the division property based cube attacks by exploiting various algebraic properties of the superpoly. 1. We propose the ``flag'' technique to enhance the preciseness of MILP models so that the proper non-cube IV assignments can be identified to obtain a non-constant superpoly. 2. A degree evaluation algorithm is presented to upper bound the degree of the superpoly. With the knowledge of its degree, the superpoly can be recovered without constructing its whole truth table. This enables us to explore larger cubes II's even if |I|+|J|≥n|I|+|J|≥n. 3. We provide a term enumeration algorithm for finding the monomials of the superpoly, so that the complexity of many attacks can be further reduced. As an illustration, we apply our techniques to attack the initialization of several ciphers. To be specific, our key recovery attacks have mounted to 839-round TRIVIUM, 891-round Kreyvium, 184-round Grain-128a and 750-round ACORN respectively

A Key-recovery Attack on 855-round Trivium

In this paper, we propose a key-recovery attack on Trivium reduced to 855 rounds. As the output is a complex Boolean polynomial over secret key and IV bits and it is hard to find the solution of the secret keys, we propose a novel nullification technique of the Boolean polynomial to reduce the output Boolean polynomial of 855-round Trivium. Then we determine the degree upper bound of the reduced nonlinear boolean polynomial and detect the right keys. These techniques can be applicable to most stream ciphers based on nonlinear feedback shift registers (NFSR). Our attack on $855$-round Trivium costs time complexity $2^{77}$. As far as we know, this is the best key-recovery attack on round-reduced Trivium. To verify our attack, we also give some experimental data on 721-round reduced Trivium