Sciweavers

3190 search results - page 36 / 638
» cans 2011
Sort
View
IACR
2011
98views more  IACR 2011»
13 years 9 months ago
New Receipt-Free E-Voting Scheme and Self-Proving Mix Net as New Paradigm
The contribution of this paper is twofold. First we present a new simple electronic voting scheme having standard re-encryption mix net back-end, which allows to cast a ballot and ...
Aram Jivanyan, Gurgen Khachatryan
IACR
2011
110views more  IACR 2011»
13 years 9 months ago
Decoding One Out of Many
Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding technique is thus n...
Nicolas Sendrier
IACR
2011
124views more  IACR 2011»
13 years 9 months ago
Group Law Computations on Jacobians of Hyperelliptic Curves
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
Craig Costello, Kristin Lauter
IACR
2011
116views more  IACR 2011»
13 years 9 months ago
Some Words About Cryptographic Key Recognition In Data Streams
Search for cryptographic keys in RAM is a new and prospective technology which can be used, primarily, in the computer forensics. In order to use it, a cryptanalyst must solve, at...
Alexey Chilikov, Evgeny Alekseev
139
Voted
ICAL
2011
301views more  ICAL 2011»
13 years 9 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...