Results 91 to 100 of about 9,834 (223)
Modern Cryptanalysis: Techniques for Advanced Code Breaking [PDF]
, 2017 As an instructor at the University of Tulsa, Christopher Swenson could find no relevant text for teaching modern cryptanalysis?so he wrote his own. This is the first book that brings the study of cryptanalysis into the 21st century.
Christopher Swenson
core +2 more sources
(Not Surprising) Attacks on Recent Pairing‐Free Attribute‐Based Encryption Schemes
IET Information Security, Volume 2026, Issue 1, 2026.The fact that designing secure and efficient identity or attribute‐based encryption (ABE) schemes requires the use of specific algebraic tools like bilinear pairings or lattices is well known in the cryptographic community. However, some journals whose main topics are not cryptographic still publish papers proposing, for instance, ABE schemes in ...
Javier Herranz, Thomas Haines
wiley +1 more source
Cryptanalysis of Some Block Ciphers [PDF]
, 2016 This thesis concerns the cryptanalysis of block ciphers and we look at two important examples: the Data Encryption Standard DES and the cipher RC5 proposed by Rivest.
Haji Naim, Abdul Ghani
core
Cryptanalysis of Round-Reduced Fantomas, Robin and iSCREAM
Cryptography, 2019 In this work, we focus on LS-design ciphers Fantomas, Robin, and iSCREAM. LS-designs are a family of bitslice ciphers aimed at efficient masked implementations against side-channel analysis.
Ashutosh Dhar Dwivedi +3 more
doaj +1 more source
Design of Iterative MDS Matrices Based on MISTY Structure
IET Information Security, Volume 2026, Issue 1, 2026.The security of symmetric‐key ciphers critically depends on the diffusion efficiency of their linear components. Iterative maximum distance separable (MDS) matrices, as fundamental elements of diffusion layer, play a pivotal role in constructing secure cryptographic systems.
Guoqiang Liu +5 more
wiley +1 more source
, 2009 Classical ciphers are used to encrypt plaintext messages written in a natural language in such a way that they are readable for sender or intended recipient only. Many classical ciphers can be broken by brute-force search through the key-space.
Pavol Zajac, Otokar Grošek
core +1 more source
IET Information Security, Volume 2026, Issue 1, 2026.Contemporary distributed ledgers face an inherent trilemma when attempting to simultaneously optimize three critical properties: transaction throughput (measured in transactions per second [TPS]), network security, and node decentralization. Current decentralized storage platforms such as Filecoin encounter constraints in managing peak transaction ...
Saha Reno +3 more
wiley +1 more source
, 2009 In this paper, we present a semi-free-start collision attack on the compression function for all Twister variants with negligible complexity. We show how this compression function attack can be extended to construct collisions for Twister-512 slightly faster than brute force search.
Florian Mendel +2 more
openaire +2 more sources
Problems in Cryptography and Cryptanalysis [PDF]
, 2018 The integer factorization problem used in the RSA cryptosystem, the discrete logarithm problem used in Diffie-Hellman Key Exchange protocol and the Elliptic Curve Discrete Logarithm problem used in Elliptic Curve Cryptography are traditionally considered
Rajakani M., Kannan Balasubramanian
core +1 more source
Cryptanalysis on deniable encryption [PDF]
, 2015 The notion of Deniable Encryption is a cryptographic primitive, which enables legitimate users to face coercion by dynamic adversaries without revealing true secret internals of the cryptosystem.
Jayasinghe, YBMS
core