Efficient multiplication in double-struck F sign3ℓm, m ≥ 1 and 5 ≤ ℓ ≤ 18

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5023 LNCS, Issue , 2008, Pages 406-414

  Cenk, Murat ^a   Özbudak, Ferruh ^b  

^a CANKAYA UNIVERSITY   (Turkey)

^b MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Chinese Remainder Theorem; Finite field multiplication; Pairing based cryptography

Indexed keywords

CHEMICAL MODIFICATION; MICROFLUIDICS;

CHARACTERISTIC 3; CHINESE REMAINDER THEOREM (CRT); CRYPTOLOGY; EXPLICIT FORMULAS; FINITE FIELDS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; MULTIPLICATIVE COMPLEXITY; PAIRING-BASED CRYPTOGRAPHY; POLYNOMIAL MULTIPLICATION; SPRINGER (CO);

CRYPTOGRAPHY;

EID: 45449109186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68164-9_27     Document Type: Conference Paper

References (9)

1. 36m. In: Adams, C., Miri, A., Wiener, M. (eds.) Selected Areas in Cryptography (SAC 2007). LNCS, vol. 4876, pp. 173-183. Springer, Heidelberg (2007), http://www.arxiv.org/PS_cache/arxiv/ pdf/0708/0708.3014v1.pdf
2. 397 and double-struck F sign36.97. In: Field Programmable Logic and Applications (FPL 2007), http://www.arxiv.org/PS_cache/ arxiv/pdf/0708/0708.3022v1.pdf
3. 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)
4. Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers by automata. Soviet Physics-Doklady 7, 595-596 (1963)
5. Winograd, S.: Arithmetic Complexity of Computations. SIAM, Philadelphia (1980)
6. Montgomery, P.L.: Five, six, and seven-term Karatsuba-like formulae. IEEE Transactions on Computers 54(3), 362-369 (2005)
7. Fan, H., Anwar Hasan, M.: Comments on Five, Six, and Seven-Term Karatsuba-Like Formulae. IEEE Transactions on Computers 56(5), 716-717 (2007)
8. 2 Using Chinese Remainder Theorem. IEEE Transactions on Computers (submitted)
9. Weimerskirch, A., Paar, C: Generalizations of the Karatsuba Algorithm for Polynomial Multiplication. Technical Report, Ruhr-Universität Bochum, Germany (2003), http://www.crypto.ruhr-uni-bochum.de/imperia/md/content/texte/ publications/tecreports/kaweb.pdf