Filters








37 Hits in 3.4 sec

Heterogeneous Rainbow Table Widths Provide Faster Cryptanalyses

Gildas Avoine, Xavier Carpent
2017 Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security - ASIA CCS '17  
Cryptanalytic time-memory trade-offs are techniques introduced by Hellman in 1980 to speed up exhaustive searches.  ...  Our technique performs very well: it makes any TMTO based on rainbow tables 40% faster than its classical version.  ...  INTRODUCTION A cryptanalytic time-memory trade-off is a technique to find preimages of given outputs of a one-way function.  ... 
doi:10.1145/3052973.3053030 dblp:conf/ccs/AvoineC17 fatcat:esihh2cr3vcevjtqfcdhs4zvji

Cache Attacks and Countermeasures: The Case of AES [chapter]

Dag Arne Osvik, Adi Shamir, Eran Tromer
2006 Lecture Notes in Computer Science  
We describe several software side-channel attacks based on inter-process leakage through the state of the CPU's memory cache.  ...  The attacks allow an unprivileged process to attack other processes running in parallel on the same processor, despite partitioning methods such as memory protection, sandboxing and virtualization.  ...  is about a non-uniform distribution of the plaintexts or ciphertexts (rather than their specific values).  ... 
doi:10.1007/11605805_1 fatcat:u3yllq7abfaqthhwfl6dbm3k5a

Efficient Cache Attacks on AES, and Countermeasures

Eran Tromer, Dag Arne Osvik, Adi Shamir
2009 Journal of Cryptology  
We describe several software side-channel attacks based on inter-process leakage through the state of the CPU's memory cache.  ...  The attacks allow an unprivileged process to attack other processes running in parallel on the same processor, despite partitioning methods such as memory protection, sandboxing and virtualization.  ...  is about the non-uniform distribution of the plaintexts or ciphertexts (rather than their specific values).  ... 
doi:10.1007/s00145-009-9049-y fatcat:dmawwwc4ivdcpluq4yepiyegtq

Strong 8-bit Sboxes with Efficient Masking in Hardware [chapter]

Erik Boss, Vincent Grosso, Tim Güneysu, Gregor Leander, Amir Moradi, Tobias Schneider
2016 Lecture Notes in Computer Science  
Our study includes investigations on Sboxes constructed from smaller ones using Feistel, SPN, or MISTY network structures.  ...  However, there are hardly any results available on how this concept can be adopted for block ciphers with large (i.e., 8-bit) Sboxes.  ...  As depicted in Figure 4 , a trade-off between resources and cryptographic properties is possible.  ... 
doi:10.1007/978-3-662-53140-2_9 fatcat:hj4qf4e6izhknnvnq4wtu3lqga

A free energy minimization framework for inference problems in modulo 2 arithmetic [chapter]

David J. C. MacKay
1995 Lecture Notes in Computer Science  
Assumptions I assume that the prior probability distribution of s and n is separable, i.e., P(s, n) = P(s)P(n) = l~I~ P(s~) 1-Irn P(n,~).  ...  This task arises in correlation attack on a class of stream ciphers and in the decoding of error correcting codes.  ...  Acknowledgements I thank Ross Anderson, Radford Neal, Roger Sewell, Robert McEliece and Malcolm MacLeod for helpful discussions, and Mike Cares, Andreas Herz and a referee for comments on the manuscript  ... 
doi:10.1007/3-540-60590-8_15 fatcat:xqq62pjvkjaidlltb5gq7hbhh4

Efficient implementation of ideal lattice-based cryptography

Thomas Pöppelmann
2017 it - Information Technology  
AbstractAlmost all practically relevant asymmetric cryptosystems like RSA or ECC are either based on the hardness of factoring or on the hardness of the discrete logarithm problem.  ...  As a consequence, research on alternative quantum-safe cryptosystems is required.  ...  The trade-off sampler is 1.95 times faster than the size-optimized sampler whereas the speed-optimized sampler is 3.19 times faster than the trade-off sampler.  ... 
doi:10.1515/itit-2017-0030 fatcat:mpmamskk25h3lbyshy4rfd4y4y

A survey of microarchitectural timing attacks and countermeasures on contemporary hardware

Qian Ge, Yuval Yarom, David Cock, Gernot Heiser
2016 Journal of Cryptographic Engineering  
Microarchitectural timing channels expose hidden hardware state though timing.  ...  Memory Controllers Contemporary server-class multiprocessor systems almost universally feature non-uniform memory access (NUMA).  ...  Therefore, any defence must be based on resource isolation. Fundamentally clouds represent a classical trade-off between security and economics.  ... 
doi:10.1007/s13389-016-0141-6 fatcat:7fvkr7h54rbl5mx6vrochsgtkm

Adapting Rigidity to Symmetric Cryptography

Orr Dunkelman, Léo Perrin
2019 Proceedings of the 5th ACM Workshop on Security Standardisation Research Workshop - SSR'19  
We motivate this need via a study of the literature on symmetric "kleptography" and via the study of some real-world standards.  ...  The idea is to first state a strict scope statement for the properties that the curve needs to have and then pick e.g. the one with the smallest parameters.  ...  They need to be able to perform all the trade-offs necessary, and they also need to be able to choose some of the subcomponents depending on some of the properties of the others.  ... 
doi:10.1145/3338500.3360335 dblp:conf/secsr/DunkelmanP19 fatcat:bezax4gyj5cd5ir6xjon6hxd5q

