Sciweavers

1296 search results - page 7 / 260
» The Number Field Sieve
Sort
View
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
14 years 3 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
13 years 11 months ago
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...
ICIP
2008
IEEE
14 years 4 months ago
Extending connected operators to colour images
Connected operators are an important tool for the analysis of greyscale images. In extending them to colour and other vector images there are a number of issues that must be addre...
Adrian N. Evans, David Gimenez
MOC
2002
103views more  MOC 2002»
13 years 9 months ago
Computation of class numbers of quadratic number fields
We explain how one can dispense with the numerical computation of approximations to the transcendental integral functions involved when computing class numbers of quadratic number ...
Stéphane Louboutin
MOC
2011
13 years 4 months ago
Class numbers of ray class fields of imaginary quadratic fields
Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of S...
Omer Kucuksakalli