Results 1 to 10 of about 42,032 (196)
Effect of the difference enumeration attack on LowMC instances
网络与信息安全学报, 2021 The LowMC is an algorithm with low multiplicative complexities. For the parameter with limited data complexities and low number of S-boxes, the difference enumeration attack was proposed, which could theoretically attack all rounds of the LowMC ...
GE Xinxin, WANG Meiqin, HU Kai +1 more
doaj +5 more sources
Improved Attacks on LowMC with Algebraic Techniques
IACR Transactions on Symmetric Cryptology, 2023 The LowMC family of SPN block cipher proposed by Albrecht et al. was designed specifically for MPC-/FHE-/ZKP-friendly use cases. It is especially used as the underlying block cipher of PICNIC, one of the alternate third-round candidate digital signature
Yimeng Sun, Jiamin Cui, Meiqin Wang
doaj +1 more source
Improved meet‐in‐the‐middle attacks on reduced‐round Joltik‐BC
IET Information Security, 2021 Joltik‐BC is an internal tweakable block cipher of the authenticated encryption algorithm Joltik, which was a second‐round finalist in the CAESAR competition.
Manman Li, Shaozhen Chen
doaj +1 more source
Cryptanalysis of Low-Data Instances of Full LowMCv2
IACR Transactions on Symmetric Cryptology, 2018 LowMC is a family of block ciphers designed for a low multiplicative complexity. The specification allows a large variety of instantiations, differing in block size, key size, number of S-boxes applied per round and allowed data complexity. The number of
Christian Rechberger +2 more
doaj +1 more source
Analysis of Software Countermeasures for Whitebox Encryption
IACR Transactions on Symmetric Cryptology, 2017 Whitebox cryptography aims to ensure the security of cryptographic algorithms in the whitebox model where the adversary has full access to the execution environment.
Subhadeep Banik +3 more
doaj +1 more source
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search [PDF]
, 2013 By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehl\'{e}, we obtain improved asymptotic quantum results for solving the shortest vector problem.
A. Ambainis +39 more
core +2 more sources
The N-K Problem in Power Grids: New Models, Formulations and Numerical Experiments (extended version) [PDF]
, 2008 Given a power grid modeled by a network together with equations describing the power flows, power generation and consumption, and the laws of physics, the so-called N-k problem asks whether there exists a set of k or fewer arcs whose removal will cause ...
Bienstock, Daniel, Verma, Abhinav
core +3 more sources
, 2020 This paper presents a computational approach to evaluate the resilience of electricity Distribution Networks (DNs) to cyber-physical failures. In our model, we consider an attacker who targets multiple DN components to maximize the loss of the DN ...
Amin, Saurabh +2 more
core +1 more source
Enumeration of spanning trees in a pseudofractal scale-free web
, 2010 Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical challenge.
Liu, Hongxiao +3 more
core +1 more source
A methodology for testing virtualisation security [PDF]
, 2017 There is a growing interest in virtualisation due to its central role in cloud computing, virtual desktop environments and Green IT. Data centres and cloud computing utilise this technology to run multiple operating systems on one physical server, thus ...
Coull, Natalie +2 more
core +2 more sources