Sciweavers

1537 search results - page 43 / 308
» On sets not belonging to algebras
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 7 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
13 years 11 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
EUROCRYPT
2007
Springer
13 years 11 months ago
Cryptanalysis of SFLASH with Slightly Modified Parameters
SFLASH is a signature scheme which belongs to a family of multivariate schemes proposed by Patarin et al. in 1998 [9]. The SFLASH scheme itself has been designed in 2001 [8] and ha...
Vivien Dubois, Pierre-Alain Fouque, Jacques Stern
ADCM
2007
59views more  ADCM 2007»
13 years 7 months ago
Gabor frames by sampling and periodization
By sampling the window of a Gabor frame for L2 (R) belonging to Feichtinger’s algebra, S0(R), one obtains a Gabor frame for l2 (Z). In this article we present a survey of results...
Peter L. Søndergaard
IJFCS
2007
93views more  IJFCS 2007»
13 years 7 months ago
Modelling and Analysis of PKI-Based Systems Using Process Calculi
In this technical report, we present a process algebra aimed at modelling PKI-based systems. The new language, SPIKY, extends the spi-calculus by adding primitives for the retriev...
Benjamin Aziz, Geoff Hamilton