scholarly journals Xoodyak, a lightweight cryptographic scheme

Author(s):  
Joan Daemen ◽  
Seth Hoffert ◽  
Michaël Peeters ◽  
Gilles Van Assche ◽  
Ronny Van Keer

In this paper, we present Xoodyak, a cryptographic primitive that can be used for hashing, encryption, MAC computation and authenticated encryption. Essentially, it is a duplex object extended with an interface that allows absorbing strings of arbitrary length, their encryption and squeezing output of arbitrary length. It inherently hashes the history of all operations in its state, allowing to derive its resistance against generic attacks from that of the full-state keyed duplex. Internally, it uses the Xoodoo[12] permutation that, with its width of 48 bytes, allows for very compact implementations. The choice of 12 rounds justifies a security claim in the hermetic philosophy: It implies that there are no shortcut attacks with higher success probability than generic attacks. The claimed security strength is 128 bits. We illustrate the versatility of Xoodyak by describing a number of use cases, including the ones requested by NIST in the lightweight competition. For those use cases, we translate the relatively detailed security claim that we make for Xoodyak into simple ones.

Author(s):  
Yu Long Chen ◽  
Atul Luykx ◽  
Bart Mennink ◽  
Bart Preneel

We present a length doubler, LDT, that turns an n-bit tweakable block cipher into an efficient and secure cipher that can encrypt any bit string of length [n..2n − 1]. The LDT mode is simple, uses only two cryptographic primitive calls (while prior work needs at least four), and is a strong length-preserving pseudorandom permutation if the underlying tweakable block ciphers are strong tweakable pseudorandom permutations. We demonstrate that LDT can be used to neatly turn an authenticated encryption scheme for integral data into a mode for arbitrary-length data.


Author(s):  
Maria Eichlseder ◽  
Marcel Nageler ◽  
Robert Primas

AEGIS is one of the authenticated encryption designs selected for the final portfolio of the CAESAR competition. It combines the AES round function and simple Boolean operations to update its large state and extract a keystream to achieve an excellent software performance. In 2014, Minaud discovered slight biases in the keystream based on linear characteristics. For family member AEGIS-256, these could be exploited to undermine the confidentiality faster than generic attacks, but this still requires very large amounts of data. For final portfolio member AEGIS-128, these attacks are currently less efficient than generic attacks. We propose improved keystream approximations for the AEGIS family, but also prove upper bounds below 2−128 for the squared correlation contribution of any single suitable linear characteristic.


2021 ◽  
Vol 3 (2) ◽  
pp. 65-72
Author(s):  
Muhammad Rehan Anwar ◽  
Desy Apriani ◽  
Irsa Rizkita Adianita

The hash function is the most important cryptographic primitive function and is an integral part of the blockchain data structure. Hashes are often used in cryptographic protocols, information security applications such as Digital Signatures and message authentication codes (MACs). In the current development of certificate data security, there are 2 (two) types of hashes that are widely applied, namely, MD and SHA. However, when it comes to efficiency, in this study the hash type SHA-256 is used because it can be calculated faster with a better level of security. In the hypothesis, the Merkle-Damgård construction method is also proposed to support data integrity verification. Moreover, a cryptographic hash function is a one-way function that converts input data of arbitrary length and produces output of a fixed length so that it can be used to securely authenticate users without storing passwords locally. Since basically, cryptographic hash functions have many different uses in various situations, this research resulted in the use of hash algorithms in verifying the integrity and authenticity of certificate information.


2019 ◽  
Vol 36 (1) ◽  
pp. 93-112
Author(s):  
Kevin D. Ashley

Predicting case outcomes has long played a role in research on Artificial Intelligence and Law. Actually, it has played several roles, from identifying borderline cases worthy of legal academic commentary, to providing some evidence of the reasonableness of computational models of case-based legal reasoning, to providing the raison d'être of such models, to accounting for statistically telling features beyond such models, to circumventing features altogether in favor of predicting outcomes directly from analyzing case texts. The use cases to which case prediction has been put have also evolved. This article briefly surveys this historical evolution of roles and uses from a mere research possibility to a fundamental tool in AI and Law’s kit bag of techniques.  


Author(s):  
Jessy Ayala

The focus of this research is to analyze the results of encrypting audio using various authenticated encryption algorithms implemented in the Python cryptography library for ensuring authenticity and confidentiality of the original contents. The Advanced Encryption Standard (AES) is used as the underlying cryptographic primitive in conjunction with various modes including Galois Counter Mode (GCM), Counter with Cipher Block Chaining Message Authentication Code (CCM), and Cipher Block Chaining (CBC) with Keyed-Hashing for encrypting a relatively small audio file. The resulting encrypted audio shows similarity in the variance when encrypting using AES-GCM and AES-CCM. There is a noticeable reduction in variance of the performed encodings and an increase in the amount of time it takes to encrypt and decrypt the same audio file using AES-CBC with Keyed-Hashing. In addition, the corresponding encrypted using this mode audio spans a longer duration. As a result, AES should either have GCM or CCM for an efficient and reliable authenticated encryption integration within a workflow.


2016 ◽  
Vol 67 (1) ◽  
pp. 167-190
Author(s):  
Damian Vizár

Abstract Ensuring confidentiality and integrity of communication remains among the most important goals of cryptography. The notion of authenticated encryption marries these two security goals in a single symmetric-key, cryptographic primitive. A lot of effort has been invested in authenticated encryption during the fifteen years of its existence. The recent Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR) has boosted the research activity in this area even more. As a result, the area of authenticated encryption boasts numerous results, both theoretically and practically oriented, and perhaps even greater number of constructions of authenticated encryption schemes. We explore the current landscape of results on authenticated encryption. We review the CEASAR competition and its candidates, the most popular construction principles, and various design goals for authenticated encryption, many of which appeared during the CAESAR competition. We also take a closer look at the candidate Offset Merkle-Damgård (OMD).


