Sciweavers

178 search results - page 10 / 36
» On the Implementation of a Fast Prime Generation Algorithm
Sort
View
ISSAC
2009
Springer
163views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Fast arithmetics in artin-schreier towers over finite fields
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
Luca De Feo, Éric Schost
CHES
2003
Springer
149views Cryptology» more  CHES 2003»
14 years 22 days ago
Attacking Unbalanced RSA-CRT Using SPA
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
Pierre-Alain Fouque, Gwenaëlle Martinet, Guil...
ICISC
1998
87views Cryptology» more  ICISC 1998»
13 years 8 months ago
Rabin and RSA analogues based on non-maximal imaginary quadratic orders
Abstract. In 14] and 21] there are proposed ElGamal-type cryptosystems based on non-maximal imaginary quadratic orders with fast trapdoor decryption. The trapdoor information is th...
Detlef Hühnlein, Andreas Meyer, Tsuyoshi Taka...
PLDI
2012
ACM
11 years 10 months ago
Fast and precise hybrid type inference for JavaScript
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
Brian Hackett, Shu-yu Guo
DIS
2007
Springer
14 years 1 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki