Security analysis of SHA-256 and sisters

H Gilbert, H Handschuh - International workshop on selected areas in …, 2003 - Springer
This paper studies the security of SHA-256, SHA-384 and SHA-512 against collision attacks
and provides some insight into the security properties of the basic building blocks of the …

[KSIĄŻKA][B] New dimensions of information warfare

R Di Pietro, S Raponi, M Caprolu, S Cresci, R Di Pietro… - 2021 - Springer
Since the dawn of Humanity, the progress machine tirelessly introduced tools and resources
that facilitated our everyday tasks. Over the years, new technologies have continually …

Hash functions and RFID tags: Mind the gap

A Bogdanov, G Leander, C Paar, A Poschmann… - … and Embedded Systems …, 2008 - Springer
The security challenges posed by RFID-tag deployments are well-known. In response there
is a rich literature on new cryptographic protocols and an on-tag hash function is often …

Energy comparison of AES and SHA-1 for ubiquitous computing

JP Kaps, B Sunar - … Conference on Embedded and Ubiquitous Computing, 2006 - Springer
Wireless sensor networks and Radio Frequency Identifiers are becoming mainstream
applications of ubiquitous computing. They are slowly being integrated into our infrastructure …

Bio-inspired cryptosystem with DNA cryptography and neural networks

S Basu, M Karuppiah, M Nasipuri, AK Halder… - Journal of Systems …, 2019 - Elsevier
Abstract Bio-Inspired Cryptosystems are a modern form of Cryptography where bio-inspired
and machine learning techniques are used for the purpose of securing data. A system has …

[PDF][PDF] Cryptography for ultra-low power devices

JPE Kaps - 2006 - digital.wpi.edu
Ubiquitous computing describes the notion that computing devices will be everywhere:
clothing, walls and floors of buildings, cars, forests, deserts, etc. Ubiquitous computing is …

Randomly failed! The state of randomness in current Java implementations

K Michaelis, C Meyer, J Schwenk - Cryptographers' Track at the RSA …, 2013 - Springer
LNCS 7779 - Randomly Failed! The State of Randomness in Current Java Implementations
Page 1 Randomly Failed! The State of Randomness in Current Java Implementations Kai …

On the impossibility of highly-efficient blockcipher-based hash functions

J Black, M Cochran, T Shrimpton - … on the Theory and Applications of …, 2005 - Springer
Fix a small, non-empty set of blockcipher keys \mathcalK. We say a blockcipher-based hash
function is highly-efficient if it makes exactly one blockcipher call for each message block …

A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis

SA Azimi, A Ranea, M Salmasizadeh… - Designs, Codes and …, 2022 - Springer
ARX algorithms are a class of symmetric-key algorithms constructed by Addition, Rotation,
and XOR. To evaluate the resistance of an ARX cipher against differential and impossible …

Characteristic automated search of cryptographic algorithms for distinguishing attacks (CASCADA)

A Ranea, V Rijmen - IET Information Security, 2022 - Wiley Online Library
Automated search methods based on Satisfiability Modulo Theory (SMT) problems are
being widely used to evaluate the security of block ciphers against distinguishing attacks …