Name
Abstract | ||
|---|---|---|
Advanced cryptographic functionalities such as searchable encryption, aggregate signatures, proxy re-encryption, and attribute-based encryption can be realized by adopting bilinear pairings based on elliptic curves over a prime finite field GF(p). To achieve enough security the size of p should be at least a-few-hundred bit. Thus the "good" GF(p) hardware multiplier is necessary to construct the "good" bilinear pairing computation. We introduce a design methodology of such hardware multipliers with the Montgomery multiplication algorithm. |
Year | Venue | Keywords |
|---|---|---|
2016 | 2016 INTERNATIONAL SOC DESIGN CONFERENCE (ISOCC) | Finite Field Multiplier, Montgomery Multiplication, Pairing Cryptography Introduction |
Field | DocType | ISSN |
Prime (order theory),Finite field,Algorithm design,Computer science,Cryptography,Encryption,Multiplier (economics),Computer hardware,Elliptic curve,Bilinear interpolation | Conference | 2163-9612 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daisuke Fujimoto | 1 | 25 | 6.52 |
| Yusuke Nagahama | 2 | 0 | 0.34 |
| Tsutomu Matsumoto | 3 | 1156 | 197.58 |