Sciweavers

100 search results - page 12 / 20
» Arithmetic on superelliptic curves
Sort
View
ITCC
2005
IEEE
14 years 1 months ago
A Scalable Dual Mode Arithmetic Unit for Public Key Cryptosystems
Elliptic Curve Cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the ...
Francis M. Crowe, Alan Daly, William P. Marnane
COMPGEOM
1997
ACM
13 years 11 months ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...
ISDA
2006
IEEE
14 years 1 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
CG
2006
Springer
13 years 7 months ago
Optimal blurred segments decomposition of noisy shapes in linear time
Blurred segments were introduced by Debled-Rennesson et al. [Segmentation of discrete curves into fuzzy segments. In: 9th IWCIA, Electronic notes in discrete mathematics, vol. 12;...
Isabelle Debled-Rennesson, Fabien Feschet, Jocelyn...
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
13 years 6 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals