Sciweavers

583 search results - page 49 / 117
» On the Complexity of Matsui's Attack
Sort
View
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
14 years 7 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
IH
2009
Springer
14 years 1 months ago
Hardware-Based Public-Key Cryptography with Public Physically Unclonable Functions
Abstract. A physically unclonable function (PUF) is a multiple-input, multipleoutput, large entropy physical system that is unreproducible due to its structural complexity. A publi...
Nathan Beckmann, Miodrag Potkonjak
IMA
2009
Springer
113views Cryptology» more  IMA 2009»
14 years 1 months ago
On Linear Cryptanalysis with Many Linear Approximations
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
Benoît Gérard, Jean-Pierre Tillich
FSE
2007
Springer
192views Cryptology» more  FSE 2007»
14 years 1 months ago
Algebraic Cryptanalysis of 58-Round SHA-1
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article5 is to sophisticate and improve Wang’s attack by using algebraic tech...
Makoto Sugita, Mitsuru Kawazoe, Ludovic Perret, Hi...
IMA
2005
Springer
127views Cryptology» more  IMA 2005»
14 years 27 days ago
On the Automatic Construction of Indistinguishable Operations
Abstract. An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as side-channel a...
Manuel Barbosa, Dan Page