Madalin Frunzete

Dr. Madalin Frunzete

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
9 February 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
APAdrian Petcu
Adrian Petcu
BPBogdan Pahontu
Bogdan Pahontu
MFMadalin Frunzete
Madalin Frunzete
DSDan Alexandru Stoichescu
Dan Alexandru Stoichescu
Over the past decade, there has been significant evolution in the security field, specifically in the authentication and authorization part. The standard authentication protocol nowadays is OAuth 2.0-based authentication. This method relies on a third-party authentication service provider with complete control over the users’ data, which it can filter or modify at will. Blockchain and decentralization have generated much interest in recent years, and the decentralized web is considered the next significant improvement in the world wide web (also known as Web 3.0). Web3 authentication, also known as decentralized authentication, allows for the secure and decentralized authentication of users on the web. The use cases for this technology include online marketplaces, social media platforms, and other online communities that require user authentication. The advantages of Web3 authentication include increased security and privacy for users and the ability for users to have more control over their data. The proposed system implementation uses Ethereum as the blockchain and a modern web stack to enhance user interaction and usability. The solution brings benefits both to the private and the public sector, proving that it has the capability of becoming the preferred authentication mechanism for any decentralized web application.

13 August 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
ADAlexandru Dinu
Alexandru Dinu
MFMadalin Frunzete
Madalin Frunzete
Image encryption plays a critical role in ensuring the confidentiality and integrity of visual information, particularly in applications involving secure transmission and storage. While traditional cryptographic algorithms like AES are widely used, they may not fully exploit the properties of image data, such as high redundancy and spatial correlation. In recent years, chaotic systems have emerged as promising candidates for lightweight and secure encryption schemes, but comprehensive comparisons between different chaotic maps and standardized methods are still lacking. This study investigates the use of three classical chaotic systems—Henon, tent, and logistic maps—for image encryption, and evaluates their performance both visually and statistically. The research is motivated by the need to assess whether these well-known chaotic systems, when used with proper statistical sampling, can match or surpass conventional methods in terms of encryption robustness and complexity. We propose a key generation method based on chaotic iterations, statistically filtered for independence, and apply it to a one-time-pad-like encryption scheme. The encryption quality is validated over a dataset of 100 JPEG images of size 512×512, using multiple evaluation metrics, including MSE, PSNR, NPCR, EQ, and UACI. Results are benchmarked against the AES algorithm to ensure interpretability and reproducibility. Our findings reveal that while the AES algorithm remains the fastest and most uniform in histogram flattening, certain chaotic systems, such as the tent and logistic maps, offer comparable or superior results in visual encryption quality and pixel-level unpredictability. The analysis highlights that visual encryption performance does not always align with statistical metrics, underlining the importance of multi-faceted evaluation. These results contribute to the growing body of research in chaos-based image encryption and provide practical guidelines for selecting encryption schemes tailored to specific application requirements, such as efficiency, visual secrecy, or implementation simplicity.

14 August 2012 in Physical Review E
Verified
Journal Article
Closed access
MFMadalin Frunzete
Madalin Frunzete
JBJean-Pierre Barbot
Jean-Pierre Barbot
CLChristophe Letellier
Christophe Letellier
It is known that the reconstructed phase portrait of a given system strongly depends on the choice of the observable. In particular, the ability to obtain a global model from a time series strongly depends on the observability provided by the measured variable. Such a dependency results from (i) the existence of a singular observability manifold, Msobs, for which the coordinate transformation between Rm and the reconstructed space is not defined and (ii) how often the trajectory visits the neighborhood UMsobs of Msobs. In order to clarify how these aspects contribute to the observability coefficients, we introduce the probability of visits of Msobs and the relative time spent in UMsobs to construct a new coefficient. Combined with the symbolic observability coefficients previously introduced [Letellier and Aguirre, Phys. Rev. E 79, 066210 (2009)] (only taking into account the existence of Msobs), this new coefficient helps to determine the specific role played by the location of Msobs with respect to the attractor, in phase portrait reconstruction and in any analysis technique. DOI: http://dx.doi.org/10.1103/PhysRevE.86.026205 ©2012 American Physical Society

6 January 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
ADAlexandru Dinu
Alexandru Dinu
MFMadalin Frunzete
Madalin Frunzete
Pseudorandom number generators (PRNGs) have always been a central research topic in data science, and chaotic dynamical systems are one of the means to obtain scientifically proven data. Chaotic dynamical systems have the property that they have a seemingly unpredictable and random behavior obtained by making use of deterministic laws. The current paper will show how several notions used in the study of chaotic systems—statistical independence, singularity, and observability—can be used together as a suite of test methods for chaotic systems with high potential of being used in the PRNG or cryptography fields. In order to address these topics, we relied on the adaptation of the observability coefficient used in previous papers of the authors, we calculated the singularity areas for the chaotic systems considered, and we evaluated the selected chaotic maps from a statistical independence point of view. By making use of the three notions above, we managed to find strong correlations between the methods proposed, thus supporting the idea that the resulting test procedure is consistent. Future research directions consist of applying the proposed test procedure to other chaotic systems in order to gather more data and formalize the approach in a test suite that can be used by the data scientist when selecting the best chaotic system for a specific use (PRNG, cryptography, etc.).

12 November 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
MFMadalin Frunzete
Madalin Frunzete
Dynamical systems are used in various applications, and their simulation is related with the type of mathematical operations used in their construction. The quality of the system is evaluated in terms of reconstructing the system, starting from its final point to the beginning (initial conditions). Deciphering a message has to be without loss, and this paper will serve to choose the proper dynamical system to be used in chaos-based cryptography. The characterization of the chaotic attractors is the most important information in order to obtain the desired behavior. Here, observability and singularity are the main notions to be used for introducing an original term: quality observability index (q.o.i.). This is an original contribution for measuring the quality of the chaotic attractors. In this paper, the q.o.i. is defined and computed in order to confirm its usability.

19 June 2015
Verified
Book Chapter
Closed access
PDF file
MFMadalin Frunzete
Madalin Frunzete
APAnca Andreea Popescu
Anca Andreea Popescu
JBJean-Pierre Barbot
Jean-Pierre Barbot