Sciweavers

17 search results - page 1 / 4
» Performances of Galois Sub-hierarchy-building Algorithms
Sort
View
ICFCA
2007
Springer
13 years 8 months ago
Performances of Galois Sub-hierarchy-building Algorithms
Abstract. The Galois Sub-hierarchy (GSH) is a polynomial-size representation of a concept lattice which has been applied to several fields, such as software engineering and linguis...
Gabriela Arévalo, Anne Berry, Marianne Huch...
ITCC
2005
IEEE
13 years 10 months ago
A Scalable and High Performance Elliptic Curve Processor with Resistance to Timing Attacks
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-a...
Alireza Hodjat, David Hwang, Ingrid Verbauwhede
MASCOTS
2008
13 years 6 months ago
Optimizing Galois Field Arithmetic for Diverse Processor Architectures and Applications
Galois field implementations are central to the design of many reliable and secure systems, with many systems implementing them in software. The two most common Galois field opera...
Kevin M. Greenan, Ethan L. Miller, Thomas J. E. Sc...
IJNSEC
2010
247views more  IJNSEC 2010»
12 years 11 months ago
Hardware Implementation of Efficient Modified Karatsuba Multiplier Used in Elliptic Curves
The efficiency of the core Galois field arithmetic improves the performance of elliptic curve based public key cryptosystem implementation. This paper describes the design and imp...
Sameh M. Shohdy, Ashraf El-Sisi, Nabil A. Ismail
ECAI
2004
Springer
13 years 10 months ago
Topological Visual Localization Using Decentralized Galois Lattices
Abstract. This paper presents a new decentralized method for selecting visual landmarks in a structured environment. Different images, issued from the different places, are analyze...
Emmanuel Zenou, Malik Ghallab, Manuel Samuelides