AN IMPROVED DESIGN OF SUBSTITUTION BOX BASED ON CHAOS AND AN ALGEBRAIC FUNCTION

Resource-constrained Internet of Things (IoT) edge devices demand lightweight, energy efficient, and secure cipher designs with CMOS technology scaling to enhance hardware security. This work proposes and demonstrates for the first time the potential and challenges of using NCFETs for energy efficient and secure S-box design used in lightweight ciphers exploring the Feistel network structure at VDD = 0.5 V. Performance benchmarking is performed for the proposed NCFET-based S-box design of a Feistel network SLIM cipher with a baseline CMOS SLIM cipher and other existing NCFET PRESENT Cipher with Substitution and Permutation (SPN) networks. The proposed NCFET S-box design exploits the unique steep slope device characteristics and increases non-linearity in power traces caused by the extra gate capacitance of the NCFETs along with the highly secure Feistel network structure to enhance overall energy efficiency and DPA attack resiliency. A thorough DPA resiliency analysis of the proposed S-box design with performance metrics such as SNR, MTD, and SPD performance comparison with the baseline CMOS design and other state-of-the-art S-box designs has been performed. Performance benchmarking of the proposed S-box design of an ultra-lightweight NCFET-based SLIM cipher design with an equivalent baseline CMOS design shows ~4.25× lower energy consumption, a 16× increase in the attacker effect ratio, a ~3.7× reduction in signal-to-noise ratio (SNR) values, a 16× increase in the minimum traces to disclosure (MTD) value, and a ~13.4× higher security power delay (SPD) value at VDD = 0.5 V.

Substitution boxes (S-boxes) are important components in many modern-day symmetric key ciphers. Their study has attracted a great deal of attention over many years. The emergence of a variety of cryptosystem attacks has shown that substitutions must be designed with great care. Some general criteria such as high non-linearity and low autocorrelation have been proposed (providing some protection against attacks such as linear cryptanalysis and differential cryptanalysis). The design of appropriate S-boxes is a difficult task: several criteria must be traded off and the design space is huge. There has been little application of evolutionary search to the development of S-boxes. In this paper we show how a cost function that has found excellent single-output Boolean functions can be generalised to provide improved results for small S-boxes.

Efficient hardware mapping of Boolean substitution boxes based on functional decomposition for RFID and ISM band IoT applications

The use of S-boxes (substitution boxes) to provide nonlinear properties is known to be a common way to design a block cipher. These nonlinear properties are necessary to ensure the security of a block cipher. This manuscript proposes a design construction of a new S-box using affine transformation via cellular automata as a permutation matrix. We incorporate this cellular-automaton permutation matrix into the AES S box structure and test various irreducible polynomials. Nonlinearity, bijection, bit independence criterion, strict avalanche effect, linear approximation probability, and differential uniformity are the standard performance requirements used to evaluate the S-boxes that arise. Using this method, we are able to determine an irreducible polynomial that enables the construction of a new S-box design that can achieve an ideal strict avalanche criterion (SAC), which will subsequently provide efficiency in the design of block ciphers.

A Blockchain is essentially a distributed database of records, or public ledger, of all completed and shared transactions or digital events. Each transaction in the public ledger is validated by a majority of the system's members. Information can never be deleted after it has been submitted. The Blockchain includes a precise and verifiable record of every single transaction that has ever occurred. The most well-known application of Blockchain technology is Bitcoin, a decentralized peer-to-peer digital money. Although the digital currency bit coin is very contentious, the underlying Blockchain technology has performed perfectly and has found a wide range of uses in both the financial and non- financial worlds. The basic idea is that the Blockchain creates a means for achieving distributed consensus in the digital online world. By producing an unquestionable record in a public ledger, involved entities may be assured that a digital event occurred. It paves the way for the transition from a centralized to a democratic, open, and scalable digital economy. This innovative technology offers huge possibilities, and the change in this field has just begun. This research paper describes Blockchain technology supports crypto currency and some specific applications in both the financial and non- financial sector and also this research paper will examine the difficulties that lie ahead and the business opportunities for this fundamental technology that is going to transform our digital world. Keywords: Blockchain, Bitcoin, Financial and non-financial sector, Technology

