Sciweavers

248 search results - page 37 / 50
» Fault Attacks on Signature Schemes
Sort
View
INDOCRYPT
2001
Springer
15 years 4 months ago
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
Markus Maurer, Alfred Menezes, Edlyn Teske
ACISP
2000
Springer
15 years 4 months ago
An Extremely Small and Efficient Identification Scheme
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
William D. Banks, Daniel Lieman, Igor Shparlinski
IJISEC
2006
106views more  IJISEC 2006»
14 years 11 months ago
Execution transactions for defending against software failures: use and evaluation
We examine the problem of containing buffer overflow attacks in a safe and efficient manner. Briefly, we automatically augment source code to dynamically catch stack and heap-based...
Stelios Sidiroglou, Angelos D. Keromytis
80
Voted
EDCC
1999
Springer
15 years 4 months ago
Transparent Word-Oriented Memory BIST Based on Symmetric March Algorithms
Abstract. The paper presents a new approach to transparent BIST for wordoriented RAMs which is based on the transformation of March transparent test algorithms to the symmetric ver...
Vyacheslav N. Yarmolik, I. V. Bykov, Sybille Helle...
JOC
2007
129views more  JOC 2007»
14 years 11 months ago
Formal Proofs for the Security of Signcryption
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
Joonsang Baek, Ron Steinfeld, Yuliang Zheng