In this article, we propose a methodology for finding impossible differential distinguishers for permutations used in sponge-like constructions. Given the difference between the typical block ciphers and such permutations in terms of key additions, we initiate the construction of an impossible differential trail starting from the middle round. Based on the proposed methodology, we present several new or improved truncated and impossible distinguishers for Ascon, DryGascon, Sycon, and Shamash all of which were submitted to the National Institute of Standards and Technology Lightweight Cryptography project. For the Ascon, we significantly reduce the attack complexity compared to the existing results, and notably this marks the first instance of proposing specific truncated and impossible differential trails for Sycon and Shamash. Finally, we discuss how truncated differential distinguishers, identified using our methodology, enable the key-recovery attacks in weak-key setting. The methodology of this article is significant not only for the ciphers considered but also for the other permutation-based ciphers with similar structures. Given that the target algorithms are suitable for the resource-constrained devices, our results provide new insights into security for the Internet of Things.

In this paper, we present a new method to find Sbox circuits with optimal multiplicative complexity (MC), i.e., MC-optimal S-box circuits. We provide new observations for efficiently constructing circuits and computing MC, combined with a popular pathfinding algorithm named A*. In our search, the A* algorithm outputs a path of length MC, corresponding to an MC-optimal circuit. Based on an in-depth analysis of the process of computing MC, we enable the A* algorithm to function within our graph to investigate a wider range of S-boxes than existing methods such as the SAT-solver-based tool [1] andLIGHTER[2]. We provide implementable MC-optimal circuits for all the quadratic 5-bit bijective S-boxes and existing 5-bit almost-perfect nonlinear (APN) S-boxes. Furthermore, we present MC-optimal circuits for 6-bit S-boxes such as Sarkar Gold, Sarkar Quadratic, and some quadratic permutations. Finally, we theoretically demonstrate new lower bounds for the MCs of S-boxes, providing tighter bounds for the MCs ofAESandMISTYS-boxes than previously known. This study complements previous results on MC-optimal S-box circuits and is intended to provide further insight into this field.

Remote Direct Memory Access (RDMA) characteristics, such as high bandwidth, low latency, and low CPU utilization, have positioned RDMA as mainstream for interconnect of cloud-based High-Performance Computing (HPC) services. However, existing RDMA technologies, including InfiniBand and RoCEv2, have limitations in terms of compatibility with legacy networks, scalability in large-scale deployment, and cost-inefficient. In order to address these challenges, we propose Cloud-optimized RDMA Networking (CORN). It features cloud-optimized congestion control, which considers the Bandwidth Delay Product (BDP) and the inflight packets to determine the amount of traffic to be transmitted. This congestion control scheme significantly reduces the likelihood of packet loss due to overflowing buffers on the network switches. CORN leverages the traditional Selective ACK (SACK) to deal with packet drops caused by network congestion or H/W fault. Consequently, CORN can support lossy RDMA networks on Ethernet. In addition, the two features of CORN are designed to operate without any modifications or configurations of the network switches. CORN functions as a shim layer between UDP and RDMA, operating solely within the end host. This design ensures the seamless deployment of CORN. The implementation using ns3 shows that CORN is feasible and more efficient than congestion control schemes like DCQCN, TIMELY, and HPCC.

In this paper, a new robust surface pattern matching technique is proposed for estimating the spin rate and spin axis of a spinning ball from a multi-exposed image under varying illumination conditions. In the proposed technique, robust surface pattern extraction based on the OFF cell model of the human visual system is employed to obtain high-contrast surface patterns and a novel rotational surface pattern matching based on the contrast response difference between the patterns is then used to estimate the spin rate and spin axis of the ball with high accuracy. The proposed technique is highly robust and highly accurate when compared to correlation-based techniques. In addition, the processing time for the new technique is less than in the other techniques. The performance of the proposed technique is verified through real experimental results under various illumination conditions.

Jongsung Kim, Bo Hong, Naveen Chilamkurti; Advanced Computer Technologies and Applications in Grid and Cloud Computing, The Computer Journal, Volume 57, Issue 2

