On Efficient Decoding of Alternant Codes over a Commutative Ring. - Graham H. Norton; Ana Salagean (IMACC, 1999)

On the isometries between Zpk and Zkp. - Ana Salagean-Mandache (IEEE Trans. Inf. Theory, 1999)

On the Structure of Linear and Cyclic Codes over a Finite Chain Ring. - Graham H. Norton; Ana Salagean (Appl. Algebra Eng. Commun. Comput., 2000)

On the Key Equation Over a Commutative Ring. - Graham H. Norton; Ana Salagean-Mandache (Des. Codes Cryptogr., 2000)

On the Hamming distance of linear codes over a finite chain ring. - Graham H. Norton; Ana Salagean (IEEE Trans. Inf. Theory, 2000)

Strong Gröbner bases and cyclic codes over a finite-chain ring. - Graham H. Norton; Ana Salagean (Electron. Notes Discret. Math., 2001)

Factoring polynomials over Z4 and over certain Galois rings. - Ana Salagean (Finite Fields Their Appl., 2005)

On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two. - Ana Salagean (IEEE Trans. Inf. Theory, 2005)

A Set Theoretic View of the ISA Hierarchy. - Yee Chung Cheung; Paul Wai Hing Chung; Ana Salagean (IEA/AIE, 2006)

Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem. - Hongmei He; Ondrej Sýkora; Ana Salagean (Parallel and Distributed Computing and Networks, 2006)

Repeated-root cyclic and negacyclic codes over a finite chain ring. - Ana Salagean (Discret. Appl. Math., 2006)

A genetic algorithm for computing the k-error linear complexity of cryptographic sequences. - Alexandra Alecu; Ana Salagean (IEEE Congress on Evolutionary Computation, 2007)

Modified Berlekamp-Massey Algorithm for Approximating the k -Error Linear Complexity of Binary Sequences. - Alexandra Alecu; Ana Salagean (IMACC, 2007)

Parallelisation of genetic algorithms for the 2-page crossing number problem. - Hongmei He; Ondrej Sýkora; Ana Salagean; Erkki Mäkinen (J. Parallel Distributed Comput., 2007)

An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform. - Alexandra Alecu; Ana Salagean (ISIT, 2008)

An algorithm for computing minimal bidirectional linear recurrence relations. - Ana Salagean (IEEE Trans. Inf. Theory, 2009)

An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform. - Ana Salagean; Alexandra Alecu (SETA, 2010)

One- and two-page crossing numbers for some types of graphs. - Hongmei He; Ana Salagean; Erkki Mäkinen (Int. J. Comput. Math., 2010)

Apology for citation omission in "an algorithm for computing minimal bidirectional linear recurrence relations". - Ana Salagean (IEEE Trans. Inf. Theory, 2010)

On the Stability of m-Sequences. - Alex J. Burrage; Ana Salagean; Raphael C.-W. Phan (IMACC, 2011)

Linear complexity for sequences with characteristic polynomial ƒv. - Alex J. Burrage; Ana Salagean; Raphael C.-W. Phan (ISIT, 2011)

Index Tables of Finite Fields and Modular Golomb Rulers. - Ana Salagean; David Gardner; Raphael Chung-Wei Phan (SETA, 2012)

Efficient Generation of Elementary Sequences. - David Gardner; Ana Salagean; Raphael C.-W. Phan (IMACC, 2013)

Computing the linear complexity for sequences with characteristic polynomial f v. - Ana Salagean; Alex J. Burrage; Raphael C.-W. Phan (Cryptogr. Commun., 2013)

Various heuristic algorithms to minimise the two-page crossingnumbers of graphs. - Hongmei He; Ana Salagean; Erkki Mäkinen; Imrich Vrt'o (Open Comput. Sci., 2015)

Comparison of cube attacks over different vector spaces. - Richard Winter; Ana Salagean; Raphael C.-W. Phan (IACR Cryptol. ePrint Arch., 2015)

Big data analysis on secure VoIP services. - Amna Saad; Ahmad Roshidi Amran; Iain William Phillips; Ana M. Salagean (IMCOM, 2017)

Counting and characterising functions with "fast points" for differential attacks. - Ana Salagean; Matei Mandache-Salagean (Cryptogr. Commun., 2017)

Higher order differentiation over finite fields with applications to generalising the cube attack. - Ana Salagean; Richard Winter; Matei Mandache-Salagean; Raphael C.-W. Phan (Des. Codes Cryptogr., 2017)

Discrete antiderivatives for functions over $ mathop {{ mathbb {F}}}_p^n$. - Ana Salagean (Des. Codes Cryptogr., 2020)

Counting Boolean functions with faster points. - Ana Salagean; Ferruh Özbudak (Des. Codes Cryptogr., 2020)

New generalized almost perfect nonlinear functions. - Ferruh Özbudak; Ana Salagean (Finite Fields Their Appl., 2021)

Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions. - Ana Salagean; Pantelimon Stanica (Cryptogr. Commun., 2022)

Coset Leaders of the First Order Reed-Muller Codes in the Classes of Niho Functions and Threshold Functions. - Claude Carlet; Serge Feukoua; Ana Salagean (IMACC, 2023)

Further constructions and characterizations of generalized almost perfect nonlinear functions. - Ana Salagean; Ferruh Özbudak (Cryptogr. Commun., 2023)

Probabilistic estimation of the algebraic degree of Boolean functions. - Ana Salagean; Percy Reyes-Paredes (Cryptogr. Commun., 2023)

Unveiling the Black Box: Neural Cryptanalysis with XAI. - Yue-Tian Goi; Shu-Min Leong; Raphaël C.-W. Phan; Shangqi Lai; Ana Salagean (SMC, 2024)

Cubic power functions with optimal second-order differential uniformity. - Connor O'Reilly; Ana Salagean (CoRR, 2024)

Coset leaders of the first-order Reed-Muller codes in four new classes of Boolean functions. - Claude Carlet; Serge Feukoua; Ana Salagean (Adv. Math. Commun., 2025)

On the algebraic degree stability of vectorial Boolean functions when restricted to affine subspaces. - Claude Carlet; Serge Feukoua; Ana Salagean (CoRR, 2025)