Sciweavers

129 search results - page 8 / 26
» iacr 2011
Sort
View
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
IACR
2011
130views more  IACR 2011»
13 years 9 months ago
Hiding the Policy in Cryptographic Access Control
Abstract. Recently, cryptographic access control has received a lot of attention, mainly due to the availability of efficient Attribute-Based Encryption (ABE) schemes. ABE allows ...
Sascha Müller, Stefan Katzenbeisser
IACR
2011
108views more  IACR 2011»
13 years 9 months ago
On lower bounds on second-order nonliearities of bent functions obtained by using Niho power functions
Abstract. In this paper we find a lower bound of the second-order nonlinearities of Boolean bent functions of the form f(x) = Trn 1 (α1xd1 + α2xd2 ), where d1 and d2 are Niho ex...
Manish Garg, Sugata Gangopadhyay
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