Abstract

AbstractThe study of tile self-assembly model shows the development of self-assembling systems for solving complex computational problems. In this paper, we show the method of performing modular inversion in GF(p) by self-assembling with Θ(p) computational tile types in Θ(p) steps. Then, we discuss how the self-assembling systems for computing modular inversion in GF(p) apply to elliptic curve Diffie-Hellman key exchange algorithm. The self-assembled architectures provide the feasibility of cryptanalysis for this algorithm.KeywordsModular inversionSelf-assemblingElliptic curveDiffie-Hellman key exchange

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.