首页    期刊浏览 2024年09月20日 星期五
登录注册

文章基本信息

  • 标题:A Study of Quantum Cryptographic Architectures and It’s An Efficient Implementations
  • 本地全文:下载
  • 作者:B.Sujatha ; S.Nagaprasad ; G.Srinivasa Rao
  • 期刊名称:International Journal of Engineering and Computer Science
  • 印刷版ISSN:2319-7242
  • 出版年度:2014
  • 卷号:3
  • 期号:7
  • 页码:7229-7233
  • 出版社:IJECS
  • 摘要:Quantum Cryptography could also be a Promising Approach visible of final Quantum Computers existence. it is a singularscience Technique that provides us a singular secret Protocol that cannot be glorious by anybody. It depends on Physical laws of physicsPrinciple, Un-like our today’s our Most Spectacular Mathematical Puzzles used in PGP (Pretty wise Privacy).Quantum cryptography workswithin the following manner (this read is that the "classical" model developed by Bennett and plate armour in 1984 - another models doexist): Assume that 2 individuals would like to exchange a message firmly, historically named Alice and Bob Let's say that Alice transmitsgauge boson range 349 as associate UPRIGHT/LEFTDOWN to Bob, except for that one, Eve uses the one-dimensional polarizer, whichmight solely live UP/DOWN or LEFT/RIGHT photons accurately. Together don't directly imply that given a commitment and a quantumchannel one will perform secure multi-party computation.In the quantum setting, they might be significantly useful: Crépeau and Kilianshowed that from a commitment and a quantum channel, one will construct associate flatly secure protocol for playacting questionableoblivious transfer. [1] Oblivious transfer, on the opposite hand, had been shown by Kilian to permit implementation of virtually anydistributed computation in a very secure manner (so-called secure multi-party computation). [2] (Notice that here we tend to square measurea trifle imprecise: The results by Crépeau and Kilian [1] and Kilian[2] In the classical setting, similar results is achieved once forward acertain on the quantity of classical (non-quantum) knowledge that the individual will store. [9] it absolutely was verified, however, thatduring this model conjointly the honest parties have to be compelled to use an oversized quantity of memory (namely the square-root of theadversary's memory bound). [10] This makes these protocols impractical for realistic memory bounds. (Note that with today's technology likelaborious disks, associate individual will cheaply store giant amounts of classical knowledge. ) Position-based quantum cryptography[edit]The goal of position-based quantum cryptography is to use the geographical location of a player as its papers. Another fascinating exerciseis to plot the inverse of the amount of points attributed to scrabble letters and compare this to the antecedent distribution The Enigma CipherMachine As every cipher is broken, cryptographers set regarding planning stronger systems for coding. as an example, rather than subbingindividual letters, the sender may substitute pairs of letters, that is understood as alphabetic character substitution. higher still, there's thebook cipher, that permits any book to be the key, and that provides multiple substitutions for an equivalent letter. this kind of cipher was wontto encipher the disreputable Beale papers, that apparently contain the placement of a multi-million dollar treasure.
  • 关键词:QC (Quantum Cryptography); QKD (Quantum Key Distribution); Quantum Mechanics; Sender; Receiver; Intruder; Alice; Bob;Eve; Photon; BB Protocol (Bennet and armour plate Protocol).
国家哲学社会科学文献中心版权所有