The incorporation of remote sensing (RS) data into digital soil models has shown success to improve soil predictions. However, the effects of multiresolution imagery on modeling of biogeochemical soil properties in aquatic ecosystems are still poorly understood. The objectives of this study were the following: 1) to develop prediction models for soil total phosphorus (TP) and total nitrogen (TN) utilizing RS images and environmental ancillary data at three different resolutions; 2) to identify controlling factors of the spatial distribution of soil TP and TN; and 3) to elucidate the effects of different spatial resolutions of RS images on inferential modeling. Soil cores were collected (n = 108) from the top 10 cm in a subtropical wetland: Water Conservation Area-2A, the Florida Everglades, USA. The spectral data and derived indices from RS images, which have different spatial resolutions, included the following: MODIS (500 m resampled to 250 m), Landsat ETM+ (30 m), and SPOT (10 m). Block kriging and random forest (RF) were employed to predict soil TP and TN using RS-image-derived spectral input variables, environmental ancillary data, and soil observations. The RF models showed R2between 0.90 and 0.93 and root mean square error between 100.4 and 115.9 mg · kg-1for TP and between 1.45 and 1.52 g · kg-1for TN. Soil TP was mainly predicted from RS-derived spectral indices that infer on biotic/vegetation characteristics, whereas soil TN was predicted using a combination of biotic/vegetation, topographic, and hydrologic variables. Results suggest that the spectral data informed soil models have excellent predictive capabilities in this aquatic ecosystem. Interestingly, there was no noticeable distinction among different spatial resolutions of RS images to develop prediction models for soil TP and TN in terms of error assessment. However, the variability and complexity of soil TP and TN variations were much better expressed with the finer resolution RFSPOT model than the coarser resolution RFMODIS model as demonstrated using entropy.

No abstract available.

The Camellia block cipher has a 128-bit block length, a user key 128, 192 or 256 bits long and a total of 18 rounds for a 128-bit key and 24 rounds for a 192 or 256-bit key. It is a Japanese CRYPTREC-recommended e-government cipher, a European new European schemes for signatures, integrity and encryption (NESSIE) selected cipher and an ISO international standard. In this study, the authors describe a flaw in the approach used to choose plaintexts or ciphertexts in certain previously published square-like cryptanalytic results for Camellia and give two possible approaches to correct them. Finally, by taking advantage of the early abort technique and a few observations on the key schedule of Camellia, the authors present impossible differential attacks on 10-round Camellia with the FL/FL−1 functions under 128 key bits, 11-round Camellia with the FL/FL−1 functions under 192 key bits, 14-round Camellia without the FL/FL−1 functions under 192 key bits and 16-round Camellia without the FL/FL−1 functions under 256 key bits.

ABSTRACT In this paper, we analyze the block cipher SEED‐192, which is an extended version of the ISO/IEC block cipher SEED. According to the result of this paper, there exist weak keys in 8 out of the 20 rounds of SEED‐192 against related‐key differential attacks, and there exist weak keys in 16 out of the 20 rounds of SEED‐192 against related‐key rectangle/boomerang attacks. This is the first cryptanalytic result for the key schedule of SEED‐192. Copyright © 2012 John Wiley & Sons, Ltd.

In 2004, we introduced the related-key boomerang/ rectangle attacks, which allow us to enjoy the benefits of the boomerang attack and the related-key technique, simultaneously. The new attacks were used since then to attack numerous block ciphers. While the claimed applications are significant, most of them have a major drawback. Their validity cannot be verified experimentally due to their high complexity. Together with the lack of rigorous justification of the probabilistic assumptions underlying the technique, this lead Murphy to claim that attacks using the related-key boomerang/rectangle technique are not legitimate. This paper contains two contributions. The first is a rigorous analysis of the related-key boomerang/rectangle attacks, including devising provably optimal distinguishers and computing their success rate, and discussing the underlying independence assumptions. The second contribution is an extensive experimental verification of the related-key boomerang attack against the GSM block cipher, KASUMI. Our experiments reveal that the success probability of the distinguisher, when averaged over different choices of the keys, is close to the theoretical prediction. However, the exact probability depends on the key, such that for some por- tion of the keys, the distinguisher holds with a higher probability than expected, while for the rest of the keys, the distinguisher fails completely.

In this paper, we introduce a new side-channel attack using block cipher cryptanalysis named a meet-in-the-middle attack. Using our new side-channel technique we show that advanced encryption standard (AES) with reduced 10 masked rounds is broken, which is faster than the exhaustive key search attack. This implies that one has to mask the entire rounds of the 12-round 192-bit key AES to prevent our attacks. Our result is the first one to analyse AES with reduced 10 masked rounds, while the previous best known side-channel attack is on AES with reduced eight masked rounds.