default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAna Salagean
2020 – today
- 2024
[c17]Yue-Tian Goi, Shu-Min Leong, Raphaël C.-W. Phan, Shangqi Lai, Ana Salagean:
Unveiling the Black Box: Neural Cryptanalysis with XAI. SMC 2024: 1951-1956- [i4]Connor O'Reilly, Ana Salagean:
Cubic power functions with optimal second-order differential uniformity. CoRR abs/2409.03467 (2024) - 2023
- [j22]Ana Salagean, Ferruh Özbudak:
Further constructions and characterizations of generalized almost perfect nonlinear functions. Cryptogr. Commun. 15(6): 1117-1127 (2023) - [j21]Ana Salagean, Percy Reyes-Paredes:
Probabilistic estimation of the algebraic degree of Boolean functions. Cryptogr. Commun. 15(6): 1199-1215 (2023) - [c16]Claude Carlet, Serge Feukoua, Ana Salagean:
Coset Leaders of the First Order Reed-Muller Codes in the Classes of Niho Functions and Threshold Functions. IMACC 2023: 17-33 - [i3]Ana Salagean, Percy Reyes-Paredes:
Probabilistic estimation of the algebraic degree of Boolean functions. CoRR abs/2306.12196 (2023) - 2022
- [j20]Ana Salagean
, Pantelimon Stanica:
Improving bounds on probabilistic affine tests to estimate the nonlinearity of Boolean functions. Cryptogr. Commun. 14(2): 459-481 (2022) - 2021
- [j19]Ferruh Özbudak, Ana Salagean:
New generalized almost perfect nonlinear functions. Finite Fields Their Appl. 70: 101796 (2021) - 2020
- [j18]Ana Salagean:
Discrete antiderivatives for functions over $\mathop {{\mathbb {F}}}_p^n$. Des. Codes Cryptogr. 88(3): 471-486 (2020) - [j17]Ana Salagean, Ferruh Özbudak:
Counting Boolean functions with faster points. Des. Codes Cryptogr. 88(9): 1867-1883 (2020)
2010 – 2019
- 2017
- [j16]Ana Salagean, Matei Mandache-Salagean:
Counting and characterising functions with "fast points" for differential attacks. Cryptogr. Commun. 9(2): 217-239 (2017) - [j15]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): 425-449 (2017) - [c15]Amna Saad, Ahmad Roshidi Amran, Iain William Phillips, Ana M. Salagean:
Big data analysis on secure VoIP services. IMCOM 2017: 5 - 2015
- [j14]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) - [c14]Richard Winter, Ana Salagean, Raphael C.-W. Phan:
Comparison of Cube Attacks Over Different Vector Spaces. IMACC 2015: 225-238 - [i2]Richard Winter, Ana Salagean, Raphael C.-W. Phan:
Comparison of cube attacks over different vector spaces. IACR Cryptol. ePrint Arch. 2015: 894 (2015) - 2014
- [i1]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 abs/1410.4095 (2014) - 2013
- [j13]Ana Salagean, Alex J. Burrage, Raphael C.-W. Phan:
Computing the linear complexity for sequences with characteristic polynomial f v. Cryptogr. Commun. 5(2): 163-177 (2013) - [c13]David Gardner, Ana Salagean, Raphael C.-W. Phan:
Efficient Generation of Elementary Sequences. IMACC 2013: 16-27 - 2012
- [c12]Ana Salagean, David Gardner, Raphael Chung-Wei Phan:
Index Tables of Finite Fields and Modular Golomb Rulers. SETA 2012: 136-147 - 2011
- [c11]Alex J. Burrage, Ana Salagean, Raphael C.-W. Phan:
On the Stability of m-Sequences. IMACC 2011: 259-274 - [c10]Alex J. Burrage, Ana Salagean, Raphael C.-W. Phan:
Linear complexity for sequences with characteristic polynomial ƒv. ISIT 2011: 688-692 - 2010
- [j12]Hongmei He, Ana Salagean, Erkki Mäkinen:
One- and two-page crossing numbers for some types of graphs. Int. J. Comput. Math. 87(8): 1667-1679 (2010) - [j11]Ana Salagean:
Apology for citation omission in "an algorithm for computing minimal bidirectional linear recurrence relations". IEEE Trans. Inf. Theory 56(8): 4180 (2010) - [c9]Ana Salagean, Alexandra Alecu:
An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform. SETA 2010: 151-165
2000 – 2009
- 2009
- [j10]Ana Salagean:
An algorithm for computing minimal bidirectional linear recurrence relations. IEEE Trans. Inf. Theory 55(10): 4695-4700 (2009) - 2008
- [c8]Ana Salagean:
An algorithm for computing minimal bidirectional linear recurrence relations. ISIT 2008: 1746-1750 - [c7]Alexandra Alecu, Ana Salagean:
An approximation algorithm for computing the k-error linear complexity of sequences using the discrete fourier transform. ISIT 2008: 2414-2418 - 2007
- [j9]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): 229-241 (2007) - [c6]Alexandra Alecu, Ana Salagean:
A genetic algorithm for computing the k-error linear complexity of cryptographic sequences. IEEE Congress on Evolutionary Computation 2007: 3569-3576 - [c5]Alexandra Alecu, Ana Salagean:
Modified Berlekamp-Massey Algorithm for Approximating the k -Error Linear Complexity of Binary Sequences. IMACC 2007: 220-232 - 2006
- [j8]Ana Salagean:
Repeated-root cyclic and negacyclic codes over a finite chain ring. Discret. Appl. Math. 154(2): 413-419 (2006) - [c4]Yee Chung Cheung, Paul Wai Hing Chung, Ana Salagean:
A Set Theoretic View of the ISA Hierarchy. IEA/AIE 2006: 127-136 - [c3]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: 316-323 - 2005
- [j7]Ana Salagean:
Factoring polynomials over Z4 and over certain Galois rings. Finite Fields Their Appl. 11(1): 56-70 (2005) - [j6]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): 1145-1150 (2005) - 2004
- [c2]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: 179-184 - 2001
- [j5]Graham H. Norton, Ana Salagean:
Strong Gröbner bases and cyclic codes over a finite-chain ring. Electron. Notes Discret. Math. 6: 240-250 (2001) - 2000
- [j4]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): 489-506 (2000) - [j3]Graham H. Norton, Ana Salagean-Mandache:
On the Key Equation Over a Commutative Ring. Des. Codes Cryptogr. 20(2): 125-141 (2000) - [j2]Graham H. Norton, Ana Salagean:
On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory 46(3): 1060-1067 (2000)
1990 – 1999
- 1999
- [j1]Ana Salagean-Mandache:
On the isometries between Zpk and Zkp. IEEE Trans. Inf. Theory 45(6): 2146-2148 (1999) - [c1]Graham H. Norton, Ana Salagean:
On Efficient Decoding of Alternant Codes over a Commutative Ring. IMACC 1999: 173-178
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-21 19:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
