標(biāo)題: Titlebook: Cryptographic Hardware and Embedded Systems - CHES 2009; 11th International W Christophe Clavier,Kris Gaj Conference proceedings 2009 ? Int [打印本頁] 作者: FERN 時(shí)間: 2025-3-21 19:40
書目名稱Cryptographic Hardware and Embedded Systems - CHES 2009影響因子(影響力)
書目名稱Cryptographic Hardware and Embedded Systems - CHES 2009影響因子(影響力)學(xué)科排名
書目名稱Cryptographic Hardware and Embedded Systems - CHES 2009網(wǎng)絡(luò)公開度
書目名稱Cryptographic Hardware and Embedded Systems - CHES 2009網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Cryptographic Hardware and Embedded Systems - CHES 2009被引頻次
書目名稱Cryptographic Hardware and Embedded Systems - CHES 2009被引頻次學(xué)科排名
書目名稱Cryptographic Hardware and Embedded Systems - CHES 2009年度引用
書目名稱Cryptographic Hardware and Embedded Systems - CHES 2009年度引用學(xué)科排名
書目名稱Cryptographic Hardware and Embedded Systems - CHES 2009讀者反饋
書目名稱Cryptographic Hardware and Embedded Systems - CHES 2009讀者反饋學(xué)科排名
作者: cancellous-bone 時(shí)間: 2025-3-21 20:50 作者: 污點(diǎn) 時(shí)間: 2025-3-22 04:18 作者: Accrue 時(shí)間: 2025-3-22 07:13
A Design Methodology for a DPA-Resistant Cryptographic LSI with RSL Techniques traces, we confirmed that the RSL-AES circuit has very high DPA and CPA resistance thanks to the contributions of both the masking function and the glitch suppressing function. This is the first result demonstrating reduction of the side-channel leakage by glitch suppression quantitatively on real ASIC.作者: nepotism 時(shí)間: 2025-3-22 11:25
0302-9743 shop was sponsored by the International Association for Cryptologic Research (IACR). The workshop attracted a record number of 148 submissions from 29 co- tries, of which the Program Committee selected 29 for publication in the wo- shop proceedings, resulting in an acceptance rate of 19.6%, the low作者: 載貨清單 時(shí)間: 2025-3-22 14:54
Christopher G. Haswell,Jonathan Shachterng with the existing ones on an 8-bit platform and mount practical side-channel attacks against the implementations. We show that the new method is significantly more secure in practice than the previously published solutions and also more lightweight.作者: 載貨清單 時(shí)間: 2025-3-22 18:21 作者: induct 時(shí)間: 2025-3-22 22:16 作者: Ophthalmologist 時(shí)間: 2025-3-23 03:37 作者: 放逐 時(shí)間: 2025-3-23 08:24 作者: 閃光你我 時(shí)間: 2025-3-23 13:36
Characteristics of Flood Disastersto the required storage of its large keys. To the best of our knowledge, this is the first time that the McEliece encryption scheme is implemented on a low-cost 8-bit AVR microprocessor and a Xilinx Spartan-3AN FPGA.作者: Alopecia-Areata 時(shí)間: 2025-3-23 15:47 作者: 彩色的蠟筆 時(shí)間: 2025-3-23 18:20
Faster and Timing-Attack Resistant AES-GCMnter mode authentication, achieving 10.68 cycles/byte for authenticated encryption. Furthermore, we present the first constant-time implementation of AES-GCM that has a reasonable speed of 21.99 cycles/byte, thus offering a full suite of timing-analysis resistant software for authenticated encryption.作者: graphy 時(shí)間: 2025-3-23 23:37 作者: Cardioplegia 時(shí)間: 2025-3-24 04:00
Practical Electromagnetic Template Attack on HMACon embedded devices..We have performed experiments using a NIOS processor executed on a Field Programmable Gate Array (FPGA) to confirm the leakage model. We hope that our results shed some light on the requirements in term of side channel attack for the future SHA-3 function.作者: 逃避責(zé)任 時(shí)間: 2025-3-24 06:55
An Efficient Method for Random Delay Generation in Embedded Softwareng with the existing ones on an 8-bit platform and mount practical side-channel attacks against the implementations. We show that the new method is significantly more secure in practice than the previously published solutions and also more lightweight.作者: Counteract 時(shí)間: 2025-3-24 12:47 作者: forebear 時(shí)間: 2025-3-24 17:50 作者: exceptional 時(shí)間: 2025-3-24 20:56 作者: glowing 時(shí)間: 2025-3-25 00:21
Conference proceedings 2009sponsored by the International Association for Cryptologic Research (IACR). The workshop attracted a record number of 148 submissions from 29 co- tries, of which the Program Committee selected 29 for publication in the wo- shop proceedings, resulting in an acceptance rate of 19.6%, the lowest in the作者: calumniate 時(shí)間: 2025-3-25 06:55 作者: 證實(shí) 時(shí)間: 2025-3-25 07:43
SSE Implementation of Multivariate PKCs on Modern x86 CPUssized systems over .. Here a key advance is in using Wiedemann (as opposed to Gauss) solvers to invert the small linear systems in the central maps. We explain the techniques and design choices in implementing our chosen MPKC instances over fields such as ., . and .. We believe that our results can 作者: Complement 時(shí)間: 2025-3-25 12:08
Physical Unclonable Functions and Secure Processorss, and the production of certificates that guarantee that a particular piece of software was executed on a trusted chip..We present the design and implementation of two PUF-enabled devices that have been built: a low-cost secure RFID that can be used in anti-counterfeiting and other authentication a作者: VICT 時(shí)間: 2025-3-25 18:45 作者: opprobrious 時(shí)間: 2025-3-25 22:15 作者: pericardium 時(shí)間: 2025-3-26 03:28 作者: fodlder 時(shí)間: 2025-3-26 08:00
A Design Flow and Evaluation Framework for DPA-Resistant Instruction Set Extensionsween protected and unprotected logic. This experiment illustrates the tradeoff between the type and amount of application-level functionality implemented in protected logic and the level of security achieved by the design. Our design approach and evaluation tools are generic and could be used to par作者: 預(yù)測 時(shí)間: 2025-3-26 09:38 作者: 報(bào)復(fù) 時(shí)間: 2025-3-26 15:43 作者: tackle 時(shí)間: 2025-3-26 18:11 作者: 無效 時(shí)間: 2025-3-26 23:21 作者: commodity 時(shí)間: 2025-3-27 03:00 作者: 序曲 時(shí)間: 2025-3-27 07:31
Characteristics of Paddy Fieldss, and the production of certificates that guarantee that a particular piece of software was executed on a trusted chip..We present the design and implementation of two PUF-enabled devices that have been built: a low-cost secure RFID that can be used in anti-counterfeiting and other authentication a作者: 出價(jià) 時(shí)間: 2025-3-27 12:00 作者: 值得贊賞 時(shí)間: 2025-3-27 15:25
William Michael Lake,I-Hsien Leeents filtered from app. 7000. Once the secret key used by the passport during AA is available to the attacker, he can create a fully functional copy of the RFID chip in the passport he observes..A possible way to obtain the side information needed for the attack within the electromagnetic traces is 作者: 富饒 時(shí)間: 2025-3-27 17:46 作者: Terrace 時(shí)間: 2025-3-28 00:45 作者: 驚呼 時(shí)間: 2025-3-28 02:16
Nicky Le Feuvre,Eric Davoine,Flavia Cangiàis task. An improved exponentiation algorithm allows us to save hardware resources..According to our place-and-route results on Xilinx FPGAs, our design improves both the computation time and the area-time trade-off compared to previoulsy published coprocessors.作者: arbovirus 時(shí)間: 2025-3-28 07:38
Vulnerabilities in Local Contextsn of the Optimal-Ate pairing over a 256-bit BN curve at 338 MHz implemented with a 130?nm standard cell library. The processor core consumes 97?kGates making it suitable for the use in embedded systems.作者: 秘傳 時(shí)間: 2025-3-28 14:04
Faster and Timing-Attack Resistant AES-GCM to 25% faster than previous implementations, while simultaneously offering protection against timing attacks. In particular, it is the only cache-timing-attack resistant implementation offering competitive speeds for stream as well as for packet encryption: for 576-byte packets, we improve performa作者: milligram 時(shí)間: 2025-3-28 17:10 作者: Euphonious 時(shí)間: 2025-3-28 20:02
SSE Implementation of Multivariate PKCs on Modern x86 CPUspared to “traditional” alternatives. However, this advantage seems to erode with the increase of arithmetic resources in modern CPUs and improved algorithms, especially with respect to Elliptic Curve Cryptography (ECC). In this paper, we show that . Modern commodity CPUs also have many small integer作者: 橡子 時(shí)間: 2025-3-29 00:50 作者: Abduct 時(shí)間: 2025-3-29 07:08
Physical Unclonable Functions and Secure Processorsed and unsupervised. On the other hand, the cost of security breaches is increasing as we place more responsibility on the devices that surround us. The result of these trends is that physical attacks present an increasing risk that must be dealt with..Physical Unclonable Functions (PUFs) are a tamp作者: 允許 時(shí)間: 2025-3-29 08:06
Practical Electromagnetic Template Attack on HMACistance of some registers. After a . in which the adversary has access to a device and can configure it, the attack recovers the secret key by monitoring a . of HMAC-SHA-1. The secret key can be recovered using a “template attack” with a computation of about 2. 3. compression functions, where . is t作者: Alcove 時(shí)間: 2025-3-29 15:16
First-Order Side-Channel Attacks on the Permutation Tables Countermeasureng that during the execution of an algorithm, each intermediate variable that is handled is in a permuted form described by the random permutation tables. In this paper, we examine the application of this countermeasure to the AES algorithm as described in [5], and show that certain operations admit作者: Ointment 時(shí)間: 2025-3-29 18:04 作者: 首創(chuàng)精神 時(shí)間: 2025-3-29 20:18 作者: 本能 時(shí)間: 2025-3-30 01:26 作者: PANT 時(shí)間: 2025-3-30 06:26
A New Side-Channel Attack on RSA Prime Generationion that allows to determine the number of the trial divisions for each prime candidate. Practical experiments are conducted, and countermeasures are proposed. For realistic parameters the success probability of our attack is in the order of 10–15?%.作者: 山間窄路 時(shí)間: 2025-3-30 11:51
An Efficient Method for Random Delay Generation in Embedded Softwaremethod for generation of random delays and a criterion for measuring the efficiency of a random delay countermeasure. We implement this new method along with the existing ones on an 8-bit platform and mount practical side-channel attacks against the implementations. We show that the new method is si作者: 移植 時(shí)間: 2025-3-30 12:56
Higher-Order Masking and Shuffling for Software Implementations of Block Cipherswo main techniques are usually applied to thwart them: masking and operations shuffling. To benefit from the advantages of the two techniques, recent works have proposed to combine them. However, the schemes which have been designed until now only provide limited resistance levels and some advanced 作者: certain 時(shí)間: 2025-3-30 18:32
A Design Methodology for a DPA-Resistant Cryptographic LSI with RSL Techniquesaphic hardware modules. The original RSL proposed in 2004 requires a unique RSL-gate for random data masking and glitch suppression to prevent secret information leakage through power traces. However, our new methodology enables to use general logic gates supported by standard cell libraries. In ord作者: 讓你明白 時(shí)間: 2025-3-30 22:25
A Design Flow and Evaluation Framework for DPA-Resistant Instruction Set Extensionscted logic styles have been proposed as an alternative to CMOS. However, they should only be used sparingly, since their area and power consumption are both significantly larger than for CMOS. We propose to augment a processor, realized in CMOS, with custom instruction set extensions, designed with 作者: faculty 時(shí)間: 2025-3-31 03:54
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multiplieic curves. We propose here a novel hardware implementation of Miller’s loop based on a pipelined Karatsuba-Ofman multiplier. Thanks to a careful selection of algorithms for computing the tower field arithmetic associated to the Tate pairing, we manage to keep the pipeline busy. We also describe the 作者: 影響帶來 時(shí)間: 2025-3-31 07:59
Faster ,-Arithmetic for Cryptographic Pairings on Barreto-Naehrig CurvesN curves and choose curve parameters such that . multiplication becomes more efficient. The proposed algorithm uses Montgomery reduction in a polynomial ring combined with a coefficient reduction phase using a pseudo-Mersenne number. With this algorithm, the performance of pairings on BN curves can 作者: Defraud 時(shí)間: 2025-3-31 11:19 作者: faculty 時(shí)間: 2025-3-31 17:00 作者: 溺愛 時(shí)間: 2025-3-31 19:03
Christopher G. Haswell,Jonathan Shachterion that allows to determine the number of the trial divisions for each prime candidate. Practical experiments are conducted, and countermeasures are proposed. For realistic parameters the success probability of our attack is in the order of 10–15?%.
