標(biāo)題: Titlebook: Information Security and Cryptology –ICISC 2020; 23rd International C Deukjo Hong Conference proceedings 2021 Springer Nature Switzerland A [打印本頁] 作者: 不要提吃飯 時(shí)間: 2025-3-21 19:29
書目名稱Information Security and Cryptology –ICISC 2020影響因子(影響力)
書目名稱Information Security and Cryptology –ICISC 2020影響因子(影響力)學(xué)科排名
書目名稱Information Security and Cryptology –ICISC 2020網(wǎng)絡(luò)公開度
書目名稱Information Security and Cryptology –ICISC 2020網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Information Security and Cryptology –ICISC 2020被引頻次
書目名稱Information Security and Cryptology –ICISC 2020被引頻次學(xué)科排名
書目名稱Information Security and Cryptology –ICISC 2020年度引用
書目名稱Information Security and Cryptology –ICISC 2020年度引用學(xué)科排名
書目名稱Information Security and Cryptology –ICISC 2020讀者反饋
書目名稱Information Security and Cryptology –ICISC 2020讀者反饋學(xué)科排名
作者: 懸崖 時(shí)間: 2025-3-21 22:29 作者: 某人 時(shí)間: 2025-3-22 04:08
Key Mismatch Attack on ThreeBears, Frodo and Round5secret key with probability of 100% and requires about . queries on average. Besides that, we use our technique to target other Round 2 candidates Frodo and Round5, and we improve the state-of-the-art results for them.作者: 口味 時(shí)間: 2025-3-22 06:19
A New Non-random Property of 4.5-Round PRINCEsure that the number of times that the difference of the resulting output pairs lie in a particular subspace is always a multiple of 8. Later, a detailed proof is given as why it has to exist. Relying on this property, a new distinguisher can be set up?to distinguish the 4.5-round PRINCE from a random permutation.作者: persistence 時(shí)間: 2025-3-22 10:23
Conference proceedings 2021 selected from 51 submissions. The aim of this conference was to provide an international forum for the latest results of research, development, and applications within the field of information security and cryptology..作者: delusion 時(shí)間: 2025-3-22 15:12 作者: Strength 時(shí)間: 2025-3-22 21:03 作者: albuminuria 時(shí)間: 2025-3-22 23:34
(Quantum) Cryptanalysis of Misty Schemes.. We then provide a security proof for Misty R schemes with 3 rounds against chosen plaintext attacks using the .. This shows that the best known non-quantum attack against Misty R schemes with 3 rounds is optimal.作者: 生氣的邊緣 時(shí)間: 2025-3-23 02:07 作者: Interstellar 時(shí)間: 2025-3-23 07:36 作者: acrobat 時(shí)間: 2025-3-23 09:46
Information Security and Cryptology –ICISC 2020978-3-030-68890-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 逢迎春日 時(shí)間: 2025-3-23 17:17
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/465390.jpg作者: 打包 時(shí)間: 2025-3-23 18:49 作者: 親密 時(shí)間: 2025-3-23 23:14
Security Definitions on Time-Lock Puzzlesunning in parallel time less than the pre-determined amount of time. In the previous works, the security of time-lock puzzles was formalized in an indistinguishability manner. However, it is unclear whether it directly meets the security requirements of time-lock puzzles. In this work, we define sem作者: degradation 時(shí)間: 2025-3-24 04:52
Secret Sharing with Statistical Privacy and Computational Relaxed Non-malleabilityl non-malleability for secret sharing. Subsequently, Brian, Faonio, and Venturi (CRYPTO ’19, TCC ’19) proposed computational variants of non-malleability for secret sharing and showed that by focusing on computational non-malleability, it is possible to construct more efficient schemes compared to t作者: Inkling 時(shí)間: 2025-3-24 06:47
(Quantum) Cryptanalysis of Misty Schemesst, we describe a non-adaptive quantum chosen plaintext attack (QCPA) against 4-round Misty L and Misty LKF schemes, and a QCPA against 3-round Misty R and Misty RKF schemes. We extend the QCPA attack against 3-round Misty RKF schemes to recover the keys of .-round Misty RKF schemes with complexity 作者: GIST 時(shí)間: 2025-3-24 13:26
An Efficient Authenticated Key Exchange from Random Self-reducibility on CSIDH Diffie–Hellman, they are vulnerable to the man-in-the-middle attack. A key exchange which is resistant to such an attack is called an authenticated key exchange (AKE), and many isogeny-based AKEs have been proposed. However, the parameter sizes of the existing schemes should be large since they all作者: Foregery 時(shí)間: 2025-3-24 17:29
A Sub-linear Lattice-Based Submatrix Commitment Schemey systems such as succinct non-interactive arguments of knowledge (SNARK), verifiable database, dynamic accumulators, etc. In this paper, we present a generalization of subvector commitment, ., which allows a commitment of a message matrix to be opened on multiple entries of the matrix simultaneousl作者: patriot 時(shí)間: 2025-3-24 21:07
: A Lightweight Block Cipher with Efficient Higher-Order Masking Software Implementationscted and unprotected environments, respectively.) supporting a 128 or 256-bit key. It is a byte-oriented and bitsliced cipher that offers excellent performance in 8-bit AVR software implementations. In particular, . allows for efficient higher-order masking implementations, since it uses a minimal n作者: Thrombolysis 時(shí)間: 2025-3-24 23:44 作者: 正面 時(shí)間: 2025-3-25 04:34
Efficient Implementation of SHA-3 Hash Function on 8-Bit AVR-Based Sensor Nodesmproved security compared to SHA-2, its low performance in software implementation limits its wide use. In this paper, we propose an optimized SHA-3 implementation on 8-bit AVR microcontrollers (MCU) which are dominantly used for sensor devices in WSNs. Until now, there are only a few researches on 作者: Physiatrist 時(shí)間: 2025-3-25 08:03
Can a Differential Attack Work for an Arbitrarily Large Number of Rounds?backdoors and hidden properties. There is substantial amount of research on how Boolean functions affect the security of ciphers, and comparatively, little research, on how block cipher wiring can be very special or abnormal. In this article we show a strong type of anomaly: where the complexity of 作者: 過濾 時(shí)間: 2025-3-25 12:26
Key Mismatch Attack on ThreeBears, Frodo and Round5n these attacks, the adversary has access to the key mismatch oracle which tells her if a given ciphertext decrypts to a given message under the targeted secret key. One of the so far non-targeted candidates is ThreeBears, which is a key encapsulation mechanism based on the integer module learning w作者: breadth 時(shí)間: 2025-3-25 17:54
A New Non-random Property of 4.5-Round PRINCEubspace attack. So far, two subspace trails that exist with probability 1 are known for 2.5 rounds of PRINCE. In this paper, we first describe a new non-random property for 4.5 rounds of PRINCE based on subspace trail with certain probability, which is independent of the secret key, the details of t作者: 首創(chuàng)精神 時(shí)間: 2025-3-25 20:16
Generative Adversarial Networks-Based Pseudo-Random Number Generator for Embedded Processorsed on generative adversarial networks (GAN). A recurrent neural network (RNN) layer is used to overcome the problems of predictability and reproducibility for long random sequences, which is found in the result of the NIST test suite for the previous method. The proposed design generates a random nu作者: 符合你規(guī)定 時(shí)間: 2025-3-26 03:50 作者: 突襲 時(shí)間: 2025-3-26 05:02
Hyunsu Mun,Soohyun Kim,Youngseok Lee, and Ian McHarg). The second thread groups the authors who dialogue with contemporary protagonists of the planning debate (including John Friedmann, Leonie Sandercock, Doreen Massey, David Harvey, Tom Sievert,978-3-030-93109-4978-3-030-93107-0Series ISSN 2365-757X Series E-ISSN 2365-7588 作者: Rustproof 時(shí)間: 2025-3-26 08:42
Daiki Hiraga,Keisuke Hara,Masayuki Tezuka,Yusuke Yoshida,Keisuke Tanaka作者: Obstacle 時(shí)間: 2025-3-26 16:29 作者: GENRE 時(shí)間: 2025-3-26 18:40 作者: REP 時(shí)間: 2025-3-27 00:46
Hangi Kim,Yongjin Jeon,Giyoon Kim,Jongsung Kim,Bo-Yeon Sim,Dong-Guk Han,Hwajeong Seo,Seonggyeom Kim,作者: Anticoagulant 時(shí)間: 2025-3-27 05:00
Hyunji Kim,Yongbeen Kwon,Minjoo Sim,Sejin Lim,Hwajeong Seo作者: PIZZA 時(shí)間: 2025-3-27 08:22 作者: 配置 時(shí)間: 2025-3-27 13:12 作者: AXIOM 時(shí)間: 2025-3-27 16:05 作者: Comedienne 時(shí)間: 2025-3-27 19:16
A Sub-linear Lattice-Based Submatrix Commitment Schemesize of our commitment scheme are both sublinear, i.e., proportional to the square root of the message size. As far as we know, this is the first public-coin-setup and post-quantum secure subvector commitment scheme.作者: compel 時(shí)間: 2025-3-27 22:41
: A Lightweight Block Cipher with Efficient Higher-Order Masking Software Implementations bitwise operations. Furthermore, its differential and linear branch numbers are both 3. This characteristic enables . to thwart differential and linear attacks with fewer rounds. The security of . has been scrutinized with regards to state-of-the-art cryptanalysis.作者: amphibian 時(shí)間: 2025-3-28 03:22
Curve448 on 32-Bit ARM Cortex-M4s 6,285,904 clock cycles. To the best of our knowledge, this is the first optimized implementation of Curve448 on 32-bit ARM Cortex-M4 microcontrollers. The result is also compared with other ECC and post-quantum cryptography (PQC) implementations. The proposed ECC and the-state-of-art PQC results s作者: 物質(zhì) 時(shí)間: 2025-3-28 07:49
Efficient Implementation of SHA-3 Hash Function on 8-Bit AVR-Based Sensor Nodesncurs heavy memory accesses during computation. Thus, we analyzed the structure of SHA-3 algorithm and found that each lane of the internal state can be executed independently for each process in SHA-3. By using this fact, we propose an optimization method which can reduce efficiently the times of m作者: Spinal-Tap 時(shí)間: 2025-3-28 13:08
Generative Adversarial Networks-Based Pseudo-Random Number Generator for Embedded Processorss about 6.25x compared to the speed of other lightweight PRNG. To the best of our knowledge, this is the first GAN based PRNG for embedded processors. Finally, generated random numbers were tested through the NIST random number test suite. Compared with the previous method, the proposed method reduc作者: Bone-Scan 時(shí)間: 2025-3-28 14:41
A RDBMS-Based Bitcoin Analysis Method experiments, we demonstrate that RDBMS queries are useful to perform analysis of Bitcoin transaction, cluster and graph. In addition, we show that the indexed SQLite3 database provides quick response time and the extensible Bitcoin storage. This study contributes to a method of analyzing Bitcoin bl作者: 演講 時(shí)間: 2025-3-28 21:33 作者: 紡織品 時(shí)間: 2025-3-29 02:00
Kewen Wang,Yu Wu,Jiawei Tiann bzw. Regler dem Benutzer erm?glicht wird. In diesem Abschnitt sollen dem Leser anhand von zwei Beispielen nahegebracht werden, wie diese Optionen sinnvoll eingesetzt werden k?nnen und bisher eingesetzt worden sind. Zur dahinterliegenden Konzeption sei der Leser jedoch auf Abschnitt 5. in Teil I ve作者: Frequency-Range 時(shí)間: 2025-3-29 05:33 作者: 一瞥 時(shí)間: 2025-3-29 09:56 作者: COMMA 時(shí)間: 2025-3-29 14:27
men met collega‘s zult behandelen. Zo leer je hoe zij omgaan met een bepaalde problematiek en hoe je beter kunt samenwerken. Door het uitvoeren van de actiepunten die je tijdens het programma opstelt, kun je ervoor zorgen dat alles voortaan meer naar je zin verloopt..Het idee voor dit boek is ontstaan tijdens978-90-313-6341-4978-90-313-7577-6作者: organic-matrix 時(shí)間: 2025-3-29 18:37 作者: 向外才掩飾 時(shí)間: 2025-3-29 22:28
