Sciweavers

237 search results - page 29 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 9 months ago
Triangular Decomposition of Semi-algebraic Systems
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
Changbo Chen, James H. Davenport, John P. May, Mar...
CHES
2009
Springer
162views Cryptology» more  CHES 2009»
14 years 9 months ago
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
Abstract. This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propos...
Jean-Luc Beuchat, Jérémie Detrey, Ni...
AAECC
2006
Springer
100views Algorithms» more  AAECC 2006»
13 years 8 months ago
On Doubly-Cyclic Convolutional Codes
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(xn - 1), where F is a finite field. A particular choice of the data leads to th...
Heide Gluesing-Luerssen, Wiland Schmale
IPMI
2005
Springer
14 years 9 months ago
Computational Elastography from Standard Ultrasound Image Sequences by Global Trust Region Optimization
Abstract. A new approach is proposed to estimate the spatial distribution of shear modulus of tissues in-vivo. An image sequence is acquired using a standard medical ultrasound sca...
Jan Kybic, Daniel Smutek
CHES
2000
Springer
167views Cryptology» more  CHES 2000»
14 years 1 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