Abstract TinyJambu is one of the 10 finalists in the NIST Lightweight Cryptography Standardization Project. This Authenticated Encryption with Associated Data algorithm is very fast and extremely small in terms of hardware implementation. In this work, we study a differential cryptanalytic attack against TinyJambu. It is a deeper analysis than previous works found in the literature as well as it also obtains better differential probabilities than those of other studies. More precisely, we develop a differential forgery attack with probability 2–65.7845, what is much better than 2−80 obtained by the own designers and better than 2–70.12 the best probability obtained by other authors. In brief, we have reduced the margin of security against a forgery attack for this proposal of lightweight cryptosystem. Later, NIST allows to tweak TinyJambu by increasing the number of rounds from 384 up to 640. This round increment means a greater security margin than before. For this updated version of TinyJambu, we analyse some properties of the new algorithm that allow TinyJambu to be considered for particular IoT applications as well.

Abstract With the increasing complexity of cyber-physical systems, combined with the potential risk of cyber-attacks, the possibility of having reliable anomaly detection systems plays a significant role in every process, promoting the scientific community’s efforts. Due to the remarkable importance of this kind of tool, a wide variety of approaches and techniques model the expected behavior of a system. An intuitive way to deal with this problem consists of determining the boundaries of the dataset. This document presents a novel procedure to speed up an existing anomaly detection technique based on non-convex boundaries.

Abstract In this work, an intelligent observer is developed and implemented for fault detection and information retrieval in a small wind turbine. The intelligent observer will allow the detection of faults in the turbine’s energy generation, thanks to the estimation of the active power generated. This estimate will be compared with the real active power, measured by a real sensor, so that, if there is not a very high deviation between both values, the sensor measurement will be considered valid. However, when the difference between the estimated value and the real value exceeds a threshold, the sensor measurement will be replaced with the estimate. This threshold will be determined based on the operating point. The results obtained are satisfactory, with a correct estimation and detection of anomalies.

Abstract This paper presents a novel iterative algorithm for determining contact-rate parameters in individual-based propagation models. Conventional mathematical epidemiological approaches frequently utilize compartmental models with uniform epidemiological coefficients, which are unable to account for the heterogeneity of individual behaviors and interactions. This research employs Physics Informed Neural Networks (PINNs), which have demonstrated efficacy in addressing differential equations and parameter estimation in both direct and inverse problems. PINNs are applied to individual-based models, which consider unique epidemiological characteristics for each individual or device, thus addressing the limitations of global models. The proposed method is particularly pertinent to the modeling of malware propagation in Internet of Things (IoT) networks, where each device exhibits distinct interaction patterns. The study employs a cellular automaton framework to simulate malware spread, thereby demonstrating the potential of PINNs in accurately estimating time-dependent contact rates. The methodology incorporates specific infection probabilities and recovery rates, thereby demonstrating its applicability to complex, heterogeneous systems. This approach represents a significant advancement in our understanding and prediction of the dynamics of disease and malware propagation, offering a robust tool for both biological and digital epidemiology. The findings indicate that individual-based models, enhanced with PINN-driven parameter estimation, can more accurately reflect real-world scenarios, thereby facilitating the development of more effective strategies for controlling epidemics and mitigating cybersecurity threats.

Abstract This paper describes a novel library implementation for quantum simulation of typical Boolean circuits and several encryption systems. The tool contains half and full adders, binary encoder ($2^{n}$ to $n$), binary decoder ($n$ to $2^{n}$), and multiplexer, as well as its development details accompanied by graphics generated by the software itself. These tools are essential for the implementation of several classical and current ciphers. In addition, studies of optimizations for the quantum paradigm of symmetric encryption systems of different types, such as substitution or permutation ciphers and a simplified version of AES (S-AES), are included. This approach allows a simple and intuitive understanding of the quantum equivalent circuits to the fundamentals of digital electronics and logic design, providing an innovative and pedagogical tool that allows the quantum implementation of classic circuits for real applications including complex encryption systems, starting from previously defined algorithms.

