Ana Salagean - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2026

Bounds for the average degree-k monomial density of Boolean functionsAna Salagean, Percy Reyes-Paredes. ccds, 18(1):187-211, January 2026. [doi]

Strengthening the KLEIN CipherVincent Voigtländer, Ana Salagean. cic, 2(4):13, 2026. [doi]

2025

The stability of the algebraic degree of Boolean functions when restricted to affine spacesClaude Carlet, Serge Feukoua, Ana Salagean. dcc, 93(11):4799-4832, November 2025. [doi]

Coset leaders of the first-order Reed-Muller codes in four new classes of Boolean functionsClaude Carlet, Serge Feukoua, Ana Salagean. amco, 19(4):1137-1161, 2025. [doi]

2024

Unveiling the Black Box: Neural Cryptanalysis with XAIYue-Tian Goi, Shu-Min Leong, Raphaël C.-W. Phan, Shangqi Lai, Ana Salagean. SMC 2024: 1951-1956 [doi]

2023

Coset Leaders of the First Order Reed-Muller Codes in the Classes of Niho Functions and Threshold FunctionsClaude Carlet, Serge Feukoua, Ana Salagean. ima 2024: 17-33 [doi]

Probabilistic estimation of the algebraic degree of Boolean functionsAna Salagean, Percy Reyes-Paredes. ccds, 15(6):1199-1215, December 2023. [doi]

Further constructions and characterizations of generalized almost perfect nonlinear functionsAna Salagean, Ferruh Özbudak. ccds, 15(6):1117-1127, December 2023. [doi]

2020

Discrete antiderivatives for functions over $\mathop {{\mathbb {F}}}_p^n$Ana Salagean. dcc, 88(3):471-486, 2020. [doi]

Counting Boolean functions with faster pointsAna Salagean, Ferruh Özbudak. dcc, 88(9):1867-1883, 2020. [doi]

2017

Counting and characterising functions with "fast points" for differential attacksAna Salagean, Matei Mandache-Salagean. ccds, 9(2):217-239, 2017. [doi]

Higher order differentiation over finite fields with applications to generalising the cube attackAna Salagean, Richard Winter, Matei Mandache-Salagean, Raphael C.-W. Phan. dcc, 84(3):425-449, 2017. [doi]

2015

Various heuristic algorithms to minimise the two-page crossingnumbers of graphsHongmei He, Ana Salagean, Erkki Mäkinen, Imrich Vrt'o. cejcs, 5(1), 2015. [doi]

Comparison of cube attacks over different vector spacesRichard Winter, Ana Salagean, Raphael C.-W. Phan. iacr, 2015:894, 2015. [doi]

Comparison of Cube Attacks Over Different Vector SpacesRichard Winter, Ana Salagean, Raphael C.-W. Phan. ima 2015: 225-238 [doi]

2013

Efficient Generation of Elementary SequencesDavid Gardner, Ana Salagean, Raphael C.-W. Phan. ima 2013: 16-27 [doi]

Computing the linear complexity for sequences with characteristic polynomial f vAna Salagean, Alex J. Burrage, Raphael C.-W. Phan. ccds, 5(2):163-177, 2013. [doi]

2012

Index Tables of Finite Fields and Modular Golomb RulersAna Salagean, David Gardner, Raphael Chung-Wei Phan. seta 2012: 136-147 [doi]

2011

vAlex J. Burrage, Ana Salagean, Raphael C.-W. Phan. isit 2011: 688-692 [doi]

On the Stability of m-SequencesAlex J. Burrage, Ana Salagean, Raphael C.-W. Phan. ima 2011: 259-274 [doi]

2010

One- and two-page crossing numbers for some types of graphsHongmei He, Ana Salagean, Erkki Mäkinen. ijcm, 87(8):1667-1679, 2010. [doi]

Apology for citation omission in an algorithm for computing minimal bidirectional linear recurrence relations Ana Salagean. TIT, 56(8):4180, 2010. [doi]

An Improved Approximation Algorithm for Computing the ::::k::::-Error Linear Complexity of Sequences Using the Discrete Fourier TransformAna Salagean, Alexandra Alecu. seta 2010: 151-165 [doi]

2009

An algorithm for computing minimal bidirectional linear recurrence relationsAna Salagean. TIT, 55(10):4695-4700, 2009. [doi]

2008

An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transformAlexandra Alecu, Ana Salagean. isit 2008: 2414-2418 [doi]

An algorithm for computing minimal bidirectional linear recurrence relationsAna Salagean. isit 2008: 1746-1750 [doi]

2007

Modified Berlekamp-Massey Algorithm for Approximating the ::::k:::: -Error Linear Complexity of Binary SequencesAlexandra Alecu, Ana Salagean. ima 2007: 220-232 [doi]

A genetic algorithm for computing the k-error linear complexity of cryptographic sequencesAlexandra Alecu, Ana Salagean. cec 2007: 3569-3576 [doi]

Parallelisation of genetic algorithms for the 2-page crossing number problemHongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen. jpdc, 67(2):229-241, 2007. [doi]

2006

A Set Theoretic View of the ISA HierarchyYee Chung Cheung, Paul Wai Chung, Ana Salagean. ieaaie 2006: 127-136 [doi]

Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing ProblemHongmei He, Ondrej Sýkora, Ana Salagean. pdcn 2006: 316-323

Repeated-root cyclic and negacyclic codes over a finite chain ringAna Salagean. DAM, 154(2):413-419, 2006. [doi]

2005

Factoring polynomials over Z::4:: and over certain Galois ringsAna Salagean. ffa, 11(1):56-70, 2005. [doi]

On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of twoAna Salagean. TIT, 51(3):1145-1150, 2005. [doi]

2004

On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of TwoAna Salagean. seta 2005: 179-184 [doi]

2001

Strong Gröbner bases and cyclic codes over a finite-chain ringGraham H. Norton, Ana Salagean. endm, 6:240-250, 2001. [doi]

2000

On the Structure of Linear and Cyclic Codes over a Finite Chain RingGraham H. Norton, Ana Salagean. aaecc, 10(6):489-506, 2000. [doi]

On the Hamming distance of linear codes over a finite chain ringGraham H. Norton, Ana Salagean. TIT, 46(3):1060-1067, 2000.

1999

On Efficient Decoding of Alternant Codes over a Commutative RingGraham H. Norton, Ana Salagean. ima 1999: 173-178 [doi]

Sign in or sign up to see more results.

runs on WebDSL