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: | Zaidan Pradana, Faisal |
---|---|
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 |
Similar Items
-
Quantification of particle morphology by boundary Fourier transform and generic Fourier transform
by: Yu, Z.Q., et al.
Published: (2014) -
FOURIER TRANSFORM OF FUNCTIONS
by: ZHUANG YAN
Published: (2021) -
FOURIER TRANSFORM OF FUNCTIONS
by: JEFFREY CHUAH JUN QUAN
Published: (2021) -
FOURIER TRANSFORM OF FUNCTIONS
by: POON KIT MUN
Published: (2021) -
FOURIER TRANSFORM OF FUNCTIONS
by: CHUA WEIJUN
Published: (2021)