Author(s):  
M.V. Pimenova ◽  
L. Wu

В статье рассматривается внутригородская ономастическая лексика как отражение истории русского языка. На материале коммерческих урбанонимов г. Владимира и Владимирской области (современных названий магазинов, ресторанов, кафе, салонов, фирм и т.п.) демонстрируется функционирование древних парных именований (хлеб-соль, гуси-лебеди,стар имлад,черноеибелоеи др.), а также случаи использования их семантических и структурных моделей в нейминге.The article deals with intracity onomastic vocabulary as a reflection of the history of the Russian language. On the material commercial urbanity of the city of Vladimir region (the contemporary names of shops, restaurants, cafes, salons, firms, etc.), illustrates the operation of the ancient of paired names (bread and salt, geese and swan, young and old, black and white, etc.), as well as use cases and their semantic and structural patterns in the naming.


Author(s):  
Guido Bertoni ◽  
Joan Daemen ◽  
Seth Hoffert ◽  
Michaël Peeters ◽  
Gilles Van Assche ◽  
...  

In this paper, we introduce Farfalle, a new permutation-based construction for building a pseudorandom function (PRF). The PRF takes as input a key and a sequence of arbitrary-length data strings, and returns an arbitrary-length output. It has a compression layer and an expansion layer, each involving the parallel application of a permutation. The construction also makes use of LFSR-like rolling functions for generating input and output masks and for updating the inner state during expansion. On top of the inherent parallelism, Farfalle instances can be very efficient because the construction imposes less requirements on the underlying primitive than, e.g., the duplex construction or typical block cipher modes. Farfalle has an incremental property: compression of common prefixes of inputs can be factored out. Thanks to its input-output characteristics, Farfalle is really versatile. We specify simple modes on top of it for authentication, encryption and authenticated encryption, as well as a wide block cipher mode. As a showcase, we present Kravatte, a very efficient instance of Farfalle based on Keccak-p[1600, nr] permutations and formulate concrete security claims against classical and quantum adversaries. The permutations in the compression and expansion layers of Kravatte have only 6 rounds apiece and the rolling functions are lightweight. We provide a rationale for our choices and report on software performance.


2021 ◽  
Vol 3 (2) ◽  
pp. 77-88
Author(s):  
Malti Bansal ◽  
Harmandeep Singh ◽  
Gaurav Sharma

This research paper reviews and briefly discusses about the multiplexers and demultiplexers. This research paper aims to explore the history of multiplexers, types of multiplexers, applications and the real-time use cases of multiplexers. Furthermore, it also includes a brief introduction on the different multiplexing techniques employed in analog and digital electronics, ongoing research studies and future research scope for multiplexers.


The author expresses his regret that notwithstanding the great interest, more especially in a geological point of view, which attaches to every topic connected with the origin, the nature, and the permanence in temperature of the many thermal springs met with in different parts of the world, our information on these subjects is exceedingly deficient. On many points which might easily be verified, and which are of essential consequence towards obtaining a satisfactory theory of the phenomena, we as yet possess but vague and uncertain knowledge. It is evident that the first step towards the establishment of such a theory must consist in the precise determination of the actual temperature of each spring ; from which we may derive the means of estimating by comparative observations, at different periods, the progressive variations, whether secular, monthly, or even diurnal, to which that temperature is subject. We have at present, indeed, not only to lament the total absence of exact data on which to found such an inquiry ; but we are obliged to confess that, owing to the difficulties which meet us even in the threshhold, we have not, even at the present day, made any preparation for establishing the basis of future investigation, by applying such methods of experiment as are really in our power, and are commensurate with the superior accuracy of modern science. The researches of Fourier would lead us to the conclusion that, if the high temperature of these springs be derived solely from that of the interior portions of the earth, the changes which can have occurred in that temperature, during any period to which history extends, must be so minute as to be inappreciable. On the other hand, the theory of internal chemical changes, which have been assigned as the origin of volcanos, would suggest it as improbable that this temperature has remained constantly the same ; and as a more likely occurrence, even were we to suppose that no uniform secular diminution took place, that it would be liable to occasional irregular fluctuations. The influence of earthquakes on the temperature of hot springs is also admitted ; and it would be very desirable to learn, from a series of consecutive observations, whether abrupt changes, similar to those which have occasionally been noticed, are not of frequent occurrence. The author has diligently laboured to collect, by observations made on the spot, materials for supplying this great chasm in the natural history of our globe. As an essential preliminary means of obtaining accurate results, he applied himself to the verification of the scales of the thermometers he employed in these researches : and he describes, in a separate section of this paper, the methods which he adopted for the attainment of this object. He first fixed with great precision the standard points of each thermometer, namely the freezing and boiling temperatures of water, by a mode which he specifies : and afterwards determined the intermediate points of the scale by a method, similar to that of Bessel ; namely, that of causing a detached column of mercury to traverse the tube ; but simpler in practice. Instead of employing for that purpose columns of mercury of arbitrary length, and deducing by a complex and tentative process the portions of the tube having equal capacities, the author detaches a column of mercury from the rest, of such a length as may be nearly an aliquot part of the length of the scale for 180° ; and causes this column to step along the tube ; the lower part of the column being brought successively to the exact points which the upper extremity had previously occupied : so that, at last, if its length has been properly chosen, the upper end of the column is found to coincide with the end of the scale : and this being accomplished, it is easy to apply to every part of the actual scale of the instrument the proper corrections, which may, for greater practical convenience, be drawn up in the form of a table.


Sign in / Sign up

Export Citation Format

Share Document