8 citations · 9 across the 6 of their papers we have counts for
7 papers
Inconsistency Probability of Sparse Equations over F2
P. Horak, I. Semaev
Let n denote the number of variables and m the number of equations in a sparse polynomial system over the binary field. We study the inconsistency probability of randomly generated…
New Public-Key Crypto-System EHT
Alessandro Budroni, Igor Semaev
In this note, an LWE problem with a hidden trapdoor is introduced. It is used to construct an efficient public-key crypto-system EHT. The new system is significantly different from…
Algorithm for SIS and MultiSIS problems
Igor Semaev
SIS problem has numerous applications in cryptography. Known algorithms for solving that problem are exponential in complexity. A new algorithm is suggested in this note, its compl…
New non-linearity parameters of Boolean functions
Igor Semaev
The study of non-linearity (linearity) of Boolean function was initiated by Rothaus in 1976. The classical non-linearity of a Boolean function is the minimum Hamming distance of it…
A Combinatorial Problem Related to Sparse Systems of Equations
Peter Horak, Igor Semaev, Zsolt Tuza
Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse systems common in cryptanalysis. Given a cipher system, o…
Experimental Study of DIGIPASS GO3 and the Security of Authentication
Igor Semaev
Based on the analysis of -digit one-time passwords(OTP) generated by DIGIPASS GO3 we were able to reconstruct the synchronisation system of the token, the OTP generating algorit…