Search

A recent trend has shown constructions of 6-bit S-boxes that are mostly focused on their cryptographic elegance, while their lightweight aspects have not really been addressed well. This paper attempts to plug-in this existing research gap where we show how the composite structure of the extension field F26 could be leveraged. An earlier well-known example is an efficient implementation of AES S-box using the tower field extension of F28 . The case of F2ab is completely different from any tower field as the implementation varies as per the choice of extension – for instance, F(2a)b or F(2b)a , where a and b are prime. Thus, it makes the implementation of S-boxes over F26 = F2(2×3) very interesting. In this work, we systematically study the composite field structure of F26 from a hardware standpoint for a class of S-boxes that are power mapping or their affine equivalents. We analyze the hardware efficiency with respect to different representations of the field extension, i.e., F(22)3 or F(23)2 . Furthermore, for each extension, we investigate the impact of various choices of bases – for instance, we present the evidence of the effect that normal or polynomial bases have on the implementation. This gives us further insight on the choice of basis with respect to the field extension. In the process, we present a special normal basis, when used in conjunction with F(23)2 results in the least (or very close to least) area in terms of GE for the 18 (6 quadratic and 12 cubic) S-boxes studied in this work. The special normal basis reported here has some algebraic properties which make it inherently hardware friendly and allow us to predict the area reduction, without running a tool. Overall, this work constitutes an extensive hardware characterization of a class of cryptographically significant 6-bit S-boxes giving us interesting insights into the systematic lightweight implementation of S-boxes without relying on an automated tool.

Reconstructing an S-box from a cryptographic table such as difference distribution table (DDT), linear approximation table (LAT), differential-linear connectivity table (DLCT) or boomerang connectivity table (BCT) is one of the fundamental problems in symmetric-key cryptography. Till now, there are only very few known methods which can reconstruct an S-box from a given table: guess-and-determine algorithms of Boura et al. (DCC 2019) and Tian et al. (DCC 2020), sign determination algorithm of Dunkelman et al. (ToSC 2019) and STP based approach of Lu et al. (DCC 2022). In this paper we consider the reconstruction problem in an even more challenging setup where one needs to reconstruct S-boxes from a partial cryptographic table. We are able to reconstruct S-boxes when only a few number of rows of a cryptographic table is given. This problem has never been studied in the literature. We apply mixed integer linear programming (MILP) as the key tool for solving this problem. Needless to say that we can solve the reconstruction problem when the full table is given and this is the first ever application of MILP tool in solving such fundamental problems. As a further application of our method, we provide the generic MILP models which can search for S-boxes with a given cryptographic property such as differential uniformity, linearity, differential-linear uniformity or boomerang uniformity. Additionally, our method can recover a Boolean function from a given Walsh spectrum or a Boolean function with a given nonlinearity. We also introduce a new heuristic called Optimistic MILP objective that guides the model towards obtaining multiple S-boxes or Boolean functions with the same cryptographic property. We give detailed experimental results for up to 6-bit S-boxes showing the effectiveness of our technique.

Background: Pediatric traumatic brain injury (TBI) is a global public health concern and is preventable, but there are no approved therapies to treat it definitely until date. Falls are the most frequent mode of injuries followed by road traffic accidents (RTA). Most of the TBIs have favorable outcome, though this is influenced by geographical, environmental, societal, and ethnic differences. Aims and Objectives: The aims of this study were to determine the several modes of injury, severity of injury, outcomes, and complications in the Eastern Indian population. Materials and Methods: Children-aged 3 mm and it was 12.77% with MLS of

