2887 search results - page 113 / 578 » Name Generation and Linearity |
154
click to vote
CRYPTO
2009
Springer
16 years 25 days ago
2009
Springer
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...
93
Voted
DATE
2005
IEEE
15 years 12 months ago
2005
IEEE
This paper gives an overview of a new technique, named pseudo-ring testing (PRT). PRT can be applied for testing wide type of random access memories (RAM): bitor word-oriented and...
130
click to vote
DAM
2006
15 years 6 months ago
2006
: In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for m...
162
click to vote
VMCAI
2007
Springer
16 years 11 days ago
2007
Springer
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
194
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
In this paper, we use linear approximations of the addition modulo 2n of three n-bit integers to identify linear approximations of g1, g2, the feedback functions of HC-128. This, i...