-
1
-
-
38549168744
-
-
Knuth, D.E.: The Art of Computer Programming. In: Seminumerical Algorithms, 3rd edn., 2, Addison-Wesley, Reading MA (1998), First edition (1969)
-
Knuth, D.E.: The Art of Computer Programming. In: Seminumerical Algorithms, 3rd edn., vol. 2, Addison-Wesley, Reading MA (1998), First edition (1969)
-
-
-
-
2
-
-
38549094944
-
-
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003), First edition (1999)
-
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003), First edition (1999)
-
-
-
-
3
-
-
38549162998
-
-
Department, U.S.: of Commerce / National Institute of Standards and Technology: Digital Signature Standard (DSS), Federal Information Processings Standards Publication 186-2 (January 2000)
-
Department, U.S.: of Commerce / National Institute of Standards and Technology: Digital Signature Standard (DSS), Federal Information Processings Standards Publication 186-2 (January 2000)
-
-
-
-
4
-
-
84957677506
-
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms
-
Krawczyk, H, ed, CRYPTO 1998, Springer, Heidelberg
-
Bailey, D.V., Paar, C.: Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 472-485. Springer, Heidelberg (1998)
-
(1998)
LNCS
, vol.1462
, pp. 472-485
-
-
Bailey, D.V.1
Paar, C.2
-
5
-
-
21144441469
-
-
Avanzi, R.M., Mihǎilescu, P.: Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures (Extended Abstract. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, 3006, pp. 320-334. Springer, Heidelberg (2004)
-
Avanzi, R.M., Mihǎilescu, P.: Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures (Extended Abstract. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 320-334. Springer, Heidelberg (2004)
-
-
-
-
6
-
-
0345490614
-
Tate-Pairing Implementations for Tripartite Key Agreement
-
Laih, C.-S, ed, ASIACRYPT 2003, Springer, Heidelberg
-
Duursma, I., Lee, H.: Tate-Pairing Implementations for Tripartite Key Agreement. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111-123. Springer, Heidelberg (2003)
-
(2003)
LNCS
, vol.2894
, pp. 111-123
-
-
Duursma, I.1
Lee, H.2
-
7
-
-
27244434197
-
-
Kerins, T., Marnane, W.P., Popovici, E.M., Barreto, P.S.L.M.: Efficient Hardware for the Tate Pairing Calculation in Characteristic Three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, 3659, pp. 412-426. Springer, Heidelberg (2005)
-
Kerins, T., Marnane, W.P., Popovici, E.M., Barreto, P.S.L.M.: Efficient Hardware for the Tate Pairing Calculation in Characteristic Three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 412-426. Springer, Heidelberg (2005)
-
-
-
-
8
-
-
38549114874
-
-
Karatsuba, A., Ofman, Y.: Multiplication of Multidigit Numbers on Automata. Soviet Physics-Doklady 7(7), 595-596 (1963) Translated from Doklady Akademii Nauk SSSR 145(2), 293-294 (July 1962)
-
Karatsuba, A., Ofman, Y.: Multiplication of Multidigit Numbers on Automata. Soviet Physics-Doklady 7(7), 595-596 (1963) Translated from Doklady Akademii Nauk SSSR 145(2), 293-294 (July 1962)
-
-
-
-
9
-
-
0003720340
-
-
PhD thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany June
-
Paar, C.: Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields. PhD thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany (June 1994)
-
(1994)
Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields
-
-
Paar, C.1
-
12
-
-
0000817992
-
Algebraic Complexity Theory
-
Springer, Heidelberg
-
Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, vol. 315. Springer, Heidelberg (1997)
-
(1997)
Grundlehren der mathematischen Wissenschaften
, vol.315
-
-
Bürgisser, P.1
Clausen, M.2
Shokrollahi, M.A.3
-
13
-
-
33747629888
-
Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation
-
Bajard, J.C., Imbert, L., Negre, C.: Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation. IEEE Transactions on Computers 55(9), 1167-1177 (2006)
-
(2006)
IEEE Transactions on Computers
, vol.55
, Issue.9
, pp. 1167-1177
-
-
Bajard, J.C.1
Imbert, L.2
Negre, C.3
-
14
-
-
38549126979
-
-
Blahut, R.E.: Fast Algorithms for Digital Signal Processing. Addison-Wesley, Reading MA (1985)
-
Blahut, R.E.: Fast Algorithms for Digital Signal Processing. Addison-Wesley, Reading MA (1985)
-
-
-
-
15
-
-
0000523068
-
An Algorithm for the Machine Computation of the Complex Fourier Series
-
Cooley, J.W., Tukey, J.W.: An Algorithm for the Machine Computation of the Complex Fourier Series. Mathematics of Computation 19, 297-331 (1965)
-
(1965)
Mathematics of Computation
, vol.19
, pp. 297-331
-
-
Cooley, J.W.1
Tukey, J.W.2
-
17
-
-
33745686500
-
-
2. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, 3897, pp. 359-369. Springer, Heidelberg (2006)
-
2. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 359-369. Springer, Heidelberg (2006)
-
-
-
-
18
-
-
14844351609
-
Five, Six, and Seven-Term Karatsuba-Like Formulae
-
Montgomery, P.L.: Five, Six, and Seven-Term Karatsuba-Like Formulae. IEEE Transactions on Computers 54(3), 362-369 (2005)
-
(2005)
IEEE Transactions on Computers
, vol.54
, Issue.3
, pp. 362-369
-
-
Montgomery, P.L.1
-
20
-
-
0345490614
-
p - x + d
-
Laih, C.-S, ed, ASIACRYPT 2003, Springer, Heidelberg
-
p - x + d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111-123. Springer, Heidelberg (2003)
-
(2003)
LNCS
, vol.2894
, pp. 111-123
-
-
Duursma, I.1
Lee, H.S.2
|