The rapid advancement of technology has ushered in an era where devices are becoming increasingly autonomous and intelligent, thanks to the integration of the Internet of Things (IoT). This research paper aims to comprehensively explore the various facets of autonomous and intelligent functioning in devices, facilitated by the seamless incorporation of IoT technologies. A series of case studies will be presented to showcase real-world applications and implementations of autonomous and intelligent devices powered by IoT. These case studies will offer insights into successful deployments, challenges faced, and lessons learned. The research paper summarizes key findings, highlighting the significance of the study, and proposing avenues for further research and innovation in the realm of autonomous and intelligent devices powered by IoT. This research paper aims to contribute valuable insights to the growing body of knowledge surrounding the integration of IoT technologies in achieving autonomous and intelligent device functionality.

Side-channel cube attack (SCCA) is a powerful cryptanalysis technique that combines side-channel and cube attacks. This paper leverages black-box SCCA(BB-SCCA) on lightweight block ciphers. Firstly, the framework and the evaluation metrics of BB-SCCA is presented. Then, under Hamming weight leakage model, we apply BB-SCCA to PRESENT and its derivatives such as Small Present-[n] and EPCBC, the analysis of the results is provided. Finally, we present some advices for BB-SCCA resistent cipher design. Both the results and the analysis show that PRESENT-like ciphers have their intrinsic defects in the design of S-Box and the permutation layer. If the Hamming weight of certain bits(i.e., a nibble or a byte) is leaked in the third round after the addRoundKey operation, the first round key for PRESENT-like ciphers can be extracted easily with less than 210 chosen plaintexts.

In the digital world, the research papers are growing exponentially with time, and it is essential to cluster the documents under their respective categories for easier identification and access. However, researchers find it relatively challenging to recognize and categorize their favorite research articles. Though this task can be achieved by putting in the human work, it would be tedious and exhaustively time-consuming. Henceforth, much research has been done in the field of topic modelling to yield accurate results with a good computation time. The main objective of this paper is to compare the two distinct yet vastly used topic modelling approaches for research paper classification, which can further group the research papers into their respective classes. The two chosen topic modeling methodologies are Non-Negative Matrix Factorization (NMF) and Latent Dirichlet allocation (LDA). This paper introduces a comparison between LDA model's performance with a relatively efficient generative model (NMF) and analyzes its performance on the dataset that consists of 1740 papers extracted from the NYC university website. In comparison, the average coherence score for the LDA method was 0.5282, with its optimal choice of topics being 22, which was slightly higher than the NMF model as it yielded a coherence score of 0.4937 with its optimal topics being 9. To enhance the categorization of LDA, clustering the optimal topics of LDA from 22 to 10 using pyLDAvis has been done. On closely comparing both the models, LDA performs slightly better than NMF with a higher confidence score.

