History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 | next | last

Result 1 to 20 of 39 total

An informatic pipeline for managing high-throughput screening experiments and analyzing data from stereochemically diverse libraries. (English)
Journal of Computer-Aided Molecular DesignJournal of Computer-Aided Molecular Design 27, N0. 5, 455-468(2013)
1
Model-Based System Integration (MBSI) - Key Attributes of MBSE from the System Integrator’s Perspective. (English)
CSER, 313-322(2013)
2
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. (English)
Int. J. Appl. Cryptogr. 2, No. 3, 212-228 (2012).
3
A heterogeneous computing environment to solve the 768-bit RSA challenge. (English)
Cluster ComputingCluster Computing 15, N0. 1, 53-68(2012)
4
Efficient SIMD Arithmetic Modulo a Mersenne Number. (English)
IEEE Symposium on Computer Arithmetic, 213-221(2011)
5
An analysis of affine coordinates for pairing computation. (English)
Joye, Marc (ed.) et al., Pairing-based cryptography ‒ Pairing 2010. 4th international conference, Yamanaka Hot Spring, Japan, December 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17454-4/pbk). Lecture Notes in Computer Science 6487, 1-20 (2010).
6
Factorization of a 768-bit RSA modulus. (English)
Rabin, Tal (ed.), Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14622-0/pbk). Lecture Notes in Computer Science 6223, 333-350 (2010).
7
Factorizations of cunningham numbers with bases 13 to 99. (English)
Comput. Res. Repos. 2010, Article No. 1004.3169 (2010).
8
The period of the Bell numbers modulo a prime. (English)
Math. Comput.Math. Comput. 79, N0. 271, 1793-1800(2010)
9
TB database: an integrated platform for tuberculosis research. (English)
Nucleic Acids Res. 37, No. Database-Issue, 499-508 (2009).
10
An observation about variations of the Diffie-Hellman assumption. (English)
Serdica J. Comput. 3, No. 3, 309-318 (2009).
11
Vulnerabilities in anonymous credential systems. (English)
Electron. Notes Theor. Comput. Sci. 197, No. 2, 141-148 (2008).
12
Improved stage 2 to P $\pm 1$ factoring algorithms. (English)
van der Poorten, Alfred J. (ed.) et al., Algorithmic number theory. 8th international symposium, ANTS-VIII Banff, Canada, May 17‒22, 2008 Proceedings. Berlin: Springer (ISBN 978-3-540-79455-4/pbk). Lecture Notes in Computer Science 5011, 180-195 (2008).
13
Assessing the properties of the World Health Organization’s Quality of Life Index. (English)
IMCSIT, 151-154(2008)
14
Trading inversions for multiplications in elliptic curve cryptography. (English)
Des. Codes Cryptography 39, No. 2, 189-206 (2006).
15
Five, six, and seven-term Karatsuba-like formulae. (English)
IEEE Trans. Comput. 54, No. 3, 362-369 (2005).
16
Teager-kaiser energy and higher-order operators in white-light interference microscopy for surface shape measurement. (English)
EURASIP J. Appl. Signal Process. 2005, No. 17, 2804-2815 (2005).
17
Improved Weil and Tate pairings for elliptic and hyperelliptic curves. (English)
Buell, Duncan (ed.), Algorithmic number theory. 6th international symposium, ANTS-VI, Burlington, VT, USA, June 13‒18, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22156-5/pbk). Lecture Notes in Computer Science 3076, 169-183 (2004).
18
Fast elliptic curve arithmetic and improved Weil pairing evaluation. (English)
Joye, Marc (ed.), Topics in cryptology ‒ CT-RSA 2003. The cryptographers’ track at the RSA conference 2003, San Francisco, CA, USA, April 13‒17, 2003. Proceedings. Berlin: Springer (ISBN 3-540-00847-0/pbk). Lect. Notes Comput. Sci. 2612, 343-354 (2003).
19
2D discrete high order energy operators for surface profiling using white light interferometry. (English)
ISSPA (1), 601-604(2003)
20
first | previous | 1 21 | next | last

Result 1 to 20 of 39 total