International Scientific Journals
of Scientific Technical Union of Mechanical Engineering "Industry 4.0"

Giving the right access, limiting resources, and recognizing a user’s identity are important steps that need to be taken into consideration before entering a certain network. These steps are executed by authentication and authorization. In this paper, we put our focus on authentication algorithms HOTP and TOTP as two algorithms for generating one-time passwords. A one-time password is an automatically generated string of characters – a password that is meant to be used only once. This password is only valid for one login session or transaction. Due to its randomness and usage (only once), it leads to higher security outputs, and that is why this type of password is used in authentication algorithms. We will analyse both algorithms and their working way and will present the obtained results and their usage in practice. The main characteristic is that the HOTP algorithm uses only hash functions and the TOTP algorithm uses time above the hash. To check when each algorithm is better to use, we need to know the given environment and circumstances. In this paper, we will try to answer the question” Which one is better at a particular time?”. Depending on many factors that we analyse through the sections, we are going to make conclusions that will be useful for future planning of good security passwords.

Error-correcting codes are widely used in modern coding theory, and their applications in networks and communication cannot be omitted. Together with the error detecting codes, they are the core of every possible transmission and communication. In coding theory, information theory and telecommunications, error-correcting codes are used to control errors in data which are transmitted over different communication channels. Convolutional block codes are one of the most popular error-correcting codes which are applied in many networks. On the other side, Random Codes Based on Quasigroups (RCBQ) are cryptcodes defined elsewhere. These codes provide a correction of a certain number of errors in the transmitted data and an information security in one algorithm. There are a few modifications of RCBQ, but here we will consider performances of Cut-Decoding algorithm. In this paper, we investigate and compare the bit error probability (BER) of these two codes for rate 1/4 and different values of bit-error probability in the binary symmetric channel. From the obtained experimental results, we conclude that for lower bit-error probability in the binary symmetric channel, the RCBQs are slightly better than convolutional codes. The advantage of RCBQs is that they have some cryptographic properties, but convolutional codes are faster than RCBQs.