Abstract: This paper presents a lightweight hardware accelerator optimized for elliptic curve cryptography (ECC), supporting three standardized curves over the prime field GF($2^{255}-19$ ): ...
Abstract: We give a method to construct deep holes for elliptic curve codes. For long elliptic curve codes, we conjecture that our construction is complete in the sense that it gives all deep holes.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback