Cryptographers' World
 

Erkay Savas


Author's Web Page Link

6 papers in database with 277 citations Star

H-number: 6

Conference Papers

[Sort papers chronologically] [Sort papers by citations count]

1. Johann Großschädl,  Roberto Maria Avanzi,  Erkay Savas,  Stefan Tillich,  Energy-Efficient Software Implementation of Long Integer Modular Arithmetic, pp. 75 - 90, CHES 2005.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 19 times ]

2. Johann Großschädl,  Erkay Savas,  Instruction Set Extensions for Fast Arithmetic in Finite Fields GF( p) and GF(2 m), pp. 133 - 147, CHES 2004.

[Electronic Edition][Cited 38 times ]

3. Erdinc Öztürk,  Berk Sunar,  Erkay Savas,  Low-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic, pp. 92 - 106, CHES 2004.

[Electronic Edition][Cited 36 times ]

4. Adnan Abdul-Aziz Gutub,  Alexandre F. Tenca,  Erkay Savas,  Çetin Kaya Koç,  Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2), pp. 484 - 499, CHES 2002.

[Electronic Edition][Cited 46 times ]

5. Erkay Savas,  Thomas A. Schmidt,  Çetin Kaya Koç,  Generating Elliptic Curves of Prime Order, pp. 142 - 158, CHES 2001.

[Electronic Edition][Cited 19 times ]

6. Erkay Savas,  Alexandre F. Tenca,  Çetin Kaya Koç,  A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2^m), pp. 277 - 292, CHES 2000.

[Electronic Edition][Cited 119 times Red StarRed Star]



Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals
Highly Cited...