ISSN 2738-0971 | eISSN 2738-1013
Bulletin of Natural Sciences Research
Open access journal | Double-blind peer review

Negovan Stamenković

ORCID 0000-0003-4025-5342

Faculty of Sciences and Mathematics, University of Priština in Kosovska Mitrovica, Kosovska Mitrovica, Serbia

Articles

Open Access Original Scientific Paper

AN APPLICATION OF RESIDUE NUMBER SYSTEM ARITHMETICS TO SECURE HASH FUNCTIONS DESIGN

by Milija Pavlović, Stefan Panić, Boris Damjanović, Negovan Stamenković

This paper presents a cryptographic hash function based on the Residue Number System (RNS), designed to enhance security and computational efficiency. The function leverages the parallelism and modular properties of RNS to achieve high-speed processing while maintaining strong diffusion and resistance to various cryptanalytic attacks. Experimental results confirm that the proposed function exhibits a pronounced Avalanche effect, ensuring that minor changes in the input result in significant alterations in the hash output. Additionally, statistical analysis using the ENT test demonstrates a high level of entropy and uniform distribution of hash values, reinforcing the function’s unpredictability—an essential characteristic for cryptographic security. The proposed hash function is suitable for applications in digital signatures, data integrity verification, and authentication systems, offering advantages in environments requiring high computational efficiency.

View Full-Text DOI 10.5937/bnsr15-58114 Published: 11 Jun 2025
Open Access Original Scientific Paper

ISOMORPHIC TRANSFORMATION AND ITS APPLICATION TO THE MODULO (2^n+1) CHANNEL FOR RNS BASED FIR FILTER DESIGN

by Negovan Stamenković

In this paper, the implementation of a Finite Impulse Response (FIR) filter in the Residue Number System (RNS), is presented, in which a modulo multiplier based on the isomorphism technique is used to perform multiplication in the (2n+1) channel. An RNS modular multiplication in the Galois Field GF(2n+1) is presented in detail in this paper. The multiplication is based on the isomorphic mapping technique adapted to the residue arithmetic. The isomorphic encoder and decoder look-up tables in the GF(28+1) are given. An architecture for FIR filter design based on distributed arithmetic for multiplication and accumulation in mentioned (2n+1) channel is also presented. This architecture is discussed in details and compared with with architecture based on isomorphing technique.

View Full-Text DOI 10.5937/univtho9-21821 Published: 25 Aug 2019
Open Access Original Scientific Paper

TRANSITION BETWEEN FLAT MAGNITUDE AND FLAT GROUP DELAY LOW PASS RECURSIVE DIGITAL FILTERS

by Negovan Stamenković, Milan Dejanović

Many a paper has been written on the characteristics of the continuous-time and discrete-time low-pass filters which are designed to have either maximally flat magnitude characteristics or maximally flat group delay responses. The polynomial (all pole) low pass recursive digital filters which are characterised by characterise the transition between a flat magnitude and flat group delay characteristics, named Transitional Butterworth Thiran (TBTh) recursive digital filters, is considered. The characteristics of the resulting filter change gradually from the characteristics of the well known Butterwort’s filter to the characteristics of the Thiran’s filter with the maximally flat group delay characteristic. Poles of the TBTh filter are obtained by interpolating between poles Butterworth and Thiran’s filters by varying a parametar which controls the pole positions that enables a tradeoff between the steepness magnitude characteristic at passband edge and group delay deviation.

View Full-Text DOI 10.5937/univtho9-20907 Published: 14 May 2019