The recently adopted Ascon standard by NIST offers a lightweight authenticated encryption algorithm for use in resource-constrained cryptographic devices. To help assess side-channel attack risks of Ascon implementations, we present the first template attack based on analyzing power traces, recorded from an STM32F303 microcontroller board running Weatherley’s 32-bit implementations of Ascon-128. Our analysis combines a fragment template attack with belief-propagation and key-enumeration techniques. The main results are three-fold: (1) we reached 100% success rate from a single trace if the C compiler optimized the unmasked implementation for space, (2) the success rate was about 95% after three traces if the compiler optimized instead for time, and (3) we also attacked a masked version, where the success rate was over 90% with 20 traces of executions with the same key, all after enumerating up to 224 key candidates. These results show that suitably-designed template attacks can pose a real threat to Ascon implementations, even if protected by first-order masking, but we also learnt how some differences in programming style, and even compiler optimization settings, can significantly affect the result.

Background: There is a dearth of studies on non-motor symptoms of Wilson's disease (WD) which is primarily because of the non-availability of a suitable scale. Objective: To assess the suitability of the Parkinson's Disease non motor symptoms questionnaire (PD-NMS Quest) in the assessment of non-motor symptoms of WD patients. Methods: In this case-control study, patients of WD above ≥12 years of age diagnosed by Leipzig's criteria and age and gender-matched control subjects were recruited. Critically ill patients, patients with severe hepatic impairment, or with pure hepatic WD were excluded. PD-NMS Quest was applied and relevant statistical analyses were performed. Results: A total of 18 cases and 25 controls were studied. Patients had a mean age of 22.6 years and a median disease duration of 8 years. WD patients had higher frequencies of all NMS than controls. Drooling (P = 0.0037), dysphagia or choking (P = 0.0088), nocturia (P = 0.0471), anxiety/fear (P = 0.0337), feeling sad or blue (P = 0.0020) and falling (P = 0.0197) were significantly higher in WD patients than controls. Conclusions: Although many NMS of WD patients are picked up effectively with PD-NMS Quest, some of them need detail assessment including cognitive, behavioral, and psychiatric symptoms, drooling and dysphagia, sleep as well as autonomic disturbances. Questions pertaining to sexual activity may be omitted from the questionnaire.

Ever since lightweight cryptography emerged as one of the trending topics in symmetric key cryptography, optimizing the implementation cost of MDS matrices has been in the center of attention. In this direction, various metrics like d-XOR, s-XOR and g-XOR have been proposed to mimic the hardware cost. Consequently, efforts also have been made to search for the optimal MDS matrices for dimensions relevant to cryptographic applications according to these metrics. However, finding the optimal MDS matrix in terms of hardware cost still remains an unsolved problem. In this paper, we settle the question of the optimal 4 x 4 MDS matrices over GL(n, F2) under the recently proposed metric sequential XOR count based on words (sw-XOR). We prove that the sw-XOR of such matrices is at least 8n + 3, and the bound is tight as matrices with sw-XOR cost 35 and 67 for the values of n = 4 and 8, respectively, were already known. Moreover, the lower bound for these values of n matches with the known lower bounds according to s-XOR and g-XOR metrics.

ABSTRACT The evolution of viral variants and their impact on viral transmission have been an area of considerable importance in this pandemic of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). We analyzed the viral variants in different phases of the pandemic in West Bengal, a state in India that is important geographically, and compared the variants with other states like Delhi, Maharashtra, and Karnataka, located in other regions of the country. We have identified 57 pango-lineages in 3,198 SARS-CoV-2 genomes, alteration in their distribution, as well as contrasting profiles of amino acid mutational dynamics across different waves in different states. The evolving characteristics of Delta (B.1.617.2) sublineages and alterations in hydrophobicity profiles of the viral proteins caused by these mutations were also studied. Additionally, implications of predictive host miRNA binding/unbinding to emerging spike or nucleocapsid mutations were highlighted. Our results throw considerable light on interesting aspects of the viral genomic variation and provide valuable information for improved understanding of wave-defining mutations in unfolding the pandemic. IMPORTANCE Multiple waves of infection were observed in many states in India during the coronavirus disease 2019 (COVID19) pandemic. Fine-scale evolution of major SARS-CoV-2 lineages and sublineages during four wave-window categories: Pre-Wave 1, Wave 1, Pre-Wave 2, and Wave 2 in four major states of India: Delhi (North), Maharashtra (West), Karnataka (South), and West Bengal (East) was studied using large-scale virus genome sequencing data. Our comprehensive analysis reveals contrasting molecular profiles of the wave-defining mutations and their implications in host miRNA binding/unbinding of the lineages in the major states of India.