Business process management (BPM) is an accepted paradigm of organizational design to orchestrate distributed work involving various activities, resources, and actors, connecting the physical and digital world. While traditional research in BPM focused on process models and model-based information systems (e.g., workflow management systems), the focus has recently shifted toward data-driven methods such as process mining. Process mining strives to discover, monitor, and improve business processes by extracting knowledge from process (or event) logs. As process mining has evolved into one of the most active streams in BPM, numerous approaches have been proposed in the last decade, and various commercial vendors transferred these methods into practice, substantially facilitating event data analysis. However, there are still manifold unsolved challenges that hinder the adoption and usage of process mining at the enterprise level. First, finding, extracting, and preprocessing relevant event data remains challenging. Second, most process mining approaches operate on a single-process level, making it hard to apply process mining multiple interconnected processes. Third, process managers strongly require forward-directed operational support, but most process mining approaches provide only descriptive ex-post insights. Driven by these challenges, this thesis contributes to the existing body of knowledge related to data-driven management of interconnected business processes. By proposing methods that enhance and automate the extraction of event logs from typical sources (research paper1) and exploiting novel sources containing process-relevant information (research papers #2 and #3), this thesis contributes to the first challenge of finding, extracting, and preprocessing relevant event data. Regarding the second challenge to apply process mining to a multi-process perspective, this thesis proposes approaches for log-driven prioritization of interconnected business processes (research papers #4 and #5). As the proposed process prioritization methods build on predicting processes’ future performance, they also contribute to the third challenge of providing forward-directed operational support for process managers. Providing accurate predictions leveraging the increasing volume of available data is key to develop predictive and prescriptive process mining approaches. Consequently, the thesis also elaborates on how predictive process monitoring can benefit from the promising trend of deep learning (research paper #6).%%%%Geschaftsprozessmanagement (BPM) ist ein akzeptiertes Paradigma der Organisationsgestaltung zur Orchestrierung verteilter Arbeit, die verschiedene Aktivitaten, Ressourcen und Akteure umfasst und somit die physische mit der digitalen Welt verbindet. Wahrend das wissenschaftliche Hauptinteresse im Bereich BPM fur eine lange Zeit auf Prozessmodellen und modellbasierten Informationssystemen (z.B. Workflow-Management-Systeme) lag, hat sich der Fokus in letzter Zeit zunehmend auf datengestutzte Methoden, wie z.B. das…

The Generalized XOR Lemma

Negative capacitance FET based energy efficient and DPA attack resilient ultra-light weight block cipher design

The substitution box (S-box) is found in many block cipher, and it is a very important component. Since the chaotic system has several significant advantageous properties desirable for cryptosystem, the design of S-box using chaos has attracted a great deal of attention in recent years. In this paper, a novel method for designing key-dependent S-boxes based on a four-dimensional hyperchaotic Chen system has been presented. The design process for constructing S-boxes is described in detail and the results of numerical analysis indicate that all the criteria for S-boxes including bijection, nonlinearity, SAC, BIC and differential approximation probability can be fulfilled. Furthermore, the S-box’s sensitivity to the secret key is also conducted. All the results in this paper have shown that the presented method is a good candidate for designing dynamical S-boxes that can be widely used in block cipher.

In the digital World full of hackers and scammers, data security is what everyone needs the most. Hackers and scammers invent the new ways of stealing the information on daily basis. A comparatively modern concept in the World of hacking is malvertising. The major focus of this research paper is to evaluate the concept of malvertising through Cortana an artificial intelligence-based assistant introduced by Microsoft in windows 10. Sources of data are websites and other research papers. The major security breaches through malvertising are under consideration in this research paper. By evaluation, malvertising can be considered as one of the most dangerous security threats in digital World.

Traditional cryptographic block cipher algorithms are often unsuitable for low-resource profiled IoT (Internet of Things) devices. A lightweight cryptographic algorithm is thus mandated. The S boxes are often called the heart of a cryptographic protocol, as a considerable amount of resource and time complexities are associated with the design of an S box. A lightweight S box will consume less memory, less power and less time, ensuring a high-level Shanon’s property of confusion. This paper proposes a lightweight S box design to meet all the requirements of lightweight cryptographic ciphers. The proposed method applies a couple of transformations- the multiplicative inverse in the Galois field \(({2}^{4})\) and affine transformations on selected irreducible polynomials to create \(4\times 4\) S-boxes. Several cryptanalyses such as balance test, bijection property, difference distribution table test, and Boomerang Connectivity were performed to demonstrate the robust characteristics of the proposed method.

In the paper a new schedule of S-boxes design is considered. We start from motivation from block cipher practice. Then, the most popular S-box design criteria are presented, especially a possibility of application of Boolean bent-functions. Finally, we propose integrating neural networks (playing a role of Boolean functions with appropriate properties) in the design process.