Sciweavers

79 search results - page 2 / 16
» How Secure Are FPGAs in Cryptographic Applications
Sort
View
PKC
2001
Springer
95views Cryptology» more  PKC 2001»
13 years 10 months ago
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
Tatsuaki Okamoto, David Pointcheval
CCS
2004
ACM
13 years 11 months ago
Reusable cryptographic fuzzy extractors
We show that a number of recent definitions and constructions of fuzzy extractors are not adequate for multiple uses of the same fuzzy secret—a major shortcoming in the case of...
Xavier Boyen
FORTE
2004
13 years 7 months ago
A Construction Kit for Modeling the Security of M-commerce Applications
Abstract. In this article we present a method to avoid security problems in modern m-commerce applications. The security problems that we are addressing are breaches of security du...
Dominik Haneberg, Wolfgang Reif, Kurt Stenzel
CHES
2003
Springer
104views Cryptology» more  CHES 2003»
13 years 10 months ago
Power-Analysis Attacks on an FPGA - First Experimental Results
Field Programmable Gate Arrays (FPGAs) are becoming increasingly popular, especially for rapid prototyping. For implementations of cryptographic algorithms, not only the speed and ...
Siddika Berna Örs, Elisabeth Oswald, Bart Pre...
TRUSTBUS
2007
Springer
13 years 11 months ago
How to Use ISO/IEC 24727-3 with Arbitrary Smart Cards
The forthcoming ISO/IEC 24727 series of standards defines application programming interfaces for smart cards and is expected to provide a major contribution to the global interope...
Detlef Hühnlein, Manuel Bach