標(biāo)題: Titlebook: Information Security and Cryptology – ICISC 2019; 22nd International C Jae Hong Seo Conference proceedings 2020 Springer Nature Switzerland [打印本頁] 作者: Lactase 時間: 2025-3-21 16:45
書目名稱Information Security and Cryptology – ICISC 2019影響因子(影響力)
書目名稱Information Security and Cryptology – ICISC 2019影響因子(影響力)學(xué)科排名
書目名稱Information Security and Cryptology – ICISC 2019網(wǎng)絡(luò)公開度
書目名稱Information Security and Cryptology – ICISC 2019網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Information Security and Cryptology – ICISC 2019被引頻次
書目名稱Information Security and Cryptology – ICISC 2019被引頻次學(xué)科排名
書目名稱Information Security and Cryptology – ICISC 2019年度引用
書目名稱Information Security and Cryptology – ICISC 2019年度引用學(xué)科排名
書目名稱Information Security and Cryptology – ICISC 2019讀者反饋
書目名稱Information Security and Cryptology – ICISC 2019讀者反饋學(xué)科排名
作者: 橫截,橫斷 時間: 2025-3-21 22:14
Systematic Construction of Nonlinear Product Attacks on Block Ciphers,ved for SCREAM, Midori64, MANTIS-4, T-310 or for DES with modified S-boxes. Until now such attacks are hard to find and seem to happen by some sort of incredible coincidence. In this paper we abstract the attack from any particular block cipher. We study these attacks in terms of transformations on 作者: Ostrich 時間: 2025-3-22 03:25 作者: invade 時間: 2025-3-22 07:52
,All the HIGHT You Need on Cortex–M4,parallelism and task parallelism to reduce the execution timing. In particular, we used the 32-bit wise ARM–SIMD instruction sets to perform the parallel computations in efficient way. Since the HIGHT block cipher is constructed upon 8-bit word, four 8-bit operations are performed in the 32-bit wise作者: exacerbate 時間: 2025-3-22 12:04
Fast AES Implementation Using ARMv8 ASIMD Without Cryptography Extension, discretion of the CPU manufacturer. Prime examples of ARMv8 devices without this support are the low cost Raspberry Pi 3B/3B+/4 single board computers. This work presents an optimized AES implementation targeting CPUs without Cryptography Extension instructions, relying only on ASIMD operations. We作者: 鄙視 時間: 2025-3-22 16:40
,FACE–LIGHT: Fast AES–CTR Mode Encryption for Low-End Microcontrollers,llers, namely FACE–LIGHT. We targeted the 32-bit counter mode of operation for AES in constant timing. This optimized technique pre-computes the 2 Add-RoundKey, 2 Sub-Bytes, 2 Shift-Rows and 1 Mix-Columns operations. The FACE–LIGHT is implemented on the representative low-end microcontrollers (e.g. 作者: figment 時間: 2025-3-22 17:45
Sum It Up: Verifiable Additive Homomorphic Secret Sharing, in order to provide useful results. Often clients want to guarantee that the results are . and thus, an output that can be . verified is required. However, important security and privacy challenges are raised, since clients may hold sensitive information and the cloud servers can be untrusted. Our 作者: Bravura 時間: 2025-3-22 22:10 作者: Accede 時間: 2025-3-23 01:50
An Automated Security Analysis Framework and Implementation for MTD Techniques on Cloud, migrate their services to the cloud to utilize the benefit of cloud computing such as eliminating the capital expense of their computing need. There are security vulnerabilities and threats in the cloud. Many researches have been proposed to analyze the cloud security using Graphical Security Model作者: impale 時間: 2025-3-23 07:30 作者: noxious 時間: 2025-3-23 11:47
Secure Key Encapsulation Mechanism with Compact Ciphertext and Public Key from Generalized Srivastaey encapsulation mechanism (KEM) using a parity check matrix of the Generalized Srivastava code as the public key matrix. Generalized Srivastava codes are privileged with the decoding technique of Alternant codes as they belong to the family of Alternant codes. We exploit the dyadic structure of the作者: white-matter 時間: 2025-3-23 14:28
Improvement of Binary and Non Binary Statistical Decoding Algorithm,e derived from the Information-Set Decoding (ISD) algorithm. This was first proposed in 1962 by Prange and subsequently improved in 1989 by Stern and later in 1991 by Dumer. In 2001 Al Jabri introduced a new decoding algorithm for general linear block codes which does not belong to this family, call作者: 一個姐姐 時間: 2025-3-23 20:52 作者: Invigorate 時間: 2025-3-24 00:29 作者: Proponent 時間: 2025-3-24 05:48
Faster Bootstrapping of FHE over the Integers,(Eurocrypt 2010), so that bootstrapping can be achieved successfully. Later, Nuida and Kurowasa (Eurocrypt 2015) proposed an advanced method of which the degree is very low and the message space is non-binary. These previous methods require low degree but more than . homomorphic multiplications whic作者: LINES 時間: 2025-3-24 07:03
Complete Addition Law for Montgomery Curves,ve derived from the chord-tangent method is less efficient than other curve models such as a short Weierstrass curve and an Edwards curve. So, the usage of a Montgomery curve is strictly limited to ECDH only, such as . and . functions in IETF RFC 7748. For other operations including fixed-base and m作者: 窩轉(zhuǎn)脊椎動物 時間: 2025-3-24 11:19 作者: RODE 時間: 2025-3-24 16:00 作者: NOMAD 時間: 2025-3-24 20:52 作者: gentle 時間: 2025-3-25 00:29
Kento Oonishi,Xiaoxuan Huang,Noboru Kunihirotical phenomena.Relevant to quantum magnetism, disordered sy.When close to a continuous phase transition, many physical systems can usefully be mapped to ensembles of fluctuating loops, which might represent for example polymer rings, or line defects in a lattice magnet, or worldlines of quantum par作者: MAPLE 時間: 2025-3-25 03:35 作者: sultry 時間: 2025-3-25 10:53
m previously introduced in Chap. 2. The RG analysis, introduced in field theory and in critical phase transitions, is a very general mathematical (and conceptual) tool, which allows one to decompose the problem of finding the “macroscopic” behavior of a large number of interacting parts into a succe作者: transdermal 時間: 2025-3-25 13:11 作者: 蘑菇 時間: 2025-3-25 18:36
978-3-030-40920-3Springer Nature Switzerland AG 2020作者: 最小 時間: 2025-3-25 22:28 作者: Glutinous 時間: 2025-3-26 02:44
https://doi.org/10.1007/978-3-030-40921-0artificial intelligence; authentication; authentication; cryptography; data mining; data privacy; electron作者: 拋棄的貨物 時間: 2025-3-26 05:11
Kenneth Koon-Ho Wong,Harry Bartlett,Leonie Simpson,Ed Dawsonck of spins that one analyzes within the system. The usefulness of the RG approach is based on the existence of scale invariance and self-similarity of the observables at the critical point. The purpose of the RG is to translate in mathematical language the concept that a critical point results from作者: 歪曲道理 時間: 2025-3-26 11:21 作者: Indolent 時間: 2025-3-26 13:49
Revised Version of Block Cipher , hardware implementations, the revised . is still excellent in lightweight hardware implementations. In software, the revised . is still comparable to SPECK, one of the top-ranked algorithms in software.作者: 條街道往前推 時間: 2025-3-26 16:50
Systematic Construction of Nonlinear Product Attacks on Block Ciphers,r any number of rounds. A major difficulty with invariant attacks is that they typically work only for some keys. In T-310 our attack works for any key and also in spite of the presence of round constants.作者: 諂媚于性 時間: 2025-3-27 00:08
Sum It Up: Verifiable Additive Homomorphic Secret Sharing,ving .. More precisely, we employ: . homomorphic collision-resistant hash functions; . linear homomorphic signatures; as well as . a threshold RSA signature scheme. In all three cases we provide a detailed correctness, security and verifiability analysis and discuss their efficiency.作者: Flawless 時間: 2025-3-27 01:20 作者: 染色體 時間: 2025-3-27 09:05
An Automated Security Analysis Framework and Implementation for MTD Techniques on Cloud,vious framework and designed, implemented and tested a cloud security assessment tool in a real cloud platform named UniteCloud. Our security solution can (1) monitor cloud computing in real-time, (2) automate the security modeling and analysis and visualize the GSMs using a Graphical User Interface作者: 護(hù)身符 時間: 2025-3-27 09:47
Faster Bootstrapping of FHE over the Integers,the scale-invariant FHE over the integers called CLT scheme, it takes 6?s for 500-bit message space and 80-bit security on a desktop. We also apply our bootstrapping method to the homomorphic evaluation of AES-128 circuit: It takes about 8?s per 128-bit block and is faster than the previous results 作者: Ejaculate 時間: 2025-3-27 14:18
Complete Addition Law for Montgomery Curves, expense of additional storage for the two curve parameters and for the conversion between them. However, smart devices in IoT environments that mainly operate ECDH (for example, . mode of IETF RFC 7250) do not need to implement such a conversion if a complete addition law does exist for the Montgom作者: Adherent 時間: 2025-3-27 19:43 作者: 現(xiàn)存 時間: 2025-3-28 02:00
Dongyoung Roh,Bonwook Koo,Younghoon Jung,Il Woong Jeong,Dong-Geon Lee,Daesung Kwon,Woo-Hwan Kim作者: THE 時間: 2025-3-28 04:46 作者: gruelling 時間: 2025-3-28 10:01 作者: semiskilled 時間: 2025-3-28 11:33
Máté Horváth,Levente Buttyán,Gábor Székely,Dóra Neubrandt作者: 蜿蜒而流 時間: 2025-3-28 18:39
Hooman Alavizadeh,Hootan Alavizadeh,Dong Seong Kim,Julian Jang-Jaccard,Masood Niazi Torshiz作者: 改變 時間: 2025-3-28 22:16
Pierre-Louis Cayrel,Cheikh Thiécoumba Gueye,Junaid Ahmad Khan,Jean Belo Klamti,Edoardo Persichetti作者: 鳴叫 時間: 2025-3-29 02:49 作者: intrude 時間: 2025-3-29 06:12 作者: 僵硬 時間: 2025-3-29 07:53 作者: 調(diào)味品 時間: 2025-3-29 14:29 作者: Precursor 時間: 2025-3-29 18:13
Differential Random Fault Attacks on Certain CAESAR Stream Ciphers,uding the AEGIS variants, Tiaoxin and the MORUS family. Attack outcomes range from key or full state recovery for Tiaoxin, to full state recovery for the AEGIS family and partial state recovery for MORUS. We present attack requirements and success probabilities on these ciphers, along with design considerations to mitigate against this attack.作者: Constant 時間: 2025-3-29 22:13 作者: 阻礙 時間: 2025-3-30 03:12 作者: 鞠躬 時間: 2025-3-30 06:40 作者: Angioplasty 時間: 2025-3-30 08:17
,FACE–LIGHT: Fast AES–CTR Mode Encryption for Low-End Microcontrollers, This is faster than previous works by 22?% for 128-bit security level. The FACE–LIGHT can be used to extend the FACE to round 3. The AES is also implemented to be secure against the CPA (Correlation Power Analysis).作者: 縮影 時間: 2025-3-30 13:00
Secure Key Encapsulation Mechanism with Compact Ciphertext and Public Key from Generalized Srivastaet al. in Journal of Mathematical Cryptology which also uses Generalized Srivastava code. Our KEM provides IND-CCA security in the random oracle model. Also, our scheme can be shown to achieve post-quantum security in the quantum random oracle model.作者: 職業(yè) 時間: 2025-3-30 18:14 作者: right-atrium 時間: 2025-3-30 22:29
LizarMong: Excellent Key Encapsulation Mechanism Based on RLWE and RLWR,e-of-the-art studies. As a result, it achieves up?to 85% smaller bandwidth and 3.3 times faster performance compared to RLizard. Compared to the NIST’s candidate algorithms with a similar security, the bandwidth is about 5–42% smaller, and the performance is about 1.2-4.1 times faster. Also, our scheme resists the known side-channel attacks.作者: 北京人起源 時間: 2025-3-31 04:00
Efficient Identity-Based Encryption from LWR, MP12 trapdoor sampling algorithms with an implementation result. With our proposed parameter sets, the ciphertext sizes can be reduced in a large extent compared to the ABB scheme with the same security level.作者: Seminar 時間: 2025-3-31 07:17 作者: 向前變橢圓 時間: 2025-3-31 10:04
Security Analysis of Group Action Inverse Problem with Auxiliary Inputs with Application to CSIDH Pntly less than ...Applying the idea to CSIDH-512 parameters, we show that, if an additional isogenous curve . is given, the security level of this cryptosystem reduces to 68-bit security instead of 128-bit security as originally believed.作者: Rebate 時間: 2025-3-31 16:31
0302-9743 post-quantum cryptography; secret sharing and searchable encryption; storage security and information retrieval; and attacks and software security..978-3-030-40920-3978-3-030-40921-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Fabric 時間: 2025-3-31 21:34
Conference proceedings 2020l, South Korea, in December 2019...The total of 18 papers presented in this volume were carefully reviewed and selected from 43 submissions. The papers were organized in topical sections named: public-key encryption and implementation; homomorphic encryption; secure multiparty computation; post-quan
