The following pages link to Ana Sălăgean (Q505071):
Displayed 32 items.
- Counting and characterising functions with ``fast points'' for differential attacks (Q505073) (← links)
- Item:Q505071 (redirect page) (← links)
- Parallelisation of genetic algorithms for the 2-page crossing number problem (Q866771) (← links)
- On the structure of linear and cyclic codes over a finite chain ring (Q1573766) (← links)
- On the key equation over a commutative ring (Q1580538) (← links)
- Item:Q505071 (redirect page) (← links)
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring. (Q1870034) (← links)
- New generalized almost perfect nonlinear functions (Q1995225) (← links)
- Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions (Q2130055) (← links)
- Counting Boolean functions with faster points (Q2200517) (← links)
- Discrete antiderivatives for functions over \(\mathbb{F}_p^n\) (Q2302151) (← links)
- Computing the linear complexity for sequences with characteristic polynomial \(f^v\) (Q2392687) (← links)
- Higher order differentiation over finite fields with applications to generalising the cube attack (Q2407059) (← links)
- Repeated-root cyclic and negacyclic codes over a finite chain ring (Q2489937) (← links)
- Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings (Q2567153) (← links)
- (Q2741415) (← links)
- Strong Gröbner bases for polynomials over a principal ideal ring (Q2777726) (← links)
- On the Stability of m-Sequences (Q3104700) (← links)
- Comparison of Cube Attacks Over Different Vector Spaces (Q3460109) (← links)
- On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two (Q3547576) (← links)
- An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform (Q3588585) (← links)
- On the Hamming distance of linear codes over a finite chain ring (Q4503568) (← links)
- Gröbner bases and products of coefficient rings (Q4532584) (← links)
- (Q4664095) (← links)
- (Q4945364) (← links)
- An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations (Q4974030) (← links)
- Apology for Citation Omission in “An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations” [Oct 09 4695-4700 (Q5281373) (← links)
- Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences (Q5447518) (← links)
- On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two (Q5450824) (← links)
- One- and two-page crossing numbers for some types of graphs (Q5747710) (← links)
- Further constructions and characterizations of generalized almost perfect nonlinear functions (Q6088856) (← links)
- Probabilistic estimation of the algebraic degree of Boolean functions (Q6088862) (← links)