14,486 Hits in 4.0 sec

Color Centers in Diamond Yield Potential Single Photon Source for Quantum Cryptography

June Lau
2000 MRS bulletin  
CLAUDIU MUNTELE Color Centers in Diamond Yield Potential Single Photon Source for Quantum Cryptography A reliable single photon emission source can tremendously advance the field of quantum cryptography  ...  A 514-nm argon ion laser (10 mW) provided this trigger. The photon source is a piece of bulk diamond (0.1 × 1.5 × 1.5 mm 3 ) with nitrogen-vacancy defect centers.  ... 
doi:10.1557/mrs2000.188 fatcat:hh3waffdang4lok7fvu4axucee

Recent Progress in Quantum Optics. Quantum Cryptography and Measurement of Quantum States
最近の量子光学の進展 量子暗号と量子状態の測定

2000 The Review of Laser Engineering  
The basic concept of quantum key distribution is reviewed. The security of quantum key distribution and nocloning (and related) theorems in the cases for various states are discussed. It is shown thatmany of the problems are related to what one can do and what one cannot do, under the restriction of not modifying the marginal density operator of a system. The security under the realistic situations is also briefly reviewed.
doi:10.2184/lsj.28.677 fatcat:3cagfoo3c5guhgtvspy6qq2na4

Quantum computing cryptography: Finding cryptographic Boolean functions with quantum annealing by a 2000 qubit D-wave quantum computer

Feng Hu, Lucas Lamata, Mikel Sanz, Xi Chen, Xingyuan Chen, Chao Wang, Enrique Solano
2020 Physics Letters A  
As the building block in symmetric cryptography, designing Boolean functions satisfying multiple properties is an important problem in sequence ciphers, block ciphers, and hash functions.  ...  Moreover, even 2000-qubit problems were declared to be solved by D-wave 2X quantum computer.  ...  Taking these two issues into account, Table II gives the number of distinct 6-variable bent functions out of 10 experiments.  ... 
doi:10.1016/j.physleta.2019.126214 fatcat:cxjyikex5jdfnmitslxilaqw6u

A comparative review on symmetric and asymmetric DNA-based cryptography

Baraa Tareq Hammad, Ali Maki Sagheer, Ismail Taha Ahmed, Norziana Jamil
2020 Bulletin of Electrical Engineering and Informatics  
Keywords: Asymmetric cryptography DNA-based GZIP OTP RSA Symmetric cryptography This is an open access article under the CC BY-SA license.  ...  Current researchers have focused on DNA-based cryptography, in fact, DNA or deoxyribonucleic acid, has been applied in cryptography for performing computation as well as storing and transmitting information  ...  Thus, it could be around 10 trillion DNA molecules in small size [17] .  ... 
doi:10.11591/eei.v9i6.2470 fatcat:y55ifvgep5aw3alx4lzjqqg5fe

Hybrid Trapdoor Commitments and Their Applications [chapter]

