lumbar-puncture
发表于 2025-3-21 17:07:07
书目名称Information Security and Privacy影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0465399<br><br> <br><br>书目名称Information Security and Privacy影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0465399<br><br> <br><br>书目名称Information Security and Privacy网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0465399<br><br> <br><br>书目名称Information Security and Privacy网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0465399<br><br> <br><br>书目名称Information Security and Privacy被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0465399<br><br> <br><br>书目名称Information Security and Privacy被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0465399<br><br> <br><br>书目名称Information Security and Privacy年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0465399<br><br> <br><br>书目名称Information Security and Privacy年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0465399<br><br> <br><br>书目名称Information Security and Privacy读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0465399<br><br> <br><br>书目名称Information Security and Privacy读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0465399<br><br> <br><br>
小卒
发表于 2025-3-21 21:24:00
Membership Encryption and Its Applicationsountability on attributes. Using our scheme, the proposed oblivious transfer protocol exhibits the nice feature of .(1) communication cost for any . from receiver to sender, and .(.) communication cost from sender to receiver.
Endemic
发表于 2025-3-22 01:01:43
Security Proofs for Hash Tree Time-Stamping Using Hash Functions with Small Output Sizeinear-preserving security reduction under the Pre-Image Awareness (PrA) assumption. We present a new slightly stronger assumption SPrA that leads to much tighter proofs. We also show that bounds on . are necessary—based on any PrA/SPrA function, we construct a PrA/SPrA function that is insecure for unbounded time-stamping.
FADE
发表于 2025-3-22 07:30:58
Analysing the IOBC Authenticated Encryption Modeques. In this paper we cryptanalyse a block cipher mode of operation called IOBC, possibly the only remaining encryption mode designed for such use that has not previously been analyzed. We show that IOBC is subject to known-plaintext-based forgery attacks with a complexity of around 2., where . is the block cipher block length.
万花筒
发表于 2025-3-22 09:28:08
Expressive Cryptography: Lattice Perspectivesat was related to but distinct from the “private key” that, alone, embodied the ability to decrypt. This made large-scale encryption a practical and scalable endeavour, and more than anything else—save the internet itself—led to the advent of electronic commerce as we know and practice it today.
宽敞
发表于 2025-3-22 16:12:56
A Chosen IV Related Key Attack on Grain-128ally determined constant and it is sufficient to estimate it as 2.) related Keys and .·2. chosen IVs, it is possible to obtain 32·. simple nonlinear equations and solve them to recover the Secret Key in Grain-128a.
JUST
发表于 2025-3-22 18:47:22
Minkowski Sum Based Lattice Construction for Multivariate Simultaneous Coppersmith’s Technique and Acan factor the modulus if . − ./2 + 1/4 < (3ℓ − 1)(3ℓ + 1), where . and . are bit-lengths / log. of the secret exponent and its exposed LSBs, respectively. Due to the spacing limit, some arguments are omitted; see the full-version .
HILAR
发表于 2025-3-22 22:25:27
Adaptive Precision Floating Point LLLndle the precision, where the precision is adaptive during the procedure. Although this optimization does not change the worst-case complexity, it reduces the average-case complexity by a constant factor. In practice, we observe an average 20% acceleration in our implementation.
违抗
发表于 2025-3-23 04:50:19
Related-Key Boomerang Attacks on KATAN32/48/64ion. As a result, we can attack 174, 145 and 130 rounds of KATAN32, KATAN48 and KATAN64, which substantially improve the known best results whose attacked rounds are 120, 103, 94 rounds, respectively. Our attacks are confirmed by various experimental verifications, especially, we give concrete right quartets for KATAN32.
花束
发表于 2025-3-23 07:23:31
Improved Boomerang Attacks on SM3ps out of 64 steps, with time complexities 2., 2., 2. and 2. compression function calls respectively. Especially, we are able to obtain the examples of the distinguishers on 34-step and 35-step on a PC due to their practical complexities. In addition, incompatible problems in the recent boomerang attack are pointed out.