Results 71 to 80 of about 37,018 (310)
Improved Preimage Attacks on 4-Round Keccak-224/256
IACR Transactions on Symmetric Cryptology, 2021 This paper provides an improved preimage attack method on standard 4-round Keccak-224/256. The method is based on the work pioneered by Li and Sun, who design a linear structure of 2-round Keccak-224/256 with 194 degrees of freedom left.
Le He, Xiaoen Lin, Hongbo Yu
doaj +1 more source
Classification of the SHA-3 Candidates
, 2009 In this note we give an overview on the current state of the SHA-3 candidates. First, we classify all publicly known candidates and, second, we outline and summarize the performance data as given in the candidates documentation for $64$-bit and $32$-bit implementations. We define performance classes and classify the hash algorithms.
Fleischmann, Ewan +2 more
openaire +3 more sources
Distributed Random Process for a Large-Scale Peer-to-Peer Lottery [PDF]
, 2017 Most online lotteries today fail to ensure the verifiability of the random process and rely on a trusted third party. This issue has received little attention since the emergence of distributed protocols like Bitcoin that demonstrated the potential of ...
J Zhou +7 more
core +4 more sources
Advanced Science, EarlyView.In this study, scRNA‐seq and chemoproteomics are integrated to characterize CDDP‐bound proteins at single‐cell resolution in tumor‐bearing mice. Additionally, the research demonstrates that ICA alleviates CDDP‐induced nephrotoxicity while enhancing its chemotherapeutic efficacy.
Piao Luo +19 more
wiley +1 more source
Optimization of preimage resistance on SHA-3 algorithm(SHA-3算法的抗原象攻击性能优化)
Zhejiang Daxue xuebao. Lixue ban, 2016 通过对SHA-3算法置换函数Keccak-f的线性性质以及缩减轮数的Keccak杂凑函数原象攻击的研究，提出了 SHA-3算法的抗原象攻击性能优化设计方案.首先结合Keccak杂凑函数的差分特点和θ置换函数的奇偶性质，分析了基于CP-kernel的SHA-3算法原象攻击；然后针对目前实施原象攻击的方法，在θ置换函数运算后异或随机数以打乱其汉明重量，改变CP-kernel的校验性质，阻止攻击者利用中间相遇的方法寻找原象，提高了 SHA-3 算法的抗原象攻击能力；最后利用VHDL硬件语言实现抗原象攻击SHA-
LIJianrui(李建瑞) +2 more
doaj +1 more source
Preimage Attacks on the Round-reduced Keccak with Cross-linear Structures
IACR Transactions on Symmetric Cryptology, 2017 In this paper, based on the work pioneered by Aumasson and Meier, Dinur et al., and Guo et al., we construct some new delicate structures from the roundreduced versions of Keccakhash function family. The new constructed structures are called cross-linear
Ting Li +3 more
doaj +1 more source
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3 [PDF]
, 2016 We investigate the cost of Grover's quantum search algorithm when used in the context of pre-image attacks on the SHA-2 and SHA-3 families of hash functions.
Amy, Matthew +5 more
core +1 more source
JaxNet: Scalable Blockchain Network [PDF]
, 2020 Today's world is organized based on merit and value. A single global currency that's decentralized is needed for a global economy. Bitcoin is a partial solution to this need, however it suffers from scalability problems which prevent it from being mass ...
Emelyanenko, Taras +3 more
core +1 more source
Delegating Quantum Computation in the Quantum Random Oracle Model
, 2020 A delegation scheme allows a computationally weak client to use a server's resources to help it evaluate a complex circuit without leaking any information about the input (other than its length) to the server.
A Broadbent +17 more
core +1 more source
Advanced Science, EarlyView.This paper presents a programmable metasurface‐based Meta Key Distribution (MKD) system for secure, protocol‐independent key exchange in indoor wireless settings. By embedding entropy into the wireless channel, it enables lightweight, compatible cryptographic key generation.
Xinyu Li +7 more
wiley +1 more source