Being one of the winning algorithms of the CAESAR competition and currently a second round candidate of the NIST lightweight cryptography standardization project, the authenticated encryption scheme Ascon (designed by Dobraunig, Eichlseder, Mendel, and Schläffer) has withstood extensive self and third-party cryptanalysis. The best known attack on Ascon could only penetrate up to 7 (out of 12) rounds due to Li et al. (ToSC Vol I, 2017). However, it violates the data limit of 264 blocks per key specified by the designers. Moreover, the best known distinguishers of Ascon in the AEAD context reach only 6 rounds. To fill these gaps, we revisit the security of 7-round Ascon in the nonce-respecting setting without violating the data limit as specified in the design. First, we introduce a new superpoly-recovery technique named as partial polynomial multiplication for which computations take place between the so-called degree-d homogeneous parts of the involved Boolean functions for a 2d-dimensional cube. We apply this method to 7-round Ascon and present several key recovery attacks. Our best attack can recover the 128-bit secret key with a time complexity of about 2123 7-round Ascon permutations and requires 264 data and 2101 bits memory. Also, based on division properties, we identify several 60 dimensional cubes whose superpolies are constant zero after 7 rounds. We further improve the cube distinguishers for 4, 5 and 6 rounds. Although our results are far from threatening the security of full 12-round Ascon, they provide new insights in the security analysis of Ascon.

MDS matrices are used as building blocks of diffusion layers in block ciphers, and XOR count is a metric that estimates the hardware implementation cost. In this paper we report the minimum value of XOR counts of 4 × 4 MDS matrices over F24 and F28 , respectively. We give theoretical constructions of Toeplitz MDS matrices and show that they achieve the minimum XOR count. We also prove that Toeplitz matrices cannot be both MDS and involutory. Further we give theoretical constructions of 4 × 4 involutory MDS matrices over F24 and F28 that have the best known XOR counts so far: for F24 our construction gives an involutory MDS matrix that actually improves the existing lower bound of XOR count, whereas for F28 , it meets the known lower bound.

Gingivo-buccal squamous cell carcinoma (GBSCC) is one of the most common oral cavity cancers in India with less than 50% patients surviving past 5 years. Here, we report a whole transcriptome profile on a batch of GBSCC tumours with diverse tobacco usage habits. The study provides an entire landscape of altered expression with an emphasis on searching for targets with therapeutic potential.Whole transcriptomes of 12 GBSCC tumours and adjacent normal tissues were sequenced and analysed to explore differential expression of genes. Expression changes were further compared with those in TCGA head and neck cohort (n = 263) data base and validated in an independent set of 10GBSCC samples.Differentially expressed genes (n = 2176) were used to cluster the patients based on their tobacco habits, resulting in 3 subgroups. Immune response was observed to be significantly aberrant, along with cell adhesion and lipid metabolism processes. Different modes of immune evasion were seen across 12 tumours with up-regulation or consistent expression of CD47, unlike other immune evasion genes such as PDL1, FUT4, CTLA4 and BTLA which were downregulated in a few samples. Variation in infiltrating immune cell signatures across tumours also indicates heterogeneity in immune evasion strategies. A few actionable genes such as ITGA4, TGFB1 and PTGS1/COX1 were over expressed in most samples.This study found expression deregulation of key immune evasion genes, such as CD47 and PDL1, and reasserts their potential as effective immunotherapeutic targets for GBSCC, which requires further clinical studies. Present findings reiterate the idea of using transcriptome profiling to guide precision therapeutic strategies.