Results 231 to 240 of about 531,507 (259)
Some of the next articles are maybe not open access.
On the Linear Complexity of the Power Generator
Designs, Codes and Cryptography, 2001Let \(\vartheta, m\) and \(e\) be integers such that \(\text{gcd}(\vartheta,m) = 1\). Then one can define the sequence \((u_n)\) by \[ u_n \equiv u_{n-1}^e (\bmod m), \quad 0 \leq u_n \leq m-1, n = 1,2,\dots,\tag{pg} \] with the initial value \(u_0 = \vartheta\). This sequence is known as the power generator, and in the two special cases \(\text{gcd}(e,
openaire +2 more sources
Multitarget Filtering With Linearized Complexity
IEEE Transactions on Signal Processing, 2018An algorithm for the estimation of multiple targets from partial and corrupted observations is introduced based on the concept of a partially distinguishable multitarget system. It combines the advantages of engineering solutions like multiple hypothesis tracking with the rigor of point-process-based methods.
Jeremie Houssineau, Daniel E. Clark
openaire +3 more sources
On the Complexity of Linear Authorization Logics
2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012Linear authorization logics (LAL) are logics based on linear logic that can be used for modeling effect-based authentication policies. LAL has been used in the context of the Proof-Carrying Authorization framework, where formal proofs are constructed in order for a principal to gain access to some resource elsewhere.
openaire +2 more sources
Complexity of Linear Standard Theories
2007We give an algorithm for deciding E-unification problems for linear standard equational theories (linear equations with all shared variables at a depth less than two) and varity 1 goals (linear equations with no shared variables). We show that the algorithm halts in quadratic time for the non-uniform E-unification problem, and linear time if the ...
Christopher Lynch, Barbara Morawska 0001
openaire +1 more source
Linear complexity in coding theory
1988The linear complexity of sequences is defined and its main properties reviewed. The linear complexity of periodic sequences is examined in detail and an extensive list of its properties is formulated. The discrete Fourier transform (DFT) of a finite sequence is then connected to the linear complexity of a periodic sequence by Blahut's theorem.
James L. Massey, Thomas Schaub
openaire +1 more source
On the Descriptive Complexity of Linear Algebra
2008The central open question in the field of descriptive complexity theory is whether or not there is a logic that expresses exactly the polynomial-time computable properties of finite structures. It is known, from the work of Cai, Furer and Immerman that fixed-point logic with counting (${\ensuremath{\textsf{FP}+\textsf{C}}}$) does not suffice for this ...
openaire +2 more sources
On the linear complexity and linear complexity profile of sequences in finite fields [PDF]
, 2002 Pseudo random sequences, that are used for stream ciphers, are required to havetheproperties of unpredictability and randomness. An important tool for measuringthese features is the linear complexity profile of the sequence in use.In this thesis we present a survey of some recent results obtained on linearcomplexity and linear complexity profile of ...
openaire
Aspects of local linear complexity.
1989The concept of linear complexity is important in cryptography, and in particular in the study of stream ciphers. There are two varieties of linear complexity; global linear complexity, which applies to infinite periodic binary sequences, and local linear complexity, which applies to binary sequences of finite length.This thesis is concerned primarily ...
openaire +2 more sources