Ten years of cube attacks

In 2009, Dinur and Shamir proposed the cube attack, an algebraic cryptanalysis technique that only requires black box access to a target cipher. Since then, this attack has received both many criticisms and endorsements from crypto community; this work aims at revising and collecting the many attacks that have been proposed starting from it. We categorise all of these attacks in five classes; for each class, we provide a brief summary description along with the state-of-the-art references and the most recent cryptanalysis results. Furthermore, we extend and refine the new notation we proposed in 2021 and we use it to provide a consistent definition for each attack family. Finally, in the appendix, we provide an in-depth description of the kite attack framework, a cipher independent tool we firstly proposed in 2018 that implements the kite attack on GPUs. To prove its effectiveness, we use Mickey2.0 as a use case, showing how to embed it in the framework

Research and Technology

Langley Research Center is engaged in the basic an applied research necessary for the advancement of aeronautics and space flight, generating advanced concepts for the accomplishment of related national goals, and provding research advice, technological support, and assistance to other NASA installations, other government agencies, and industry. Highlights of major accomplishments and applications are presented

Security and Privacy for Modern Wireless Communication Systems

The aim of this reprint focuses on the latest protocol research, software/hardware development and implementation, and system architecture design in addressing emerging security and privacy issues for modern wireless communication networks. Relevant topics include, but are not limited to, the following: deep-learning-based security and privacy design; covert communications; information-theoretical foundations for advanced security and privacy techniques; lightweight cryptography for power constrained networks; physical layer key generation; prototypes and testbeds for security and privacy solutions; encryption and decryption algorithm for low-latency constrained networks; security protocols for modern wireless communication networks; network intrusion detection; physical layer design with security consideration; anonymity in data transmission; vulnerabilities in security and privacy in modern wireless communication networks; challenges of security and privacy in node–edge–cloud computation; security and privacy design for low-power wide-area IoT networks; security and privacy design for vehicle networks; security and privacy design for underwater communications networks

A Computational Study of Flow Over a Wall-Mounted Cube in a Turbulent Boundary Layer Using Large Eddy Simulations

Flow over a wall-mounted cube in a turbulent boundary layer (TBL) is a canonical problem with applications in many engineering systems. Atmospheric flow over buildings in an urban environment or vegetative canopies, air flow over road vehicles, flow over printed circuit boards, etc., are few examples which can be modeled by considering flow over wall-mounted cubes. Without loss of generality, the problem of interest in this work is controlling the separation region on the rear end of road vehicles to reduce aerodynamic drag. To do so, we intend to use a row of cubes placed in single line normal to the flow direction, as passive vortex generators (VGs) to reduce flow separation. Flow separation is caused by an adverse pressure gradient (APG). The flow expends its kinetic energy to overcome the APG as it decelerates, and eventually separates from the surface. It is important to reduce flow separation to improve and maintain aerodynamic efficiency, and the approach of interest is to energize the flow to help overcome the APG. Passive VGs aid in reducing flow separation by entraining the turbulent kinetic energy (TKE) from the free-stream flow to the near wall region. Prior research in passive flow control reveals that the effectiveness of a VG in controlling separation depends on multiple factors which include, the size of the VG relative to the boundary layer thickness, spacing between adjacent VGs, and position of the VG with respect to the line of separation. While recent advances in numerical methods and computational resources have brought more complex flows under our computational grasp, resolving all the length and time scales for a large portion of real-world flows is still unfeasible. Large Eddy Simulations (LES) provide a promising alternative and is our tool for investigation in this study. An optimal deployment of cubes to control boundary layer separation requires a thorough understanding of the TKE entrainment and distribution in the wake of the cubes. The dependence of these quantities on the cube to height to boundary layer thickness ratio and spacing between adjacent cubes is poorly understood. Therefore, the objectives of this work are to perform LES of flow over wall-mounted cubes in a TBL to understand the effect of: (i) cube height to boundary layer thickness ratio, and (ii) inter-cube spacing on the near-wake characteristics in general, and TKE distribution in particular. To achieve these objectives, we validate an existing approach to simulate a spatially evolving turbulent boundary layer (SETBL), and propose a novel method using machine learning for the same purpose, with the aim of reducing computation time without any significant modification to the numerical framework. For a single cube placed in SETBL on a flat plate we discover that the TKE per unit area decays as a power law in the near-wake, and the power law exponent increases in a non-linear manner with increasing cube height. LES of flow over an array of cubes in SETBL reveals amplification of large scale coherent structures in the outer region of the TBL which are characterized by increasing TKE. We believe the ejection of low momentum fluid in the region in between adjacent cubes is responsible for this amplification. Our findings have direct applications in reducing aerodynamic drag on automobiles, aircrafts and improving turbine efficiency, which in turn can help us reduce greenhouse gas emissions.PHDMechanical EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/145901/1/siddhesh_1.pd

