102 research outputs found

    Remarks on the k-error linear complexity of p(n)-periodic sequences

    Get PDF
    Recently the first author presented exact formulas for the number of 2ⁿn-periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k >2, of a random 2ⁿn-periodic binary sequence. A crucial role for the analysis played the Chan-Games algorithm. We use a more sophisticated generalization of the Chan-Games algorithm by Ding et al. to obtain exact formulas for the counting function and the expected value for the 1-error linear complexity for pⁿn-periodic sequences over Fp, p prime. Additionally we discuss the calculation of lower and upper bounds on the k-error linear complexity of pⁿn-periodic sequences over Fp

    An iterative algorithm for parametrization of shortest length shift registers over finite rings

    Get PDF
    The construction of shortest feedback shift registers for a finite sequence S_1,...,S_N is considered over the finite ring Z_{p^r}. A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for the sequence of numbers S_1,...,S_N, thus solving an open problem in the literature. The algorithm iteratively processes each number, starting with S_1, and constructs at each step a particular type of minimal Gr\"obner basis. The construction involves a simple update rule at each step which leads to computational efficiency. It is shown that the algorithm simultaneously computes a similar parametrization for the reciprocal sequence S_N,...,S_1.Comment: Submitte

    Faster Correlation Attack on Bluetooth Keystream Generator E0

    Get PDF
    Abstract. We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correlations is formulated by a recursive expression, which makes it easier to calculate correlations of the finite state machine output sequences up to 26 bits for E0 and allows us to verify the two known correlations to be the largest for the first time. Second, we apply the concept of convolution to the analysis of the distinguisher based on all correlations, and propose an efficient distinguisher due to the linear dependency of the largest correlations. Last, we propose a novel maximum likelihood decoding algorithm based on fast Walsh transform to recover the closest codeword for any linear code of dimension L and length n. It requires time O(n + L · 2 L) and memory min(n, 2 L). This can speed up many attacks such as fast correlation attacks. We apply it to E0, and our best key-recovery attack works in 2 39 time given 2 39 consecutive bits after O(2 37) precomputation. This is the best known attack against E0 so far.

    Cryptographic properties of Boolean functions defining elementary cellular automata

    Get PDF
    In this work, the algebraic properties of the local transition functions of elementary cellular automata (ECA) were analysed. Specifically, a classification of such cellular automata was done according to their algebraic degree, the balancedness, the resiliency, nonlinearity, the propagation criterion and the existence of non-zero linear structures. It is shown that there is not any ECA satisfying all properties at the same time

    Feasibility and tolerability of ophthalmic virtual reality as a medical communication tool in children and young people

    Get PDF
    Purpose Virtual reality (VR) can be useful in explaining diseases and complications that affect children in order to improve medical communications with this vulnerable patient group. So far, children and young people’s responses to high-end medical VR environments have never been assessed. Methods An unprecedented number of 320 children and young people were given the opportunity to interact with a VR application displaying original ophthalmic volume data via a commercially available tethered head-mounted display (HMD). Participants completed three surveys: demographics and experience with VR, usability and perceived utility of this technology and the Simulator Sickness Questionnaire. The second survey also probed participants for suggestions on improvements and whether this system could be useful for increasing engagement in science. Results A total of 206 sets of surveys were received. 165 children and young people (84 female) aged 12–18 years (mean, 15 years) completed surveys that could be used for analysis. 69 participants (47.59%) were VR-naïve, and 76 (52.41%) reported that they had previous VR experience. Results show that VR facilitated understanding of ophthalmological complications and was reasonably tolerated. Lastly, exposure to VR raised children and young people’s awareness and interest in science. Conclusions The VR platform used was successfully utilized and was well accepted in children to display and interact with volume-rendered 3D ophthalmological data. Virtual reality (VR) is suitable as a novel image display platform in ophthalmology to engage children and young people
    corecore