Sciweavers

35 search results - page 4 / 7
» pkc 2010
Sort
View
PKC
2010
Springer
162views Cryptology» more  PKC 2010»
13 years 10 months ago
Faster Pairing Computations on Curves with High-Degree Twists
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
Craig Costello, Tanja Lange, Michael Naehrig
PKC
2010
Springer
138views Cryptology» more  PKC 2010»
13 years 10 months ago
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
Mathias Herrmann, Alexander May
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
13 years 8 months ago
Efficient Arithmetic on Hessian Curves
This paper considers a generalized form for Hessian curves. The family of generalized Hessian curves covers more isomorphism classes of elliptic curves. Over a finite filed Fq, it ...
Reza Rezaeian Farashahi, Marc Joye
PKC
2010
Springer
177views Cryptology» more  PKC 2010»
13 years 10 months ago
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters, STOC ’08), and correlation-secure trapdoor functions (Rosen and Segev, TCC ’09). Ou...
David Mandell Freeman, Oded Goldreich, Eike Kiltz,...
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
13 years 8 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...