SIMULATION OF MODULAR EXPONENTIAL CIRCUIT VIA QUANTUM FOURIER TRANSFORM
Modular exponents are the most widely used functions in the field of computational science and cryptography. In the RSA (Rivest–Shamir–Adleman) cryptographic system, the modular exponential function is used for integer factorization. P. Shor (1994) has used the approach of quantum computation to...
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/73355 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |