Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mariana Durcheva has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Structural Collapse and the Complexity Gap in Semiring-Based Cryptography

    by Mariana Durcheva

    The distinctive algebraic properties of tropical semirings and their connections to computationally difficult problems have made tropical cryptography a subject of growing interest. However, a growing body of cryptanalytic results has shown that many such schemes are vulnerable to efficient attacks. In this paper, we develop a unified mathematical framework for analyzing this phenomenon through the notion of structural collapse. Structural collapse occurs when the reconstruction problem on protocol-generated instances reduces to a problem that is polynomial-time solvable on the resulting instances and whose solutions yield a valid reconstruction of the cryptographic target. We examine recurring structural reduction mechanisms, including linearization, periodicity and monotonicity, optimization and inequality-based reformulations, and residual separability, and distinguish structural reduction from structural collapse. We further formalize the complexity gap between established worst-case hardness of unrestricted algebraic problems and polynomial-time reconstruction on structured protocol-generated families. We show that structural vulnerabilities identified in a broad class of tropical and semiring-based cryptographic protocols are not caused by insufficient algebraic richness, but by structural properties that permit reductions to computationally simpler problems. The framework provides a basis for analyzing the computational structure of semiring-based cryptographic protocols and for identifying structural properties relevant to future protocol design.

  • Open Access

    Structural Collapse and the Complexity Gap in Semiring-Based Cryptography

    by Mariana Durcheva

    The distinctive algebraic properties of tropical semirings and their connections to computationally difficult problems have made tropical cryptography a subject of growing interest. However, a growing body of cryptanalytic results has shown that many such schemes are vulnerable to efficient attacks. In this paper, we develop a unified mathematical framework for analyzing this phenomenon through the notion of structural collapse. Structural collapse occurs when the reconstruction problem on protocol-generated instances reduces to a problem that is polynomial-time solvable on the re-sulting instances and whose solutions yield a valid reconstruction of the cryptographic target. We examine recurring structural reduction mechanisms, including linearization, periodicity and mono-tonicity, optimization and inequality-based reformulations, and residual separability, and distin-guish structural reduction from structural collapse. We further formalize the complexity gap be-tween established worst-case hardness of unrestricted algebraic problems and polynomial-time re-construction on structured protocol-generated families. We show that structural vulnerabilities identified in a broad class of tropical and semiring-based cryptographic protocols are not caused by insufficient algebraic richness, but by structural properties that permit reductions to computationally simpler problems. The framework provides a basis for analyzing the computational structure of semiring-based cryptographic protocols and for identifying structural properties relevant to future protocol design.

  • Open Access

    Supporting the Design of Electronic Circuits by Predicting Links in a Graph Structure

    by Malinka Ivanova, Mariana Durcheva

    Graph structures can be used to represent and explain data about connections and interactions between certain objects that form network systems. Graphs are applied in various scientific areas, and this paper explores their potential to support the design process of electronic circuits. Experimentations for predicting links in a heterogeneous graph structure are performed, which are built on the basis of schematic variants of electronic circuits and their elements. A graph neural network approach and the PyG library are used. The predictive model is evaluated, and the obtained results are promising.

  • Open Access

    Cryptography Based on (Idempotent) Semirings: Abandoning Tropicality?

    by Mariana Durcheva

    This review explores the current state of public key cryptography based on idempotent semirings, with an emphasis on tropical semirings. It examines key hard problems, such as the tropical discrete logarithm problem, semidirect tropical product problem, the factorization of tropical polynomials, and the matrix power function, that underpin the security of these protocols. Given the significant number of compromised protocols based on tropical semirings, most of which are variations of the Stickel protocol, we present three algorithms and classify schemes of this type. The analysis is further illustrated with a figure that maps the relationships between tropical Stickel’s-like protocols and the attacks targeting them. Additionally, the review provides an in-depth exploration of the vulnerabilities that have led to many tropical semiring-based cryptosystems being compromised. To address these challenges, the review highlights promising alternative approaches, including non-tropical idempotent platforms and non-idempotent options, such as supertropical semirings, which offer potential solutions to overcome known limitations. Furthermore, a discussion on the interplay between tropical cryptography and post-quantum cryptography is presented, raising the following question: what is the future of tropical cryptography?


  • Open Access

    Secure Key Exchange in Tropical Cryptography: Leveraging Efficiency with Advanced Block Matrix Protocols

    by Mariana Durcheva, Kiril Danilchenko

    In the quest for robust and efficient digital communication, this paper introduces cutting-edge key exchange protocols leveraging the computational prowess of tropical semirings and the structural resilience of block matrices. Moving away from the conventional use of finite fields, these protocols deliver markedly faster processing speeds and heightened security. We present two implementations of our concept, each utilizing a different platform for the set of commuting matrices: one employing tropical polynomials of matrices and the other employing Linde–de la Puente matrices. The inherent simplicity of tropical semirings leads to a decrease in operational complexity, while using block matrices enhances our protocols’ security profile. The security of these protocols relies on the Matrix Decomposition Problem. In addition, we provide a comparative analysis of our protocols against existing matrix block-based protocols in finite fields. This research marks a significant shift in cryptographic protocol design, is specifically tailored for demanding engineering applications, and sets a new standard in secure and efficient digital communication.


  • Open Access

    Secure Key Exchange in Tropical Cryptography: Leveraging Efficiency with Advanced Block Matrix Protocols

    by Mariana Durcheva, Kiril Danilchenko

    In the quest for robust and efficient digital communication, this paper introduces cutting-edge key exchange protocols leveraging tropical semirings’ computational prowess and block matrices’ structural resilience. Moving away from the conventional use of finite fields, these protocols deliver markedly faster processing speeds and heightened security. We present two implementations of our concept, each utilizing a different platform for the set of commuting matrices: one employing tropical polynomials of matrices and the other employing Linde-de la Puente matrices. The inherent simplicity of tropical semirings leads to a decrease in operational complexity, and using block matrices enhances our protocols’ security profile. The security of these protocols relies on the Matrix Decomposition Problem. We also provide a comparative analysis of our protocols against existing matrix block-based protocols in finite fields. This research marks a significant shift in cryptographic protocol design, specifically tailored for demanding engineering applications, and sets a new standard in secure and efficient digital communication.


  • Open Access

    Comprehensive E-learning of Mathematics using the Halomda Platform enhanced with AI tools

    by Philip Slobodsky, Mariana Durcheva

    Comprehensive E-learning of Mathematics using the Halomda Platform enhanced with AI tools by Philip Slobodsky 1 and Mariana Durcheva 2,3 1 Halomda Educational Software, Rishon LeZion, Israel 2 Sami Shamoon College of Engineering, Mathematics Department, Ashdod, Israel 3 TU-Sofia, Informatics Department, Sofia, Bulgaria * Author to whom correspondence should be addressed. Journal of Engineering Research … Continue reading "Comprehensive E-learning of Mathematics using the Halomda Platform enhanced with AI tools"


  • Trusted e-assessment in high math courses based on the Halomda platform

    by Philip Slobodsky, Mariana Durcheva

    Halomda offers comprehensive e-learning platform for math courses, including a module for trusted e-assessment. Assessment is performed by checking all the step Halomda offers comprehensive e-learning platform for math courses, including a module for trusted e-assessment. Assessment is performed by checking all the step

  • Guided e-Assessment of Math Proofs with the Halomda Platform

    by Philip Slobodsky, Mariana Durcheva

    The mode of assessment is one of the most important factors influencing learning. E-assessment usually includes only checking the final answer, thus limiting teacher's ability to check the complete solution, and it does not allow inclusion of math proofs problems that constitute an important part of math content. The e-assessment module of Halomda elearning platform allows assessment of proof problems from different areas of school and high Math, like algebraic identities and inequalities, geometry proofs, trigonometrical identities, analytic geometry, vector algebra, etc. Although eassessment of a proof of a mathematical statement is generally a difficult task, in this paper we show through some working examples how guided e-assessment can be implemented using the Halomda platform.