Nevena Mijajlovic

Dr. Nevena Mijajlovic

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
1 November 2020 in Future Generation Computer Systems
Verified
Journal Article
Closed access
ACAladin Crnkić
Aladin Crnkić
IIIgor Ivanović
Igor Ivanović
VJVladimir Jaćimović
Vladimir Jaćimović
NMNevena Mijajlovic
Nevena Mijajlovic




1 April 2024 in Computational Mathematics and Mathematical Physics
Verified
Journal Article
Closed access
PDF file
NMNevena Mijajlovic
Nevena Mijajlovic
MJMilojica Jaćimović
Milojica Jaćimović
The objective of this manuscript is to study the convergence of three-step approximation methods for quasi-variational inequalities in the general case. First, we propose the three-step dynamical system and carry out an asymptotic analysis for the generated trajectories. The explicit time discretization of this system results into a three-step iterative method, which we prove to converge also when it is applied to strongly-monotone quasi-variational inequalities. In addition, we show that linear convergence is guaranteed under strong-monotonicity.

16 June 2025 in IEEE Access
Verified
Journal Article
Open access
MMMiodrag J. Mihaljevic
Miodrag J. Mihaljevic
ARAleksandar Radonjic
Aleksandar Radonjic
NMNevena Mijajlovic
Nevena Mijajlovic
LWLianhai Wang
Lianhai Wang
SXShujiang Xu
Shujiang Xu
This paper presents a new class of erasure-correcting codes (ECCs) aimed at enhancing cryptographic security of certain encryption schemes. The proposed ECCs employ integer arithmetic to encode and decode data bits and can correct all data bytes, each affected by exactly two erasures.. In the enhanced encryption scheme, the ciphertext produced by the initial encryption undergoes further processing. The enhancement leverages specific fragmentation, the proposed ECCs and a simulated noisy channel. For legitimate users, the simulated noisy channel functions as a binary erasure channel, while for an attacker without the secret key, it acts as a channel with random deletions. Security notation and evaluation follow the traditional approach, assessing the attacker’s advantage in distinguishing between two ciphertexts versus random guessing. This evaluation employs dedicated analysis based on information-theoretic findings on the capacity of certain deletion channels and is supported by illustrative numerical examples.