Andrei Tanasescu

Mr. Andrei Tanasescu

University Politehnica of Bucharest
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2019 in Journal of Computational Science
Verified
Journal Article
Closed access
ATAndrei Tanasescu
Andrei Tanasescu
PPPantelimon George Popescu
Pantelimon George Popescu

18 November 2021 in Entropy
Verified
Journal Article
Open access
PDF file
ATAndrei Tanasescu
Andrei Tanasescu
MCMarios O. Choudary
Marios O. Choudary
Olivier RioulOlivier Rioul
Olivier Rioul
GPGeorge Popescu
George Popescu
The bounds presented at CHES 2017 based on Massey’s guessing entropy represent the most scalable side-channel security evaluation method to date. In this paper, we present an improvement of this method, by determining the asymptotically optimal Massey-like inequality and then further refining it for finite support distributions. The impact of these results is highlighted for side-channel attack evaluations, demonstrating the improvements over the CHES 2017 bounds.

1 June 2019 in Physics Letters A
Verified
Journal Article
Closed access
ATAndrei Tanasescu
Andrei Tanasescu
MMMihai-Zicu Mina
Mihai-Zicu Mina
PPPantelimon George Popescu
Pantelimon George Popescu

7 April 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
ATAndrei Tanasescu
Andrei Tanasescu
VIValentina-Florentina Iliescu
Valentina-Florentina Iliescu
GPGeorge Popescu
George Popescu
Entanglement-assisted random access codes (EARACs) compress a large amount of bits, such that any chosen one of them can be recovered with a large probability of success. They have been used for information theoretic treatments of semi-device-independent randomness certification and other communication complexity problems. For high-dimensional problems, the access request distribution can be used to obtain better performance, which until now could only be achieved through numerical methods. This paper makes an analytical account of access request distribution for arbitrary input sizes. We introduce entanglement-assisted almost-random access codes (EAARACs), which maximize the average probability of access under an arbitrary distribution of requests, thus refining EARACs and generalizing the methods used in the study of low-dimensional communication complexity problems. We analytically find the optimal probability of success for EAARACs under arbitrary request distributions and provide an illustrative numerical example.

3 December 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
ATAndrei Tanasescu
Andrei Tanasescu
MCMihai Carabas
Mihai Carabas
Florin POPFlorin POP
Florin POP
GPGeorge Popescu
George Popescu
Singular value decomposition has recently seen a great theoretical improvement for k-tridiagonal matrices, obtaining a considerable speed up over all previous implementations, but at the cost of not ordering the singular values. We provide here a refinement of this method, proving that reordering singular values does not affect performance. We complement our refinement with a scalability study on a real physical cluster setup, offering surprising results. Thus, this method provides a major step up over standard industry implementations.

1 June 2019 in Europhysics Letters
Verified
Journal Article
Closed access
ATAndrei Tanasescu
Andrei Tanasescu
PPPantelimon-George Popescu
Pantelimon-George Popescu