Ana Salagean

Publication Activity (10 Years)

Years Active: 1999-2022
Publications (10 Years): 6

Top Topics

Boolean Functions

Countermeasures

Top Venues

Des. Codes Cryptogr.

Cryptogr. Commun.

Publications

Ana Salagean, Pantelimon Stanica
Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions. Cryptogr. Commun. 14 (2) (2022)
Ferruh Özbudak, Ana Salagean
New generalized almost perfect nonlinear functions. Finite Fields Their Appl. 70 (2021)
Ana Salagean, Ferruh Özbudak
Counting Boolean functions with faster points. Des. Codes Cryptogr. 88 (9) (2020)
Ana Salagean
Discrete antiderivatives for functions over $\mathop {{\mathbb {F}}}_p^n$. Des. Codes Cryptogr. 88 (3) (2020)
Ana Salagean, Richard Winter, Matei Mandache-Salagean, Raphael C.-W. Phan
Higher order differentiation over finite fields with applications to generalising the cube attack. Des. Codes Cryptogr. 84 (3) (2017)
Ana Salagean, Matei Mandache-Salagean
Counting and characterising functions with "fast points" for differential attacks. Cryptogr. Commun. 9 (2) (2017)
Richard Winter, Ana Salagean, Raphael C.-W. Phan
Comparison of Cube Attacks Over Different Vector Spaces. IMACC (2015)
Hongmei He, Ana Salagean, Erkki Mäkinen, Imrich Vrt'o
Various heuristic algorithms to minimise the two-page crossingnumbers of graphs. Open Comput. Sci. 5 (1) (2015)
Richard Winter, Ana Salagean, Raphael C.-W. Phan
Comparison of cube attacks over different vector spaces. IACR Cryptol. ePrint Arch. 2015 (2015)
Ana Salagean, Matei Mandache-Salagean, Richard Winter, Raphael C.-W. Phan
Higher Order Differentiation over Finite Fields with Applications to Generalising the Cube Attack. CoRR (2014)
David Gardner, Ana Salagean, Raphael C.-W. Phan
Efficient Generation of Elementary Sequences. IMACC (2013)
Ana Salagean, Alex J. Burrage, Raphael C.-W. Phan
Computing the linear complexity for sequences with characteristic polynomial f v. Cryptogr. Commun. 5 (2) (2013)
Ana Salagean, David Gardner, Raphael Chung-Wei Phan
Index Tables of Finite Fields and Modular Golomb Rulers. SETA (2012)
Alex J. Burrage, Ana Salagean, Raphael C.-W. Phan
. ISIT (2011)
Alex J. Burrage, Ana Salagean, Raphael C.-W. Phan
On the Stability of m-Sequences. IMACC (2011)
Hongmei He, Ana Salagean, Erkki Mäkinen
One- and two-page crossing numbers for some types of graphs. Int. J. Comput. Math. 87 (8) (2010)
Ana Salagean
Apology for citation omission in "an algorithm for computing minimal bidirectional linear recurrence relations". IEEE Trans. Inf. Theory 56 (8) (2010)
Ana Salagean, Alexandra Alecu
-Error Linear Complexity of Sequences Using the Discrete Fourier Transform. SETA (2010)
Ana Salagean
An algorithm for computing minimal bidirectional linear recurrence relations. IEEE Trans. Inf. Theory 55 (10) (2009)
Alexandra Alecu, Ana Salagean
An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform. ISIT (2008)
Ana Salagean
An algorithm for computing minimal bidirectional linear recurrence relations. ISIT (2008)
Alexandra Alecu, Ana Salagean
-Error Linear Complexity of Binary Sequences. IMACC (2007)
Alexandra Alecu, Ana Salagean
A genetic algorithm for computing the k-error linear complexity of cryptographic sequences. IEEE Congress on Evolutionary Computation (2007)
Hongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen
Parallelisation of genetic algorithms for the 2-page crossing number problem. J. Parallel Distributed Comput. 67 (2) (2007)
Yee Chung Cheung, Paul Wai Hing Chung, Ana Salagean
A Set Theoretic View of the ISA Hierarchy. IEA/AIE (2006)
Ana Salagean
Repeated-root cyclic and negacyclic codes over a finite chain ring. Discret. Appl. Math. 154 (2) (2006)
Hongmei He, Ondrej Sýkora, Ana Salagean
Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem. Parallel and Distributed Computing and Networks (2006)
Ana Salagean
and over certain Galois rings. Finite Fields Their Appl. 11 (1) (2005)
Ana Salagean
On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two. IEEE Trans. Inf. Theory 51 (3) (2005)
Ana Salagean
On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two. SETA (2004)
Graham H. Norton, Ana Salagean
Strong Gröbner bases and cyclic codes over a finite-chain ring. Electron. Notes Discret. Math. 6 (2001)
Graham H. Norton, Ana Salagean
On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory 46 (3) (2000)
Graham H. Norton, Ana Salagean
On the Structure of Linear and Cyclic Codes over a Finite Chain Ring. Appl. Algebra Eng. Commun. Comput. 10 (6) (2000)
Graham H. Norton, Ana Salagean
On Efficient Decoding of Alternant Codes over a Commutative Ring. IMACC (1999)