Design Space Exploration and Resource Management of Multi/Many-Core Systems

The increasing demand of processing a higher number of applications and related data on computing platforms has resulted in reliance on multi-/many-core chips as they facilitate parallel processing. However, there is a desire for these platforms to be energy-efficient and reliable, and they need to perform secure computations for the interest of the whole community. This book provides perspectives on the aforementioned aspects from leading researchers in terms of state-of-the-art contributions and upcoming trends

Date Science: Post Quantum Safe Cryptography

New cryptographic techniques have emerged in recent decades that do provide protection against quantum threats. These techniques are termed “postquantum cryptography” and consist of techniques based on quantum properties of light that prevent interception of messages, as well as classic computational techniques, all of which were designed to resist quantum attacks emerging from the rapidly accelerating research field of quantum computation. This paper provides background information on post-quantum security. It explores the security threats against communication security and particularly against key exchange that are enabled by the development of quantum computers. The applied and theoretical aspects of quantum-cryptographic technologies are considered, which is designed to be a reference for those operating in the ICT space in fields other than information security and postquantum cryptography. The interrelated elements that make up the concept and content determined by the application of quantum cryptography are analyzed. The systematic analysis of quantum algorithms, quantum cryptography and quantum hashing are presented. The proper concept vehicle over is brought, in particular the concepts of singularity and supersingularity are determined for elliptic curves and theoretical positions, lyings in their basis, are examined. Terms which must be taken into account at the selection of elliptic curves for cryptographic applications are determined

On Security of RASP Data Perturbation for Secure Half-Space Queries in the Cloud

Secure data intensive computing in the cloud is challenging, involving a complicated tradeoff among security, performance, extra costs, and cloud economics. Although fully homomorphic encryption is considered as the ultimate solution, it is still too expensive to be practical at the current stage. In contrast, methods that preserve special types of data utility, even with weaker security, might be acceptable in practice. The recently proposed RASP perturbation method falls into this category. It can provide practical solutions for specific problems such as secure range queries, statistical analysis, and machine learning. The RASP perturbation embeds the multidimensional data into a secret higher dimensional space, enhanced with random noise addition to protect the confidentiality of data. It also provides a query perturbation method to transform half-space queries to a quadratic form and, meanwhile, preserving the results of half-space queries. The utility preserving property and wide application domains are appealing. However, since the security of this method is not thoroughly analyzed, the risk of using this method is unknown. The purpose of this paper is to investigate the security of the RASP perturbation method based on a specific threat model. The threat model defines three levels of adversarial power and the concerned attacks. We show that although the RASP perturbed data and queries are secure on the lowest level of adversarial power, they do not satisfy the strong indistinguishability definition on higher levels of adversarial power. As we have noticed, the indistinguishability definition might not be too strong to be useful in the context of data intensive cloud computation. In addition, the noise component in the perturbation renders it impossible to exactly recover the plain data; thus, all attacks are essentially estimation attacks. We propose a weaker security definition based on information theoretic measures to describe the effectiveness of estimation attacks, and then study the security under this weaker definition. This security analysis helps clearly identify the security weaknesses of the RASP perturbation and quantify the expected security under different levels of adversarial power