de Weger B.M.M. (1986) `Approximation lattices of p-adic numbers', Journal of Number Theory, 24:70--88, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Research Summary - Klapper (Correct)
.... the smallest FCSR which generates the sequence if the 2 adic span is small (we call this the register sybthesis problem for FCSRs) This algorithm, which we call the 2 Adic Rational Approximation or RA algorithm, is based 6 on de Weger s lattice theoretic approach to p adic continued fractions [51]. The 2 adic span is a major new measure of cryptanalytic security. All future stream ciphers must pass this test. The taps q 1 ; q 2 ; q r on the cells of an FCSR correspond to the connection integer q = q r 2 r q r 1 2 r 1 q 1 2 1 and the sequence a 0 ; a 1 ; ....
B. M. M. de Weger, Approximation lattices of p-adic numbers, Journal of Number Theory 24 (1986) pp. 70-88.
Search Algorithms For Fcsr - Architectures And Properties (Correct)
No context found.
de Weger B.M.M. (1986) `Approximation lattices of p-adic numbers', Journal of Number Theory, 24:70--88, 1986.
Feedback Shift Registers, 2-Adic Span, and Combiners with Memory - Klapper, al. (1997) (Correct)
No context found.
B. M. M. de Weger, Approximation lattices of p-adic numbers, J. Number Theory, vol. 24, 1986, pp. 70-- 88.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC