Robert Jarusek

Robert Jarusek

Auto-generated profile, based on publicly available information

Robert Jarusek

University of Ostrava, Department of Informatics and Computers, 30. dubna 22, 70103, Ostrava, Czech Republic

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 January 2022 in Neural Networks
Verified
Journal Article
Closed access
RJRobert Jarusek
Robert Jarusek
EVEva Volna
Eva Volna
Martin KotyrbaMartin Kotyrba
Martin Kotyrba

27 August 2021 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ABAdam Barton
Adam Barton
EVEva Volna
Eva Volna
Martin KotyrbaMartin Kotyrba
Martin Kotyrba
RJRobert Jarusek
Robert Jarusek
The study deals with the issue of using spiking neural networks (SNNs) in multiagent systems. The research objective is a proposal of a control algorithm for the cooperation of a group of agents using SNNs, application of the Izhikevich model, and plasticity depending on the timing of action potentials. The proposed method has been verified and experimentally tested, proving numerous advantages over second-generation networks. The advantages and the application in real systems are described in the research conclusions.

24 June 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
RJRobert Jarusek
Robert Jarusek
EVEva Volna
Eva Volna
Martin KotyrbaMartin Kotyrba
Martin Kotyrba
Modern hybrid key establishment combines Diffie–Hellman and Module-LWE assumptions to achieve post-quantum security. We present Grata Cascade, a one-shot key agreement primitive based exclusively on a third, structurally independent assumption: SHA-256 preimage resistance combined with statistical drift of a publicly reconstructable shared state. The protocol converges in a median of approximately 49 rounds, derives a 32-byte shared key, and provides a cumulative preimage barrier of λ = 120 bits per session. Our contributions are threefold. First, we provide a structural security argument based on a generalized birthday asymmetry amplified across rounds. Second, we experimentally evaluate the protocol over 5 × 10⁴ convergence runs, obtaining 100% convergence and 99.992% key agreement, with an upper 95% Clopper–Pearson confidence bound on the failure rate of 2.05 × 10⁻⁴. Randomness evaluation using NIST SP 800-22 passes all 12 tests over 1000 derived keys. We further evaluate five classes of passive adversaries on 300 transcripts each, observing no successful key recoveries. Third, we compare Grata Cascade with established one-shot key agreement mechanisms, including ECDH, ML-KEM, X-Wing hybrid, and Merkle puzzles. The protocol incorporates three complementary structural defenses: a cumulative 120-bit preimage barrier achieved through multiple hash-filtering stages, a large indistinguishable candidate set exceeding the preimage barrier, and oracle-free AES-CBC-based key derivation. Finally, we discuss extending Grata Cascade toward a Continuous Key Agreement (CKA) primitive as an open research direction. The present work establishes Grata Cascade as a candidate for a third, structurally independent layer in hybrid post-quantum key establishment.