Alexandru Dinu

Dr. Alexandru Dinu


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
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.

12 September 2025 in Cryptography
Verified
Journal Article
Open access
PDF file
ADAlexandru Dinu
Alexandru Dinu
Chaotic systems, governed by deterministic nonlinear equations yet exhibiting highly complex and unpredictable behaviors, have emerged as valuable tools at the intersection of mathematics, engineering, and information security. This paper presents a comparative study of the Lorenz and Rössler systems, focusing on their dynamic complexity and statistical independence—two critical properties for applications in chaos-based cryptography. By integrating techniques from nonlinear dynamics (e.g., Lyapunov exponents, KS entropy, Kaplan–Yorke dimension) and statistical testing (e.g., chi-square and Gaussian transformation-based independence tests), we provide a quantitative framework to evaluate the pseudo-randomness potential of chaotic trajectories. Our results show that the Lorenz system offers faster convergence to chaos and superior statistical independence over time, making it more suitable for rapid encryption schemes. In contrast, the Rössler system provides complementary insights due to its simpler attractor and longer memory. These findings contribute to a multidisciplinary methodology for selecting and optimizing chaotic systems in secure communication and signal processing contexts.

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.).

19 September 2025 in Revista Romaneasca pentru Educatie Multidimensionala
Verified
Journal Article
Open access
PDF file
ADAlexandru Dinu
Alexandru Dinu
In recent years, large language models (LLMs) have gained considerable attention in academic environments, particularly for their potential to support student work. This paper investigates how the use of LLM tools influences graduate engineering students’ performance and perception during project-based learning. The study was conducted over the course of one semester at a Romanian technical university and involved 60 students, divided into two groups: one using AI tools such as ChatGPT and one working with traditional resources only. A mixed-method approach was employed, including pre- and post-project questionnaires and a dual evaluation system involving both human and AI grading, based on a shared rubric. Results show a significant increase in perceived satisfaction and a reduction in the reported difficulty among students who had access to AI tools. Moreover, their average grades were higher and more consistent compared to those in the non-AI group. The study also highlights the alignment between human and AI-based assessment and the growing openness among students toward adopting generative tools in future academic work. These findings suggest that integrating LLMs into higher education may improve learning experiences, but also raise questions about critical thinking, fairness, and ethical use.


16 June 2026 in Entropy
Verified
Journal Article
Open access
PDF file
ADAlexandru Dinu
Alexandru Dinu
Shannon entropy is the most common measure that one could use to check if a data source has random behaviour or not. A value close to the maximum is usually considered as evidence that the source is “random enough”. The present paper shows that this criterion alone is not enough. A deterministic logistic map driven at r=3.9999 reaches 94.97% of the Shannon maximum, yet it is fully predictable once we look at the built-in patterns: its permutation entropy drops to 77.01% of the maximum and its sample entropy falls to 0.67, against 2.33 for a high-quality pseudo-random generator (PRNG). Building on this observation, we combine four entropy measures—Shannon, Rényi, permutation, and sample—into a single diagnostic profile of the analyzed source. In order to validate our approach with practical, real life data, we test it on 2538 official draws of the Romanian Loto 6/49 lottery, recorded between August 1993 and April 2026. The lottery historical data set is very close to a high-quality PRNG (pseudo-random number generator) from the point of view of all four measures. We also observe that the entropy deficit of both the lottery and the PRNG decays as a power law with exponent α≈−0.96; in contrast, the logistic map sits at α≈−0.07. A Random Forest classifier trained only on the entropy profile reaches 78% accuracy on the analyzed four-way classification task (lottery, PRNG, logistic map, biased distribution), but scores 55.7% on the binary lottery-versus-PRNG task, consistent with chance. The method introduced in this study is domain-independent and applies directly to RNG certification, cryptographic key auditing, and any setting where structured pseudo-randomness has to be ruled out.
1