A Scalable Architecture for Montgomery Multiplication - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Alexandre F. Tenca, Çetin Kaya Koç. A Scalable Architecture for Montgomery Multiplication. In Çetin Kaya Koç, Christof Paar, editors, Cryptographic Hardware and Embedded Systems, First International Workshop, CHES 99, Worcester, MA, USA, August 12-13, 1999, Proceedings. Volume 1717 of Lecture Notes in Computer Science, pages 94-108, Springer, 1999. [doi]

This author has not been identified. Look up 'Alexandre F. Tenca' in GoogleThis author has not been identified. Look up 'Çetin Kaya Koç' in Google

runs on WebDSL