Abstract We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra of C.S. Peirce. We also offer new constructions of reductions, systematically study irreducible relations and reductions to them and introduce a new characteristic of relations, ternarity, that measures their ‘complexity of relating’ and allows to refine reduction results. In particular, we refine Peirce’s controversial reduction thesis, and show that reducibility behaviour is dramatically different on finite and infinite domains.

The eight contributions selected in this special issue represent a collection of extended papers presented at the eighth International Conference on Computational Intelligence in Security for Information Systems (CISIS 2015) held in Burgos, Spain, in June 2015, and organized by the BISITE (University of Salamanca) and the GICAP (University of Burgos) research groups, together with the Technological Institute of Castilla y León. CISIS aims to offer a meeting opportunity for academic- and industry-related researchers belonging to the various, vast communities of Computational Intelligence, Information Security and Data Mining. The need for intelligent, flexible behaviour by large, complex systems, especially in mission critical domains, is intended to be the catalyst and the aggregation stimulus for the overall event. In the first contribution, by Wójtowicz et al., an architecture and a protocol for secure and privacy-preserving smart space usage are proposed. It relies on a trusted party operating as a public service in the `security infrastructure as a service’ model. The proposed solution is designed to minimize the risk of users privacy violation from the side of service providers and attackers impersonating regular users, as well as the risk of violating privacy of users’ payment patterns from the side of payment authorities.

A system |${\sf WF}$| of subintuitionistic logic is introduced, weaker than Corsi’s basic subintuitionistic system |${\sf F}$|⁠. A derivation system with and without hypotheses is given in line with the authors’ derivation system for |${\sf F}$|⁠. A neighbourhood semantics is introduced with a somewhat more complex definition than the neighbourhood semantics for non-normal modal logics. Completeness is proved for |${\sf WF}$| with respect to this neighbourhood semantics, and similarly for some logics between |${\sf WF}$| and |${\sf F}$| which characterize nice frame classes. The study by the authors of the conservativity of |${\sf IPC}$| over |${\sf F}$| with respect to some classes of implications is extended to |${\sf WF}$|⁠, and shows clearly the difference in strength between the two logics. Study of translations of these weak subintuitionistic logics into non-normal modal logics turned out to be hard because of the difference between their respective neighbourhood structures and leaves us with some open problems.

This article addresses and resolves some issues of relational, Kripke-style, semantics for the logics of bounded lattice expansions with operators of well-defined distribution types, focusing on the case where the underlying lattice is not assumed to be distributive. It therefore falls within the scope of the theory of Generalized Galois Logics (GGLs), introduced by Dunn, and it contributes to its extension. We introduce order-dual relational semantics and present a semantic analysis and completeness theorems for non-distributive lattice logic with $n$ -ary additive or multiplicative operators ( $n$ -ary boxes and diamonds), with negation operators modally interpreted as impossibility and unnecessity (falsifiability), as well as with implication connectives. Order-dual relational semantics shares with the generalized Kripke frames, or the bi-approximation semantics approach, the use of both a satisfaction and a co-satisfaction (refutation) relation, but it also responds to the recently voiced concerns of Craig, Haviar and Conradie about the relative non-intuitiveness of the 2-sorted semantics of the aforementioned approaches. In this article, we provide a standard (classical) interpretation (or dual interpretation) of modalities and natural interpretations of both negation and implication, despite the absence of distribution. Thereby, our results contribute in creating the necessary background for research in non-distributive logics with modalities variously interpreted as dynamic, temporal etc, by analogy to the classical case.

In order to achieve a safe and systematic treatment of security protocols, organizations release a number of technical briefings describing how to detect and manage security incidents. A critical issue is that this document set may suffer from semantic deficiencies, mainly due to ambiguity or different granularity levels of description and analysis. An approach to face this problem is the use of semantic methodologies in order to provide better Knowledge Externalization from incident protocols management. In this article, we propose a method based on semantic techniques for both, analyzing and specifying (meta)security requirements on protocols used for solving security incidents. This would allow specialist getting better documentation on their intangible knowledge about them.