Sciweavers

117 search results - page 5 / 24
» Why Cryptosystems Fail
Sort
View
FSE
2003
Springer
125views Cryptology» more  FSE 2003»
14 years 17 days ago
On Plateaued Functions and Their Constructions
We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plat...
Claude Carlet, Emmanuel Prouff
ASIACRYPT
2005
Springer
14 years 27 days ago
Adapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
Phong Q. Nguyen, Jacques Stern
LATINCRYPT
2010
13 years 5 months ago
Combined Implementation Attack Resistant Exponentiation
Different types of implementation attacks, like those based on side channel leakage and active fault injection, are often considered as separate threats. Countermeasures are, there...
Jörn-Marc Schmidt, Michael Tunstall, Roberto ...
HICSS
2005
IEEE
148views Biometrics» more  HICSS 2005»
14 years 29 days ago
Evaluating Web-Based E-Government Services with a Citizen-Centric Approach
One of the challenges in delivering e-government services is to design the Web sites to make it easier for citizens to find desired information. However, little work is found to e...
Lili Wang, Stuart Bretschneider, Jon P. Gant
DCC
2003
IEEE
14 years 7 months ago
On the Security of Digital Signature Schemes Based on Error-Correcting Codes
In this paper we discuss the security of digital signature schemes based on error? correcting codes. Several attacks to the Xinmei scheme are surveyed, and some reasons given to e...
Sheng-Bo Xu, Jeroen Doumen, Henk C. A. van Tilborg