Ana Salagean
Orcid: 000000028942375XAffiliations:
 Loughborough University, Department of Computer Science, United Kingdom
According to our database^{1},
Ana Salagean
authored at least 37 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
2023
Cryptogr. Commun., December, 2023
Further constructions and characterizations of generalized almost perfect nonlinear functions.
Cryptogr. Commun., December, 2023
Coset Leaders of the First Order ReedMuller Codes in the Classes of Niho Functions and Threshold Functions.
Proceedings of the Cryptography and Coding  19th IMA International Conference, 2023
2022
Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions.
Cryptogr. Commun., 2022
2021
Finite Fields Their Appl., 2021
2020
Des. Codes Cryptogr., 2020
Des. Codes Cryptogr., 2020
2017
Higher order differentiation over finite fields with applications to generalising the cube attack.
Des. Codes Cryptogr., 2017
Counting and characterising functions with "fast points" for differential attacks.
Cryptogr. Commun., 2017
Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, 2017
2015
IACR Cryptol. ePrint Arch., 2015
Open Comput. Sci., 2015
2013
Cryptogr. Commun., 2013
Proceedings of the Cryptography and Coding  14th IMA International Conference, 2013
2012
Proceedings of the Sequences and Their Applications  SETA 2012, 2012
2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
Proceedings of the Cryptography and Coding  13th IMA International Conference, 2011
2010
Apology for citation omission in "an algorithm for computing minimal bidirectional linear recurrence relations".
IEEE Trans. Inf. Theory, 2010
Int. J. Comput. Math., 2010
An Improved Approximation Algorithm for Computing the <i>k</i>Error Linear Complexity of Sequences Using the Discrete Fourier Transform.
Proceedings of the Sequences and Their Applications  SETA 2010, 2010
2009
IEEE Trans. Inf. Theory, 2009
2008
An approximation algorithm for computing the kerror linear complexity of sequences using the discrete fourier transform.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
2007
J. Parallel Distributed Comput., 2007
Modified BerlekampMassey Algorithm for Approximating the <i>k</i> Error Linear Complexity of Binary Sequences.
Proceedings of the Cryptography and Coding, 2007
A genetic algorithm for computing the kerror linear complexity of cryptographic sequences.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007
2006
Discret. Appl. Math., 2006
Various Islandbased Parallel Genetic Algorithms for the 2Page Drawing Problem.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2006
Proceedings of the Advances in Applied Artificial Intelligence, 2006
2005
On the computation of the linear complexity and the kerror linear complexity of binary sequences with period a power of two.
IEEE Trans. Inf. Theory, 2005
Finite Fields Their Appl., 2005
2001
Electron. Notes Discret. Math., 2001
2000
IEEE Trans. Inf. Theory, 2000
On the Key Equation Over a Commutative Ring.
Des. Codes Cryptogr., 2000
Appl. Algebra Eng. Commun. Comput., 2000
1999
IEEE Trans. Inf. Theory, 1999
Proceedings of the Cryptography and Coding, 1999