Dario Catalano, Ivan Visconti
2005 Lecture Notes in Computer Science  
. • Research interests in Cryptography, PAC Learning, Complexity Theory and Algorithms.  ...  Fifth conference on Security and Cryptography for Networks 2006 (SCN'06) 8. IACR Eurocrypt 2007 9. Western European Workshop on Research in Cryptography (WEWoRC) 2007. 10.  ...  Applied Cryptography and Network Security (ACNS) 2008. 12. Sixth conference on Security and Cryptography for Networks (SCN) 2008. 13. Applied Cryptography and Network Security (ACNS) 2009. 14.  ... 
doi:10.1007/11523468_25 fatcat:dkf42t7e6zcizpqaxiuafqpswu

Comparing Symmetric and Asymmetric cryptography in message encryption and decryption by using AES and RSA algorithms

Cryptography algorithms are divided into symmetric and asymmetric algorithms based on the key used between the sender and receiver of the pieces of information. this paper provides a comparison between  ...  the value for φ (z) φ (z) = (x -1) * (y -1) = 2 * 10 = 20 Choose e such that 1 < e < φ (z) and e and z.  ...  Encryption execution time 100 80 60 40 20 0 100 200 400 800 1000 2000 5000 No. of 𝐴𝐸𝑆 𝑅𝑆𝐴 words 100 0.408306 1.7743 200 1.16398 3.453 400 2.33085 7.1067 800 4.6168 13.8771 1000 5.0771 18.4126 2000  ... 
doi:10.37896/jxat12.03/262 fatcat:444i53oofnffhjc4wmpitkgvxe

Page 6320 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
(English summary) Public key cryptography (Melbourne, 2000), 196-209, Lecture Notes in Comput. Sci., 1751, Springer, Berlin, 2000.  ...  (English summary) Public key cryptography (Melbourne, 2000), 326-341, Lecture Notes in Comput. Sci., 1751, Springer, Berlin, 2000.  ... 

Analysis of design goals of cryptography algorithms based on different components

Ali Mohammad Norouzzadeh Gil Molk, Mohammad Reza Aref, Reza Ramazani Khorshiddoust
2021 Indonesian Journal of Electrical Engineering and Computer Science  
Cryptography algorithms are a fundamental part of a cryptographic system that is designed and implemented to increase information security.  ...  Although the cryptography algorithms are implemented to attainthe goals such as confidentially, integrity and authenticity of designing, but other matters that must be noticed by designers include speed  ...  2017 88 7 2000 47 20 2006 66 30 2012 163 10 2018 71 5 2001 54 30 2007 66 30 2013 154 10 2019 63 5 2002 57 30 2008 48 30 2014 134 13 2003 61 30 2009 71 30 2015 112  ... 
doi:10.11591/ijeecs.v23.i1.pp540-548 fatcat:atvsyspxhjhmjlel2qliofchhy

CRYPTREC Project Cryptographic Evaluation Project for the Japanese Electronic Government [chapter]

Hideki Imai, Atsuhiro Yamagishi
2000 Lecture Notes in Computer Science  
Okamoto (Ed.): ASIACRYPT 2000 , LNCS 1976 , pp. 399-400, 2000 . c Springer-Verlag Berlin Heidelberg 2000 will be proposed through a call for submission applicable to the Japanese electronic government  ...  Because of this importance, it has been pointed out domestically that the Japanese national government should adopt a cryptography usage policy in order to ensure that cryptography is integrated properly  ... 
doi:10.1007/3-540-44448-3_30 fatcat:vhaqgh3hajckdmckiwqoz3c2la

Optimal Difference Systems of Sets with Multipliers [chapter]

Vladimir D. Tonchev, Hao Wang
2006 Lecture Notes in Computer Science  
Tonchev, Symmetric (4, 4)-nets and generalized Hadamard matrices over groups of order 4, Designs, Codes and Cryptography 34 (2005), 71-87. 7. M. Harada, A. Munemasa and V.D.  ...  Tonchev, On generalized Hadamard matrices of minimum rank, Finite Fields and their Appl. 10 (2004), 522-529. 10. V. I. Levenshtein and V. D.  ...  Tonchev, The existence of a Bush-type Hadamard matrix of order 324 and two new infinite classes of symmetric designs, Designs, Codes and Cryptography 24 (2001), 225-232. 2000 29.  ... 
doi:10.1007/11753728_61 fatcat:xxc734q4ojetfct3fzquowbxwm

Non-Linear Optical Technology in Present and Future Transmission Systems and Optical Networks [chapter]

D. Erasme
2001 Nonlinear Optics for the Information Society  
Poulsen, September 2000 -ECOC 2000 Wavelength conversion at 10 Wavelength conversion at 10 Gbit Gbit/s /s Tensile strained SOA MQW Developed by CSELT Eye diagram at 10 Gbit/s after 1552 to 1558  ...  Poulsen, September 2000 -ECOC 2000  ... 
doi:10.1007/978-94-015-1267-1_2 fatcat:krxll26iebel5aafgurjgsjmdu

Quantum cryptography to satellites for global secure key distribution

John G. Rarity, Paul Knight, Philip M. Gorman, Kotska Wallace, Paul R. Tapster, Georges Otrio
2017 International Conference on Space Optics — ICSO 2000  
We are thus expecting 10- ICSO 2000 International Conference on Space Optics Toulouse Labège, France 5 -7 December 2000 20m footprint at ground level.  ...  This led to beam wander up to ICSO 2000 International Conference on Space Optics Toulouse Labège, France 5 -7 December 2000 1mR and losses above 20dB.  ... 
doi:10.1117/12.2307891 fatcat:gklwlthz5fgq3oapv3ek5mlqyy

A new fast modular multiplication method and its application to modular exponentiation-based cryptography

Akira Hayashi
2000 Electronics and communications in Japan. Part 3, Fundamental electronic science  
2000 Scripta Technica, Electron Comm Jpn Pt 3, 83(12): 8893, 2000  ...  In order to apply exponentiation-based cryptography, such as RSA cryptography and El Gamal cryptography, to a wide range of practical problems, it is desired to devise faster ciphering and deciphering  ...  It suffices to add u i u mod p i in stage 1 and use a i x i u i instead of a i x i 2 in stage 2. (8) (9) (10) (7) [Example 3] Consider the same RSA cryptography as in example 2. Let n = 2773.  ... 
doi:10.1002/1520-6440(200012)83:12<88::aid-ecjc10>;2-5 fatcat:lwhnilw75ncuzccsqm5cmgo4kq

Research Intuitions of Asymmetric Crypto System

Rojasree V. Et. al.
2021 Turkish Journal of Computer and Mathematics Education  
The public key cryptography is specifically designed to keep the key itself safe between the sender and receiver themselves.  ...  Perrig, "Practical techniques for searches on encrypted data," In the proceedings of 2000 IEEE Symposium on Security and Privacy S&P 2000, ISSN: 1081-6011, PP: 44-55, Berkeley, CA, USA, 2000, DOI: 10.1109  ...  [Dawn et al., 2000], Dawn Xiaoding Song, D. Wagner, A.  ... 
doi:10.17762/turcomat.v12i3.2016 fatcat:wtuw4sszjrhcnk6tyowpm27xr4

Automated Proof and Flaw-Finding Tools in Cryptography

Graham Steel
2015 IEEE Security and Privacy  
Several research groups have tackled this problem over the past 10 years.  ...  In the mid-to late 2000s, several groups worked to close the gap between DY models and real protocols.  ... 
doi:10.1109/msp.2015.22 fatcat:thtaumctcjbyzjpb3kkq75y3ku
« Previous Showing results 1 — 15 out of 14,486 results