Sciweavers

4924 search results - page 105 / 985
» Efficiency Improvement for NTRU
Sort
View
EVOW
2006
Springer
13 years 12 months ago
Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
István Juhos, Jano I. van Hemert
EUROCRYPT
2000
Springer
13 years 11 months ago
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
Abstract. This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. Th...
Anne Canteaut, Michaël Trabbia
EUROPAR
2000
Springer
13 years 11 months ago
Cache Remapping to Improve the Performance of Tiled Algorithms
With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, ...
Kristof Beyls, Erik H. D'Hollander
FSE
2008
Springer
105views Cryptology» more  FSE 2008»
13 years 9 months ago
An Improved Security Bound for HCTR
HCTR was proposed by Wang, Feng and Wu in 2005. It is a mode of operation which provides a tweakable strong pseudorandom permutation. Though HCTR is quite an efficient mode, the au...
Debrup Chakraborty, Mridul Nandi
MVA
2007
120views Computer Vision» more  MVA 2007»
13 years 9 months ago
Improvement of Cadastral Map Assembling Based on GHT
There are numerous cadastral maps generated by past land surveying. For effective and efficient use of these maps, we have to assemble the set of maps to make them superimposable ...
Fei Liu, Wataru Ohyama, Tetsushi Wakabayashi, Fumi...