Sciweavers

861 search results - page 72 / 173
» Faster integer multiplication
Sort
View
165
Voted
COMPSYSTECH
2011
14 years 2 months ago
Encoding watermark numbers as cographs using self-inverting permutations
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...
Maria Chroni, Stavros D. Nikolopoulos
206
Voted
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
16 years 2 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
128
Voted
MICRO
2003
IEEE
108views Hardware» more  MICRO 2003»
15 years 7 months ago
Reducing Design Complexity of the Load/Store Queue
With faster CPU clocks and wider pipelines, all relevant microarchitecture components should scale accordingly. There have been many proposals for scaling the issue queue, registe...
Il Park, Chong-liang Ooi, T. N. Vijaykumar
134
Voted
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
13 years 4 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart
117
Voted
CHES
2000
Springer
167views Cryptology» more  CHES 2000»
15 years 6 months ago
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
Gerardo Orlando, Christof Paar