Modeling of the Continuous Absorption of Electromagnetic Radiation in Dense Hydrogen Plasma

In this work is examined a new modeling way of describing the continuous absorption of electromagnetic (EM) radiation in a dense partially ionized hydrogen plasmas with electron densities about $5\cdot10^{18}$ cm$^{-3}$ - $1.5\cdot10^{19}$cm$^{-3}$ and temperatures about $1.6 \cdot10^{4}$ K - $2.5 \cdot 10^{4}$ K in the wavelength region $300 \textrm{nm} < \lambda < 500 \textrm{nm}$. The obtained results can be applied to the plasmas of the partially ionized layers of different stellar atmospheres

Supplementary data for article: Sakan, S.; Dević, G.; Relić, D.; Anđelković, I.; Sakan, N.; Đorđević, D. Risk Assessment of Trace Element Contamination in River Sediments in Serbia Using Pollution Indices and Statistical Methods: A Pilot Study. Environmental Earth Sciences 2015, 73 (10), 6625–6638. https://doi.org/10.1007/s12665-014-3886-1

Supplementary material for: [https://doi.org/10.1007/s12665-014-3886-1]Related to published version: [http://cherry.chem.bg.ac.rs/handle/123456789/1701

Supplementary data for the article: Sakan, S.; Popović, A.; Škrivanj, S.; Sakan, N.; Đorđević, D. Comparison of Single Extraction Procedures and the Application of an Index for the Assessment of Heavy Metal Bioavailability in River Sediments. Environmental Science and Pollution Research 2016, 23 (21), 21485–21500. https://doi.org/10.1007/s11356-016-7341-6

Supplementary material for: [https://doi.org/10.1007/s11356-016-7341-6]Related to published version: [http://cherry.chem.bg.ac.rs/handle/123456789/2347

Evaluation of the strength and performance of a new hashing algorithm based on a block cipher

The article evaluates the reliability of the new HBC-256 hashing algorithm. To study the cryptographic properties, the algorithm was implemented in software using Python and C programming languages. Also, for the algebraic analysis of the HBC-256 algorithm, a system of Boolean equations was built for one round using the Transalg tool. The program code that implements the hashing algorithm was converted into a software program for generating equations. As a result, one round of the compression function was described as conjunctive normal form (CNF) using 82,533 equations and 16,609 variables. To search for a collision, the satisfiability (SAT) problem solver Lingeling was used, including a version with the possibility of parallel computing. It is shown that each new round doubles the number of equations and variables, and the time to find the solution will grow exponentially. Therefore, it is not possible to find solutions for the full HBC256 hash function