Internet of Things connects the physical and cybernetic world. As such, security issues of IoT devices are especially damaging and need to be addressed. In this treatise, we overview current security issues of IoT with the perspective of future threats. We identify three main trends that need to be specifically addressed: security issues of the integration of IoT with cloud and blockchains, the rapid changes in cryptography due to quantum computing, and finally the rise of artificial intelligence and evolution methods in the scope of security of IoT. We give an overview of the identified threats and propose solutions for securing the IoT in the future.
Fialka M-125 (sometimes called the ''Russian Enigma'') is an electro-mechanical rotor cipher machine used during the Cold War. The designers of this cipher eliminated the known weaknesses of Enigma. In this article, the authors summarize the main principle of the Fialka algorithm from public sources. Moreover, they introduce a mathematical model of the Fialka cipher, and they analyse the effect of blocking pin settings on the cipher's period.
ABSTRACT. McEliece cryptosystem (MECS) is one of the oldest public key cryptosystems, and the oldest PKC that is conjectured to be post-quantum secure. In this paper we survey the current state of the implementation issues and security of MECS, and its variants. In the first part we focus on general decoding problem, structural attacks, and the selection of parameters in general. We summarize the details of MECS based on irreducible binary Goppa codes, and review some of the implementation challenges for this system. Furthermore, we survey various proposals that use alternative codes for MECS, and point out some attacks on modified systems. Finally, we review notable existing implementations on low-resource platforms, and conclude with the topic of side channels in the implementations of MECS.
Multiple right-hand side (MRHS) equations over finite fields are a relatively new tool useful for algebraic cryptanalysis. The main advantage is in an efficient representation of the cryptographic primitives. The main methods to solve systems of MRHS equations are gluing, that relies on merging equations, and various versions of local reduction, that relies on removing partial solutions. In this paper we present a new algorithm to solve MRHS systems. The core of the algorithm is a transformation of the problem of solving an MRHS equation system into a problem of group factorization. We then provide two alternative algorithms to solve the transformed problem. One of these algorithms provides a further transformation to the well-studied closest vector problem. A corollary of our research is that the solution of the group factorization problem arising during the process of solving an MRHS equation system must be as difficult as the cryptanalysis of a corresponding block cipher described by this MRHS system.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.