CRAFT: Lightweight Tweakable Block Cipher with Efficient Protection Against DFA Attacks

Christof Beierle, Gregor Leander, Amir Moradi, Shahram Rasoolzadeh
2019 IACR Transactions on Symmetric Cryptology  
Traditionally, countermeasures against physical attacks are integrated into the implementation of cryptographic primitives after the algorithms have been designed for achieving a certain level of cryptanalytic  ...  In this work we present the tweakable block cipher CRAFT: the efficient protection of its implementations against Differential Fault Analysis (DFA) attacks has been one of the main design criteria, while  ...  Time-Data-Memory Trade-off Attacks Since CRAFT uses a simple tweakey schedule, it is necessary to analyze the security of the cipher against Time-Data-Memory Trade-off (TDM TO) attacks [32] .  ... 
doi:10.46586/tosc.v2019.i1.5-45 fatcat:ry32mpm6dbhttenjxypp2ptf6m

CRAFT: Lightweight Tweakable Block Cipher with Efficient Protection Against DFA Attacks

Christof Beierle, Gregor Leander, Amir Moradi, Shahram Rasoolzadeh
2019 IACR Transactions on Symmetric Cryptology  
Traditionally, countermeasures against physical attacks are integrated into the implementation of cryptographic primitives after the algorithms have been designed for achieving a certain level of cryptanalytic  ...  In this work we present the tweakable block cipher CRAFT: the efficient protection of its implementations against Differential Fault Analysis (DFA) attacks has been one of the main design criteria, while  ...  Time-Data-Memory Trade-off Attacks Since CRAFT uses a simple tweakey schedule, it is necessary to analyze the security of the cipher against Time-Data-Memory Trade-off (TDM TO) attacks [32] .  ... 
doi:10.13154/tosc.v2019.i1.5-45 dblp:journals/tosc/BeierleLMR19 fatcat:4q6m3ausjba6texe56dppgmlnm

Quantum Complexity: restrictions on algorithms and architectures [article]

Daniel James Shepherd
2010 arXiv   pre-print
bias is Ambainis, Schulman, and Vazirani [8] showed that the non-uniform version of the complexity class NC 1 (classical, polynomial time, logarithmic circuit depth) is computable within a non-uniform  ...  His chances of succeeding naturally depend on how much data Alice requires for her hypothesis test, and how she trades off the probability of making a Type I error (accepting data sampled classically from  ... 
arXiv:1005.1425v1 fatcat:iusngjiypfgxzlezpnz5yiyarq

Rotational Cryptanalysis of Round-Reduced Keccak [chapter]

Paweł Morawiecki, Josef Pieprzyk, Marian Srebrny
2014 Lecture Notes in Computer Science  
Our main result is a preimage attack on 4-round Keccak and a 5-round distinguisher on Keccak-f [1600] permutation -the main building block of Keccak hash function.  ...  We focus on Keccak variants proposed as SHA-3 candidates in the NIST's contest for a new standard of cryptographic hash function.  ...  The known cryptanalytic results on Keccak can be divided into two types.  ... 
doi:10.1007/978-3-662-43933-3_13 fatcat:l2rofbebwbhhzoahpz7drflqcq

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme

Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, Damien Stehlé
2018 Transactions on Cryptographic Hardware and Embedded Systems  
The design of the scheme avoids all uses of discrete Gaussian sampling and is easily implementable in constant-time.  ...  In addition to the new design, we significantly improve the running time of the main component of many lattice-based constructions – the number theoretic transform.  ...  The main observation for obtaining this very favorable trade-off is that when the verifier computes w 1 in Line 13, the high-order bits of Az − ct do not depend too much on the low order bits of t because  ... 
doi:10.13154/tches.v2018.i1.238-268 dblp:journals/tches/DucasKLLSSS18 fatcat:skxxtodhvfcwrfb3vq7sqwrjue

Security Analysis of PUF-based Key Generation and Entity Authentication

Jeroen Delvaux
2017 Zenodo  
PUFs usually need to team up with other building blocks, e.g., true random number generators (TRNGs), cryptographic algorithms, error-correcting codes, non-volatile memory (NVM), etc.  ...  On the bright side, the lessons learned can help improve the quality of future PUF-based systems.  ...  We therefore assume the complete absence of error-correction techniques, which makes the protocol non-functional.  ... 
doi:10.5281/zenodo.2643392 fatcat:2pcr7p76qjbtnh36fuxsdk7enq

Wireless Sensor Network Security

An Liu, Mihui Kim, Leonardo B. Oliveira, Hailun Tan
2013 International Journal of Distributed Sensor Networks  
In [35] , Jakobsson et al. present an algorithm which allows a time-space trade-off.  ...  It also provides a taxonomy of solutions, and identifies trade-offs in these schemes to conclude that there is no one-size-fitsall solution.  ...  On the other hand, they present a considerable complexity, which results in a  ... 
doi:10.1155/2013/362385 fatcat:2ph46uukonbtbdkc5q6t4mvgcq
« Previous Showing results 1 — 15 out of 37 results