We consider the $\pi\pi$-scattering problem in context of Kadyshevsky equation. In this scheme, we introduce a momentum grid and provide an isospectral definition phase-shift based on spectral shift Chebyshev angle. address unnatural high tails present fitted interactions which reaches energies far beyond maximal center-of-mass energy $\sqrt{s}=1.4$ GeV. It turns out that these can be integrate...

The characteristics of nickel (Ni) block of L-type Ca current (I(Ca, L)) were studied in whole cell patch-clamped guinea pig cardiac myocytes at 37 degrees C in the absence and presence of 100 microM cAMP in the pipette solution. Ni block of peak I(Ca,L) had a dissociation constant (K(d)) of 0.33 +/- 0.03 mM in the absence of cAMP, whereas in the presence of cAMP, the K(d) was 0.53 +/- 0.05 mM ...

Algebraic attacks on LFSR-based stream ciphers recover the secret key by solving an overdefined system of multivariate algebraic equations. They exploit multivariate relations involving key bits and output bits and become very efficient if such relations of low degrees may be found. Low degree relations have been shown to exist for several well known constructions of stream ciphers immune to al...

As one of the core components in any SPN block cipher and hash function, diffusion layers are mainly introduced by matrices with maximal branch number. Surprisingly, the research on optimal binary matrices is rather limited compared with that on MDS matrices. Especially, not many general constructions for binary matrices are known that give the best possible branch number and guarantee the effi...

Stufken (1993) first introduced cyclic polygonal designs (CPDs) (in terms of cyclic balanced sampling plans excluding adjacent units (CBSAs)) for joint distance α ≥ 2. Wei (2002) first suggested the use of Langford sequence for the existence and construction of CPDs with block size k = 3 and λ = 1 for arbitrary α . Zhang and Chang (2005b) used Langford and extended Langford sequence, and constr...

We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are l...

This article describes new theoretical results concerning the general behavior of an FCSR automaton that allow to better understand the initial parameters that must be chosen to use this automaton as a basic block of a filtering stream cipher. The results demonstrated here especially concern the structure of the subjacent graph of an FCSR automaton, its entropy and the number of iterations of t...

We accelerate a double precision sparse matrix and DD vector multiplication (DD-SpMV), and its transposition and DD vector multiplication (DD-TSpMV) by using SIMD AVX2 for Krylov subspace methods. We compare some storage formats of DD-SpMV and DDTSpMV for AVX2 to eliminate performance degradation factors in CRS. Our experience indicates that BCRS4x1, with fitting block size to the SIMD register...

We describe a cryptanalytical technique for distinguishing some stream ciphers from a truly random process. Roughly, the ciphers to which this method applies consist of a “non-linear process” (say, akin to a round function in block ciphers), and a “linear process” such as an LFSR (or even fixed tables). The output of the cipher can be the linear sum of both processes. To attack such ciphers, we...