History

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

Result 1 to 20 of 42 total

BioAssay Research Database (BARD): chemical biology and probe-development enabled by structured metadata and result types. (English)
Nucleic Acids Research 43, N0. Database-Issue, 1163-1170(2015)
1
Montgomery multiplication using vector instructions. (English)
Lange, Tanja (ed.) et al., Selected areas in cryptography ‒ SAC 2013. 20th international conference, Burnaby, BC, Canada, August 14‒16, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-662-43413-0/pbk; 978-3-662-43414-7/ebook). Lecture Notes in Computer Science 8282, 471-489 (2014).
2
Finding ECM-friendly curves through a study of Galois properties. (English)
Howe, Everett W. (ed.) et al., ANTS X. Proceedings of the tenth algorithmic number theory symposium, San Diego, CA, USA, July 9‒13, 2012. Berkeley, CA: Mathematical Sciences Publishers (MSP) (ISBN 978-1-935107-00-2/hbk; 978-1-935107-01-9/ebook). The Open Book Series 1, 63-86 (2013).
3
Model-Based System Integration (MBSI) - Key Attributes of MBSE from the System Integrator’s Perspective. (English)
CSER, 313-322(2013)
4
An informatic pipeline for managing high-throughput screening experiments and analyzing data from stereochemically diverse libraries. (English)
Journal of Computer-Aided Molecular Design 27, N0. 5, 455-468(2013)
5
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).
6
A heterogeneous computing environment to solve the 768-bit RSA challenge. (English)
Cluster Computing 15, N0. 1, 53-68(2012)
7
Efficient SIMD Arithmetic Modulo a Mersenne Number. (English)
IEEE Symposium on Computer Arithmetic, 213-221(2011)
8
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).
9
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).
10
Factorizations of cunningham numbers with bases 13 to 99. (English)
Comput. Res. Repos. 2010, Article No. 1004.3169 (2010).
11
The period of the Bell numbers modulo a prime. (English)
Math. Comput. 79, N0. 271, 1793-1800(2010)
12
TB database: an integrated platform for tuberculosis research. (English)
Nucleic Acids Res. 37, No. Database-Issue, 499-508 (2009).
13
An observation about variations of the Diffie-Hellman assumption. (English)
Serdica J. Comput. 3, No. 3, 309-318 (2009).
14
Vulnerabilities in anonymous credential systems. (English)
Electron. Notes Theor. Comput. Sci. 197, No. 2, 141-148 (2008).
15
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).
16
Assessing the properties of the World Health Organization’s Quality of Life Index. (English)
IMCSIT, 151-154(2008)
17
Trading inversions for multiplications in elliptic curve cryptography. (English)
Des. Codes Cryptography 39, No. 2, 189-206 (2006).
18
Five, six, and seven-term Karatsuba-like formulae. (English)
IEEE Trans. Comput. 54, No. 3, 362-369 (2005).
19
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).
20
first | previous | 1 21 41 | next | last

Result 1 to 20 of 42 total