Sciweavers

11 search results - page 2 / 3
» Towards Dimension Expanders over Finite Fields
Sort
View
SACRYPT
2001
Springer
106views Cryptology» more  SACRYPT 2001»
13 years 9 months ago
Fast Normal Basis Multiplication Using General Purpose Processors
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
Arash Reyhani-Masoleh, M. Anwarul Hasan
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 5 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
14 years 5 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
IADIS
2004
13 years 6 months ago
Towards Understanding of Factors Influencing User Acceptance of Mobile Payment Systems
M-payments, which refer to payments over a mobile device, have not taken off as fast as predicted. Their slow adoption rates raise many questions about what drives consumer behavi...
Agnieszka Zmijewska, Elaine Lawrence, Robert Steel...
PVLDB
2008
205views more  PVLDB 2008»
13 years 4 months ago
Making SENSE: socially enhanced search and exploration
Online communities like Flickr, del.icio.us and YouTube have established themselves as very popular and powerful services for publishing and searching contents, but also for ident...
Tom Crecelius, Mouna Kacimi, Sebastian Michel, Tho...