✦ LIBER ✦

Parallel cryptographic arithmetic using a redundant Montgomery representation

✍ Scribed by Page, D.; Smart, N.P.

Book ID: 118697731
Publisher: IEEE
Year: 2004
Tongue: English
Weight: 665 KB
Volume: 53
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.2004.100

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel optical arithmetic on images by

Parallel optical arithmetic on images by a redundant binary number representation

✍ De Biase, Giuseppe A. ;Massini, Annalisa 📂 Article 📅 1990 🏛 The Optical Society 🌐 English ⚖ 765 KB

Redundant binary number representation f

Redundant binary number representation for an inherently parallel arithmetic on optical computers

✍ De Biase, Giuseppe A. ;Massini, Annalisa 📂 Article 📅 1993 🏛 The Optical Society 🌐 English ⚖ 668 KB

High efficiency redundant binary number

High efficiency redundant binary number representations for parallel arithmetic on optical computers

✍ G.A. De Biase; A. Massini 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 658 KB

A redundant representation of GF(qn) for

A redundant representation of GF(qn) for designing arithmetic circuits

✍ Geiselmann, W.; Steinwandt, R. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 537 KB

One-step optical trinary signed-digit ar

One-step optical trinary signed-digit arithmetic using redundant bit representations

✍ A.K. Cherri; N.I. Khachab; E.H. Ismail 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 918 KB

A simple one-step fully parallel trinary signed-digit arithmetic is proposed for parallel optical computing. This technique performs multidigit carry-free addition and borrow-free subtraction in constant time. The trinary signed-digit arithmetic operations are based on redundant bit representation o

A square root hardware algorithm using r

A square root hardware algorithm using redundant binary representation

✍ Naofumi Takagi; Shuzo Yajima 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 799 KB