Ana Salagean

Orcid: 0000-0002-8942-375X

Affiliations:
  • Loughborough University, Department of Computer Science, United Kingdom


According to our database1, Ana Salagean authored at least 37 papers between 1999 and 2024.

Collaborative distances:

Timeline

2000
2005
2010
2015
2020
0
1
2
3
4
1
2
1
1
2
2
2
1
2
1
1
1
2
1
3
1
1
1
1
1
2
1
1
2
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Cubic power functions with optimal second-order differential uniformity.
CoRR, 2024

2023
Probabilistic estimation of the algebraic degree of Boolean functions.
Cryptogr. Commun., December, 2023

Further constructions and characterizations of generalized almost perfect nonlinear functions.
Cryptogr. Commun., December, 2023

Coset Leaders of the First Order Reed-Muller 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
New generalized almost perfect nonlinear functions.
Finite Fields Their Appl., 2021

2020
Counting Boolean functions with faster points.
Des. Codes Cryptogr., 2020

Discrete antiderivatives for functions over $\mathop {{\mathbb {F}}}_p^n$.
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

Big data analysis on secure VoIP services.
Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, 2017

2015
Comparison of cube attacks over different vector spaces.
IACR Cryptol. ePrint Arch., 2015

Various heuristic algorithms to minimise the two-page crossingnumbers of graphs.
Open Comput. Sci., 2015

2013
Computing the linear complexity for sequences with characteristic polynomial f v.
Cryptogr. Commun., 2013

Efficient Generation of Elementary Sequences.
Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013

2012
Index Tables of Finite Fields and Modular Golomb Rulers.
Proceedings of the Sequences and Their Applications - SETA 2012, 2012

2011
Linear complexity for sequences with characteristic polynomial ƒ<sup>v</sup>.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the Stability of m-Sequences.
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

One- and two-page crossing numbers for some types of graphs.
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
An algorithm for computing minimal bidirectional linear recurrence relations.
IEEE Trans. Inf. Theory, 2009

2008
An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Parallelisation of genetic algorithms for the 2-page crossing number problem.
J. Parallel Distributed Comput., 2007

Modified Berlekamp-Massey 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 k-error linear complexity of cryptographic sequences.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

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

Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2006

A Set Theoretic View of the ISA Hierarchy.
Proceedings of the Advances in Applied Artificial Intelligence, 2006

2005
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, 2005

Factoring polynomials over Z<sub>4</sub> and over certain Galois rings.
Finite Fields Their Appl., 2005

2001
Strong Gröbner bases and cyclic codes over a finite-chain ring.
Electron. Notes Discret. Math., 2001

2000
On the Hamming distance of linear codes over a finite chain ring.
IEEE Trans. Inf. Theory, 2000

On the Key Equation Over a Commutative Ring.
Des. Codes Cryptogr., 2000

On the Structure of Linear and Cyclic Codes over a Finite Chain Ring.
Appl. Algebra Eng. Commun. Comput., 2000

1999
On the isometries between Z<sub>p</sub>k and Z<sup>k</sup><sub>p</sub>.
IEEE Trans. Inf. Theory, 1999

On Efficient Decoding of Alternant Codes over a Commutative Ring.
Proceedings of the Cryptography and Coding, 1999


  Loading...