Quantum Cryptography
•
0 likes•169 views
This presentation is about Quantum Cryptography; focused on quantum key distribution(QKD). I presented this in the quantum computing class of Modulabs(모두의 연구소). *Detailed explanation: https://tula3and.github.io/cryptography/quantum-cryptography/#
Report
Share
Report
Share
Recommended
Rsa
RSA is an asymmetric encryption algorithm invented by Ronald Rivest, Adi Shamir, and Leonard Adleman of MIT in 1977. It uses a public key and a private key to encrypt and decrypt messages. To generate the keys, two prime numbers are multiplied to get N, Z is calculated as (p-1)*(q-1), and a private key less than Z is chosen. The corresponding public key is then calculated such that the private key multiplied by the public key is congruent to 1 modulo Z. A message can then be encrypted with the public key and decrypted with the private key or vice versa.
RSA algorithm
RSA is a public-key cryptosystem that uses both public and private keys for encryption and decryption. It was the first practical implementation of such a cryptosystem. The algorithm involves four main steps: 1) generation of the public and private keys, 2) encryption of messages using the public key, 3) decryption of encrypted messages using the private key, and 4) potential cracking of the encrypted message. It works by using two large prime numbers to generate the keys and performs exponentiation and modulo operations on messages to encrypt and decrypt them. There were some drawbacks to the original RSA algorithm related to redundant calculations and representing letters numerically that opened it up to easier hacking. Enhancements to RSA improved it by choosing
RSA ALGORITHM
The document summarizes the RSA encryption algorithm. It begins by explaining that RSA was developed in 1977 by Rivest, Shamir and Adleman. It then provides an example to demonstrate how RSA works step-by-step, generating keys, encrypting a message and decrypting the ciphertext. Finally, it discusses some challenges with breaking RSA encryption, including brute force attacks and mathematical attacks based on factoring the encryption keys, as well as timing attacks that aim to deduce keys based on variations in processing time.
Rsa algorithm key generation
RSAAlgorithm is the first public key algorithm discovered in 1978 by Ron Rivest, Adi Shamir and Len Adleman. It uses different but related keys for encryption and decryption. The RSA algorithm can be used for both public key encryption and digital signatures. It works by selecting two large prime numbers to calculate the public and private keys. The public key is used to encrypt data and the private key is used to decrypt it.
Elliptic curve cryptography and zero knowledge proof
This document discusses elliptic curve cryptography and zero knowledge proofs. It begins by establishing the mathematical foundations needed for cryptography, including groups, rings, fields, and the discrete logarithm problem. It then explains how elliptic curves can be used in public key cryptography applications like Diffie-Hellman key exchange and ElGamal encryption. It also covers zero knowledge proofs, their properties, examples of uses, and the Fiat-Shamir identification protocol. Throughout, it provides examples to illustrate key concepts in elliptic curve cryptography and zero knowledge proofs.
Elliptic Curve Cryptography and Zero Knowledge Proof
Elliptic Curve Cryptography and Zero Knowledge Proof
Presentation by Nimish Joseph, at College of Engineering Cherthala, Kerala, India, during Faculty Development Program, on 06-Nov-2013
Digital Logic circuit
This document provides an overview of digital logic circuits and sequential circuits. It discusses various logic gates like OR, AND, NOT, NAND, NOR and XOR gates. It explains their truth tables and symbols. It also covers Boolean algebra, map simplification using K-maps, combinational circuits like multiplexers, demultiplexers, encoders and decoders. Finally, it describes different types of flip-flops like SR, D, JK and T flip-flops which are used to build sequential circuits that have memory and can store past states.
Homomorphic Encryption
Homomorphic encryption allows computations to be carried out on encrypted data without decrypting it first. This summary discusses Craig Gentry's scheme for fully homomorphic encryption based on ideal lattices. The scheme works by encrypting bits as ciphertexts with small noise that grows with computations. A bootstrapping procedure called re-crypt reduces the noise to keep ciphertexts decryptable. While promising for applications like cloud computing, the scheme has high computational costs that scale poorly with security level. Current research aims to make homomorphic encryption more efficient and practical.
Recommended
Rsa
RSA is an asymmetric encryption algorithm invented by Ronald Rivest, Adi Shamir, and Leonard Adleman of MIT in 1977. It uses a public key and a private key to encrypt and decrypt messages. To generate the keys, two prime numbers are multiplied to get N, Z is calculated as (p-1)*(q-1), and a private key less than Z is chosen. The corresponding public key is then calculated such that the private key multiplied by the public key is congruent to 1 modulo Z. A message can then be encrypted with the public key and decrypted with the private key or vice versa.
RSA algorithm
RSA is a public-key cryptosystem that uses both public and private keys for encryption and decryption. It was the first practical implementation of such a cryptosystem. The algorithm involves four main steps: 1) generation of the public and private keys, 2) encryption of messages using the public key, 3) decryption of encrypted messages using the private key, and 4) potential cracking of the encrypted message. It works by using two large prime numbers to generate the keys and performs exponentiation and modulo operations on messages to encrypt and decrypt them. There were some drawbacks to the original RSA algorithm related to redundant calculations and representing letters numerically that opened it up to easier hacking. Enhancements to RSA improved it by choosing
RSA ALGORITHM
The document summarizes the RSA encryption algorithm. It begins by explaining that RSA was developed in 1977 by Rivest, Shamir and Adleman. It then provides an example to demonstrate how RSA works step-by-step, generating keys, encrypting a message and decrypting the ciphertext. Finally, it discusses some challenges with breaking RSA encryption, including brute force attacks and mathematical attacks based on factoring the encryption keys, as well as timing attacks that aim to deduce keys based on variations in processing time.
Rsa algorithm key generation
RSAAlgorithm is the first public key algorithm discovered in 1978 by Ron Rivest, Adi Shamir and Len Adleman. It uses different but related keys for encryption and decryption. The RSA algorithm can be used for both public key encryption and digital signatures. It works by selecting two large prime numbers to calculate the public and private keys. The public key is used to encrypt data and the private key is used to decrypt it.
Elliptic curve cryptography and zero knowledge proof
This document discusses elliptic curve cryptography and zero knowledge proofs. It begins by establishing the mathematical foundations needed for cryptography, including groups, rings, fields, and the discrete logarithm problem. It then explains how elliptic curves can be used in public key cryptography applications like Diffie-Hellman key exchange and ElGamal encryption. It also covers zero knowledge proofs, their properties, examples of uses, and the Fiat-Shamir identification protocol. Throughout, it provides examples to illustrate key concepts in elliptic curve cryptography and zero knowledge proofs.
Elliptic Curve Cryptography and Zero Knowledge Proof
Elliptic Curve Cryptography and Zero Knowledge Proof
Presentation by Nimish Joseph, at College of Engineering Cherthala, Kerala, India, during Faculty Development Program, on 06-Nov-2013
Digital Logic circuit
This document provides an overview of digital logic circuits and sequential circuits. It discusses various logic gates like OR, AND, NOT, NAND, NOR and XOR gates. It explains their truth tables and symbols. It also covers Boolean algebra, map simplification using K-maps, combinational circuits like multiplexers, demultiplexers, encoders and decoders. Finally, it describes different types of flip-flops like SR, D, JK and T flip-flops which are used to build sequential circuits that have memory and can store past states.
Homomorphic Encryption
Homomorphic encryption allows computations to be carried out on encrypted data without decrypting it first. This summary discusses Craig Gentry's scheme for fully homomorphic encryption based on ideal lattices. The scheme works by encrypting bits as ciphertexts with small noise that grows with computations. A bootstrapping procedure called re-crypt reduces the noise to keep ciphertexts decryptable. While promising for applications like cloud computing, the scheme has high computational costs that scale poorly with security level. Current research aims to make homomorphic encryption more efficient and practical.
Oram And Secure Computation
Yao's Garbled Circuit protocol allows two parties to jointly compute a function on their private inputs without revealing the inputs. The document discusses how to construct an encrypted AND gate as part of a garbled circuit to hide the parties' inputs. It also describes optimizations like TinyGarble that adapt hardware synthesis techniques to generate compact sequential garbled circuits in order to improve scalability for secure computation. Finally, it mentions oblivious RAM techniques like dummy accesses that aim to hide the access pattern to outsourced data storage and prevent frequency analysis attacks.
Class3
This document provides an overview of cryptography concepts including:
- Homework 1 is due on 1/18 and project 1 is due the next day
- It reviews classical ciphers, modern symmetric ciphers like DES, and basic cryptography terminology
- It describes the Feistel cipher structure used in DES, the DES algorithm details like key scheduling and rounds, and strengths and weaknesses of DES versus alternatives like AES and triple DES
Blockchain Technology - Week 6 - Role of Cryptography in Blockchain
Lecture on 18 December 2018
Role of Cryptography in Blockchain
RSA and SHA
Blockchain for Beginners
Elective course from the Faculty of Information Technology, Thai - Nichi Institute of Technology, Bangkok for undergraduate students.
#BlockchainTNI2018
Computing on Encrypted Data
Shai Halevi discusses new ways to protect cloud data and security. Presented at "New Techniques for Protecting Cloud Data and Security" organized by the New York Technology Council.
Two fish & Rijndael (AES) Encryption Algorithm
In cryptography, the Advanced Encryption Standard (AES) is an encryption standard adopted by the
U.S. government. Back in 1997 the National Institute of Standards and Technology (NIST) made a public call for new cipher
algorithms that could replace the DES. A rough summary of
the requirements made by NIST for the new AES were the
following:
Symmetric-key cipher
Block cipher
Support for 128 bit block sizes
Support for 128, 192, and 256 bit key lengths.
A combination of factors such as security, performance,
efficiency, ease of implementation and flexibility contributed
to the selection of this algorithm as the AES.Twofish and Rijndael were designed to meet the requirements of the
Advanced Encryption Standard(AES) competition and selected among five finalists of that
competition.
Rijndael is the block cipher algorithm recently chosen by the National Institute of Science and Technology (NIST) as the Advanced Encryption Standard (AES). It supercedes the Data Encryption Standard (DES). NIST selected Rijndael as the standard symmetric key encryption algorithm to be used to encrypt sensitive (unclassified) American federal information. The choice was based on a careful and comprehensive analysis of the security and efficiency characteristics of Rijndael's algorithm.
CVMU digital electronics ppt for students to learn from
This document provides an introduction to digital electronics and covers several key topics:
- It defines digital electronics and discusses why it is important compared to analog electronics.
- It outlines the main components covered: binary number system, logic gates, Boolean algebra, adders, flip-flops, registers, counters, and A/D and D/A conversion.
- It then goes into detail on specific logic gates like AND, OR, NOT, NAND, NOR, and their truth tables. Boolean algebra laws are also discussed.
- Finally, it covers number systems and conversions between binary, decimal, and octal numbering systems.
zkStudyClub: PLONKUP & Reinforced Concrete [Luke Pearson, Joshua Fitzgerald, ...
This week, Luke Pearson (Polychain Capital) and Joshua Fitzgerald (Anoma) present their work on Plonkup, a protocol that combines Plookup and PLONK into a single, efficient protocol. The protocol relies on a new hash function, called Reinforced Concrete, written by Dmitry Khovratovich. The three of them will present their work together at this week's edition of zkStudyClub!
Slides:
---
To Follow the Zero Knowledge Podcast us at https://www.zeroknowledge.fm
To the listeners of Zero Knowledge Podcast, if you like what we do:
- Follow us on Twitter - @zeroknowledgefm
- Join us on Telegram - https://t.me/joinchat/TORo7aknkYNLHmCM
- Support our Gitcoin Grant - https://gitcoin.co/grants/329/zero-knowledge-podcast-2
- Support us on Patreon - https://www.patreon.com/zeroknowledge
Electronics lec 10
This document discusses basic logic gates used in electronics. It describes the AND, OR, NOT, NAND, NOR, and exclusive OR logic gates. For each gate, it provides the Boolean equation that represents the function and explains when the output is true. It also lists common integrated circuit chip families that are used to implement each gate type in both TTL and CMOS logic technologies.
3306565.ppt
The document discusses logical design and analysis of combinational circuits using logic gates. It covers topics such as logic gates, synchronous vs asynchronous circuits, circuit analysis, implementing switching functions using data selectors, priority encoders, decoders, multiplexers, demultiplexers and other basic digital components. Examples are provided to illustrate circuit design and analysis techniques for combinational logic circuits.
A Deep Dive Into Understanding Apache Cassandra
Inside Cassandra – C* is an interesting piece of software for many reasons, but it is especially interesting in its use of elegant data structures and algorithms. This talk will focus on the data structures and algorithms that make C* such a scalable and performant database. We will walk along the write, read and delete paths exploring the low-level details of how each of these operations work. We will also explore some of the background processes that maintain availability and performance. The goal of this talk is to gain a deeper understanding of C* by exploring the low-level details of its implementation.
341-12-4-2001.ppt
The document provides an introduction to digital systems and digital circuits. It discusses how digital systems use discrete voltage levels to represent binary digits, unlike analog systems which use continuous ranges of values. The advantages of digital systems include reproducibility, reliability, flexibility, and lower costs due to integrated circuits. Boolean algebra is introduced as the mathematical system used to analyze digital circuits, using binary operations like AND, OR and NOT. Common digital logic gates like AND, OR, NAND, NOR and XOR are described along with their truth tables. Finally, it provides an overview of how logic gates can be integrated into circuits and packaged as integrated circuits.
Overview on Cryptography and Network Security
These slides give some overview on the the concepts which were in Crytography and network security. I have prepared these slides by the experiece after refer the text bbok as well as resources from the net. Added figures directly from the references. I would like to acknowledge all the authors by originally.
Bch codes
This document provides information about BCH codes, including:
1. BCH codes are linear cyclic block codes that can detect and correct errors. They allow flexibility in choosing block length and code rate.
2. Key characteristics of BCH codes include the block length being 2m - 1, error correction ability up to t errors where t<(2m - 1)/2, and minimum distance of at least 2t + 1.
3. Galois fields are finite fields that are important for constructing BCH codes. A generator polynomial is chosen based on the roots in the Galois field and is used to encode messages into codewords.
Public_Key_Cryptography in crypto analysis.ppt
This document provides an overview of public key cryptography and algorithms such as Diffie-Hellman and RSA. It discusses symmetric ciphers which use a shared private key, and asymmetric ciphers which use public and private key pairs. The Diffie-Hellman key exchange algorithm allows secure key exchange over insecure channels. RSA encryption is based on the difficulty of factoring large numbers and uses a public key for encryption and private key for decryption. The document also notes some moral issues around information theft and privacy in cryptography.
3 Things I Learned During My First Internship #LifeatIBM
I shared 3 things I learned during my first internship in IBM Quantum. I prepared this for Qiskit Korean Community meeting.
Qiskit: Building a Quantum Computing Community
This presentation is for introducing what is Qiskit Community and how to contribute to Qiskit. I prepared this for Community Session in Nano Korea 2022.
How to Make Open-source Contributions and Run Blog with Github
This presentation is about how to use Github well. There are three parts to understand how Git and Github work and utilize it for own personal branding. I prepared this for WISET Open Talk session of team Quantum is here.
Welcome to Azure Quantum
This presentation is about Azure Quantum. I prepared this for Global Azure Korea 2022.
Azure Quantum을 처음 사용해보실 분들을 위한 발표 자료입니다. 스크린샷이 많이 들어가 있어 쉽게 따라하실 수 있을 거에요. :)
How to Contribute to Qiskit with Github
This presentation is about how to contribute to Qiskit with Github. I prepared this for Qiskit Hackathon Korea 2022.
Git과 Github를 이용해 Qiskit에 기여하는 방법을 고민하고 있으신 분들께 도움이 되었으면 좋겠습니다. 자세한 설명은 아래의 유튜브 링크를 참고해주시면 감사하겠습니다.
*Detailed explanation(kor): https://youtu.be/5cSdM5nBJ60
My Projects with Qiskit
Sharing my three Qiskit projects and experience in hackathon. I presented this in the first anniversary of Full-Stack Quantum Computation: https://fullstackquantumcomputation.tech/anniversary/.
Qoupang
Quantum Blockchain Solution for Logistics: I presented this in 2021 Qiskit Hackathon Korea. All sources are in my github: https://github.com/tula3and/qoupang. If you interested in our Qoupang, please check this out!
*Some icons were replaced because of copyright considerations.
Let's Quantum
This presentation is about my journey into the quantum world. I presented this in Women Who Code Seoul(위민 후 코드 서울).
More Related Content
Similar to Quantum Cryptography
Oram And Secure Computation
Yao's Garbled Circuit protocol allows two parties to jointly compute a function on their private inputs without revealing the inputs. The document discusses how to construct an encrypted AND gate as part of a garbled circuit to hide the parties' inputs. It also describes optimizations like TinyGarble that adapt hardware synthesis techniques to generate compact sequential garbled circuits in order to improve scalability for secure computation. Finally, it mentions oblivious RAM techniques like dummy accesses that aim to hide the access pattern to outsourced data storage and prevent frequency analysis attacks.
Class3
This document provides an overview of cryptography concepts including:
- Homework 1 is due on 1/18 and project 1 is due the next day
- It reviews classical ciphers, modern symmetric ciphers like DES, and basic cryptography terminology
- It describes the Feistel cipher structure used in DES, the DES algorithm details like key scheduling and rounds, and strengths and weaknesses of DES versus alternatives like AES and triple DES
Blockchain Technology - Week 6 - Role of Cryptography in Blockchain
Lecture on 18 December 2018
Role of Cryptography in Blockchain
RSA and SHA
Blockchain for Beginners
Elective course from the Faculty of Information Technology, Thai - Nichi Institute of Technology, Bangkok for undergraduate students.
#BlockchainTNI2018
Computing on Encrypted Data
Shai Halevi discusses new ways to protect cloud data and security. Presented at "New Techniques for Protecting Cloud Data and Security" organized by the New York Technology Council.
Two fish & Rijndael (AES) Encryption Algorithm
In cryptography, the Advanced Encryption Standard (AES) is an encryption standard adopted by the
U.S. government. Back in 1997 the National Institute of Standards and Technology (NIST) made a public call for new cipher
algorithms that could replace the DES. A rough summary of
the requirements made by NIST for the new AES were the
following:
Symmetric-key cipher
Block cipher
Support for 128 bit block sizes
Support for 128, 192, and 256 bit key lengths.
A combination of factors such as security, performance,
efficiency, ease of implementation and flexibility contributed
to the selection of this algorithm as the AES.Twofish and Rijndael were designed to meet the requirements of the
Advanced Encryption Standard(AES) competition and selected among five finalists of that
competition.
Rijndael is the block cipher algorithm recently chosen by the National Institute of Science and Technology (NIST) as the Advanced Encryption Standard (AES). It supercedes the Data Encryption Standard (DES). NIST selected Rijndael as the standard symmetric key encryption algorithm to be used to encrypt sensitive (unclassified) American federal information. The choice was based on a careful and comprehensive analysis of the security and efficiency characteristics of Rijndael's algorithm.
CVMU digital electronics ppt for students to learn from
This document provides an introduction to digital electronics and covers several key topics:
- It defines digital electronics and discusses why it is important compared to analog electronics.
- It outlines the main components covered: binary number system, logic gates, Boolean algebra, adders, flip-flops, registers, counters, and A/D and D/A conversion.
- It then goes into detail on specific logic gates like AND, OR, NOT, NAND, NOR, and their truth tables. Boolean algebra laws are also discussed.
- Finally, it covers number systems and conversions between binary, decimal, and octal numbering systems.
zkStudyClub: PLONKUP & Reinforced Concrete [Luke Pearson, Joshua Fitzgerald, ...
This week, Luke Pearson (Polychain Capital) and Joshua Fitzgerald (Anoma) present their work on Plonkup, a protocol that combines Plookup and PLONK into a single, efficient protocol. The protocol relies on a new hash function, called Reinforced Concrete, written by Dmitry Khovratovich. The three of them will present their work together at this week's edition of zkStudyClub!
Slides:
---
To Follow the Zero Knowledge Podcast us at https://www.zeroknowledge.fm
To the listeners of Zero Knowledge Podcast, if you like what we do:
- Follow us on Twitter - @zeroknowledgefm
- Join us on Telegram - https://t.me/joinchat/TORo7aknkYNLHmCM
- Support our Gitcoin Grant - https://gitcoin.co/grants/329/zero-knowledge-podcast-2
- Support us on Patreon - https://www.patreon.com/zeroknowledge
Electronics lec 10
This document discusses basic logic gates used in electronics. It describes the AND, OR, NOT, NAND, NOR, and exclusive OR logic gates. For each gate, it provides the Boolean equation that represents the function and explains when the output is true. It also lists common integrated circuit chip families that are used to implement each gate type in both TTL and CMOS logic technologies.
3306565.ppt
The document discusses logical design and analysis of combinational circuits using logic gates. It covers topics such as logic gates, synchronous vs asynchronous circuits, circuit analysis, implementing switching functions using data selectors, priority encoders, decoders, multiplexers, demultiplexers and other basic digital components. Examples are provided to illustrate circuit design and analysis techniques for combinational logic circuits.
A Deep Dive Into Understanding Apache Cassandra
Inside Cassandra – C* is an interesting piece of software for many reasons, but it is especially interesting in its use of elegant data structures and algorithms. This talk will focus on the data structures and algorithms that make C* such a scalable and performant database. We will walk along the write, read and delete paths exploring the low-level details of how each of these operations work. We will also explore some of the background processes that maintain availability and performance. The goal of this talk is to gain a deeper understanding of C* by exploring the low-level details of its implementation.
341-12-4-2001.ppt
The document provides an introduction to digital systems and digital circuits. It discusses how digital systems use discrete voltage levels to represent binary digits, unlike analog systems which use continuous ranges of values. The advantages of digital systems include reproducibility, reliability, flexibility, and lower costs due to integrated circuits. Boolean algebra is introduced as the mathematical system used to analyze digital circuits, using binary operations like AND, OR and NOT. Common digital logic gates like AND, OR, NAND, NOR and XOR are described along with their truth tables. Finally, it provides an overview of how logic gates can be integrated into circuits and packaged as integrated circuits.
Overview on Cryptography and Network Security
These slides give some overview on the the concepts which were in Crytography and network security. I have prepared these slides by the experiece after refer the text bbok as well as resources from the net. Added figures directly from the references. I would like to acknowledge all the authors by originally.
Bch codes
This document provides information about BCH codes, including:
1. BCH codes are linear cyclic block codes that can detect and correct errors. They allow flexibility in choosing block length and code rate.
2. Key characteristics of BCH codes include the block length being 2m - 1, error correction ability up to t errors where t<(2m - 1)/2, and minimum distance of at least 2t + 1.
3. Galois fields are finite fields that are important for constructing BCH codes. A generator polynomial is chosen based on the roots in the Galois field and is used to encode messages into codewords.
Public_Key_Cryptography in crypto analysis.ppt
This document provides an overview of public key cryptography and algorithms such as Diffie-Hellman and RSA. It discusses symmetric ciphers which use a shared private key, and asymmetric ciphers which use public and private key pairs. The Diffie-Hellman key exchange algorithm allows secure key exchange over insecure channels. RSA encryption is based on the difficulty of factoring large numbers and uses a public key for encryption and private key for decryption. The document also notes some moral issues around information theft and privacy in cryptography.
Similar to Quantum Cryptography (14)
Blockchain Technology - Week 6 - Role of Cryptography in Blockchain
Blockchain Technology - Week 6 - Role of Cryptography in Blockchain
CVMU digital electronics ppt for students to learn from
CVMU digital electronics ppt for students to learn from
zkStudyClub: PLONKUP & Reinforced Concrete [Luke Pearson, Joshua Fitzgerald, ...
zkStudyClub: PLONKUP & Reinforced Concrete [Luke Pearson, Joshua Fitzgerald, ...
More from Dayeong Kang
3 Things I Learned During My First Internship #LifeatIBM
I shared 3 things I learned during my first internship in IBM Quantum. I prepared this for Qiskit Korean Community meeting.
Qiskit: Building a Quantum Computing Community
This presentation is for introducing what is Qiskit Community and how to contribute to Qiskit. I prepared this for Community Session in Nano Korea 2022.
How to Make Open-source Contributions and Run Blog with Github
This presentation is about how to use Github well. There are three parts to understand how Git and Github work and utilize it for own personal branding. I prepared this for WISET Open Talk session of team Quantum is here.
Welcome to Azure Quantum
This presentation is about Azure Quantum. I prepared this for Global Azure Korea 2022.
Azure Quantum을 처음 사용해보실 분들을 위한 발표 자료입니다. 스크린샷이 많이 들어가 있어 쉽게 따라하실 수 있을 거에요. :)
How to Contribute to Qiskit with Github
This presentation is about how to contribute to Qiskit with Github. I prepared this for Qiskit Hackathon Korea 2022.
Git과 Github를 이용해 Qiskit에 기여하는 방법을 고민하고 있으신 분들께 도움이 되었으면 좋겠습니다. 자세한 설명은 아래의 유튜브 링크를 참고해주시면 감사하겠습니다.
*Detailed explanation(kor): https://youtu.be/5cSdM5nBJ60
My Projects with Qiskit
Sharing my three Qiskit projects and experience in hackathon. I presented this in the first anniversary of Full-Stack Quantum Computation: https://fullstackquantumcomputation.tech/anniversary/.
Qoupang
Quantum Blockchain Solution for Logistics: I presented this in 2021 Qiskit Hackathon Korea. All sources are in my github: https://github.com/tula3and/qoupang. If you interested in our Qoupang, please check this out!
*Some icons were replaced because of copyright considerations.
Let's Quantum
This presentation is about my journey into the quantum world. I presented this in Women Who Code Seoul(위민 후 코드 서울).
What to Eat Today
This presentation is about an android web-application which shows all the restaurants around KNU. It will help students to choose what to eat. I used Github for hosting a website and Expo webview for building it.
Quantum Teleportation with Qiskit
This presentation is about Quantum Teleportation; short description and codes with circuits. I presented this in the quantum machine learning class of Modulabs(모두의 연구소).
*Detailed explanation(kor): https://tula3and.github.io/qiskit/qiskit-02-kor/#
From June to Now
This presentation is about what I did from June to now. As a member of IBM C:LOUDERs, I could make a study group(called ZUA) and be a project manager. I also started my personal project, OCOL, which is for a newsletter publication with people that I met from this group. In this project, I usually write articles about computer security.
*Colors from: https://www.ibm.com/design/language/ibm-logos/rebus/
More from Dayeong Kang (11)
3 Things I Learned During My First Internship #LifeatIBM
3 Things I Learned During My First Internship #LifeatIBM
How to Make Open-source Contributions and Run Blog with Github
How to Make Open-source Contributions and Run Blog with Github
Recently uploaded
EWOCS-I: The catalog of X-ray sources in Westerlund 1 from the Extended Weste...
Context. With a mass exceeding several 104 M⊙ and a rich and dense population of massive stars, supermassive young star clusters
represent the most massive star-forming environment that is dominated by the feedback from massive stars and gravitational interactions
among stars.
Aims. In this paper we present the Extended Westerlund 1 and 2 Open Clusters Survey (EWOCS) project, which aims to investigate
the influence of the starburst environment on the formation of stars and planets, and on the evolution of both low and high mass stars.
The primary targets of this project are Westerlund 1 and 2, the closest supermassive star clusters to the Sun.
Methods. The project is based primarily on recent observations conducted with the Chandra and JWST observatories. Specifically,
the Chandra survey of Westerlund 1 consists of 36 new ACIS-I observations, nearly co-pointed, for a total exposure time of 1 Msec.
Additionally, we included 8 archival Chandra/ACIS-S observations. This paper presents the resulting catalog of X-ray sources within
and around Westerlund 1. Sources were detected by combining various existing methods, and photon extraction and source validation
were carried out using the ACIS-Extract software.
Results. The EWOCS X-ray catalog comprises 5963 validated sources out of the 9420 initially provided to ACIS-Extract, reaching a
photon flux threshold of approximately 2 × 10−8 photons cm−2
s
−1
. The X-ray sources exhibit a highly concentrated spatial distribution,
with 1075 sources located within the central 1 arcmin. We have successfully detected X-ray emissions from 126 out of the 166 known
massive stars of the cluster, and we have collected over 71 000 photons from the magnetar CXO J164710.20-455217.
Bob Reedy - Nitrate in Texas Groundwater.pdf
Presented at June 6-7 Texas Alliance of Groundwater Districts Business Meeting
Equivariant neural networks and representation theory
Or: Beyond linear.
Abstract: Equivariant neural networks are neural networks that incorporate symmetries. The nonlinear activation functions in these networks result in interesting nonlinear equivariant maps between simple representations, and motivate the key player of this talk: piecewise linear representation theory.
Disclaimer: No one is perfect, so please mind that there might be mistakes and typos.
dtubbenhauer@gmail.com
Corrected slides: dtubbenhauer.com/talks.html
快速办理(UAM毕业证书)马德里自治大学毕业证学位证一模一样
学校原件一模一样【微信：741003700 】《(UAM毕业证书)马德里自治大学毕业证学位证》【微信：741003700 】学位证，留信认证（真实可查，永久存档）原件一模一样纸张工艺/offer、雅思、外壳等材料/诚信可靠,可直接看成品样本，帮您解决无法毕业带来的各种难题！外壳，原版制作，诚信可靠，可直接看成品样本。行业标杆！精益求精，诚心合作，真诚制作！多年品质 ,按需精细制作，24小时接单,全套进口原装设备。十五年致力于帮助留学生解决难题，包您满意。
本公司拥有海外各大学样板无数，能完美还原。
1:1完美还原海外各大学毕业材料上的工艺：水印，阴影底纹，钢印LOGO烫金烫银，LOGO烫金烫银复合重叠。文字图案浮雕、激光镭射、紫外荧光、温感、复印防伪等防伪工艺。材料咨询办理、认证咨询办理请加学历顾问Q/微741003700
【主营项目】
一.毕业证【q微741003700】成绩单、使馆认证、教育部认证、雅思托福成绩单、学生卡等！
二.真实使馆公证(即留学回国人员证明,不成功不收费)
三.真实教育部学历学位认证（教育部存档！教育部留服网站永久可查）
四.办理各国各大学文凭(一对一专业服务,可全程监控跟踪进度)
如果您处于以下几种情况：
◇在校期间，因各种原因未能顺利毕业……拿不到官方毕业证【q/微741003700】
◇面对父母的压力，希望尽快拿到；
◇不清楚认证流程以及材料该如何准备；
◇回国时间很长，忘记办理；
◇回国马上就要找工作，办给用人单位看；
◇企事业单位必须要求办理的
◇需要报考公务员、购买免税车、落转户口
◇申请留学生创业基金
留信网认证的作用:
1:该专业认证可证明留学生真实身份
2:同时对留学生所学专业登记给予评定
3:国家专业人才认证中心颁发入库证书
4:这个认证书并且可以归档倒地方
5:凡事获得留信网入网的信息将会逐步更新到个人身份内，将在公安局网内查询个人身份证信息后，同步读取人才网入库信息
6:个人职称评审加20分
7:个人信誉贷款加10分
8:在国家人才网主办的国家网络招聘大会中纳入资料，供国家高端企业选择人才
THEMATIC APPERCEPTION TEST(TAT) cognitive abilities, creativity, and critic...
THEMATIC APPERCEPTION TEST(TAT) cognitive abilities, creativity, and critic...Abdul Wali Khan University Mardan,kP,Pakistan
hematic appreciation test is a psychological assessment tool used to measure an individual's appreciation and understanding of specific themes or topics. This test helps to evaluate an individual's ability to connect different ideas and concepts within a given theme, as well as their overall comprehension and interpretation skills. The results of the test can provide valuable insights into an individual's cognitive abilities, creativity, and critical thinking skillsShallowest Oil Discovery of Turkiye.pptx
The Petroleum System of the Çukurova Field - the Shallowest Oil Discovery of Türkiye, Adana
Sharlene Leurig - Enabling Onsite Water Use with Net Zero Water
Sharlene Leurig - Enabling Onsite Water Use with Net Zero WaterTexas Alliance of Groundwater Districts
Presented at June 6-7 Texas Alliance of Groundwater Districts Business Meeting在线办理(salfor毕业证书)索尔福德大学毕业证毕业完成信一模一样
学校原件一模一样【微信：741003700 】《(salfor毕业证书)索尔福德大学毕业证》【微信：741003700 】学位证，留信认证（真实可查，永久存档）原件一模一样纸张工艺/offer、雅思、外壳等材料/诚信可靠,可直接看成品样本，帮您解决无法毕业带来的各种难题！外壳，原版制作，诚信可靠，可直接看成品样本。行业标杆！精益求精，诚心合作，真诚制作！多年品质 ,按需精细制作，24小时接单,全套进口原装设备。十五年致力于帮助留学生解决难题，包您满意。
本公司拥有海外各大学样板无数，能完美还原。
1:1完美还原海外各大学毕业材料上的工艺：水印，阴影底纹，钢印LOGO烫金烫银，LOGO烫金烫银复合重叠。文字图案浮雕、激光镭射、紫外荧光、温感、复印防伪等防伪工艺。材料咨询办理、认证咨询办理请加学历顾问Q/微741003700
【主营项目】
一.毕业证【q微741003700】成绩单、使馆认证、教育部认证、雅思托福成绩单、学生卡等！
二.真实使馆公证(即留学回国人员证明,不成功不收费)
三.真实教育部学历学位认证（教育部存档！教育部留服网站永久可查）
四.办理各国各大学文凭(一对一专业服务,可全程监控跟踪进度)
如果您处于以下几种情况：
◇在校期间，因各种原因未能顺利毕业……拿不到官方毕业证【q/微741003700】
◇面对父母的压力，希望尽快拿到；
◇不清楚认证流程以及材料该如何准备；
◇回国时间很长，忘记办理；
◇回国马上就要找工作，办给用人单位看；
◇企事业单位必须要求办理的
◇需要报考公务员、购买免税车、落转户口
◇申请留学生创业基金
留信网认证的作用:
1:该专业认证可证明留学生真实身份
2:同时对留学生所学专业登记给予评定
3:国家专业人才认证中心颁发入库证书
4:这个认证书并且可以归档倒地方
5:凡事获得留信网入网的信息将会逐步更新到个人身份内，将在公安局网内查询个人身份证信息后，同步读取人才网入库信息
6:个人职称评审加20分
7:个人信誉贷款加10分
8:在国家人才网主办的国家网络招聘大会中纳入资料，供国家高端企业选择人才
Authoring a personal GPT for your research and practice: How we created the Q...
Thematic analysis in qualitative research is a time-consuming and systematic task, typically done using teams. Team members must ground their activities on common understandings of the major concepts underlying the thematic analysis, and define criteria for its development. However, conceptual misunderstandings, equivocations, and lack of adherence to criteria are challenges to the quality and speed of this process. Given the distributed and uncertain nature of this process, we wondered if the tasks in thematic analysis could be supported by readily available artificial intelligence chatbots. Our early efforts point to potential benefits: not just saving time in the coding process but better adherence to criteria and grounding, by increasing triangulation between humans and artificial intelligence. This tutorial will provide a description and demonstration of the process we followed, as two academic researchers, to develop a custom ChatGPT to assist with qualitative coding in the thematic data analysis process of immersive learning accounts in a survey of the academic literature: QUAL-E Immersive Learning Thematic Analysis Helper. In the hands-on time, participants will try out QUAL-E and develop their ideas for their own qualitative coding ChatGPT. Participants that have the paid ChatGPT Plus subscription can create a draft of their assistants. The organizers will provide course materials and slide deck that participants will be able to utilize to continue development of their custom GPT. The paid subscription to ChatGPT Plus is not required to participate in this workshop, just for trying out personal GPTs during it.
Direct Seeded Rice - Climate Smart Agriculture
Direct Seeded Rice - Climate Smart AgricultureInternational Food Policy Research Institute- South Asia Office
PPT on Direct Seeded Rice presented at the three-day 'Training and Validation Workshop on Modules of Climate Smart Agriculture (CSA) Technologies in South Asia' workshop on April 22, 2024.
Immersive Learning That Works: Research Grounding and Paths Forward
We will metaverse into the essence of immersive learning, into its three dimensions and conceptual models. This approach encompasses elements from teaching methodologies to social involvement, through organizational concerns and technologies. Challenging the perception of learning as knowledge transfer, we introduce a 'Uses, Practices & Strategies' model operationalized by the 'Immersive Learning Brain' and ‘Immersion Cube’ frameworks. This approach offers a comprehensive guide through the intricacies of immersive educational experiences and spotlighting research frontiers, along the immersion dimensions of system, narrative, and agency. Our discourse extends to stakeholders beyond the academic sphere, addressing the interests of technologists, instructional designers, and policymakers. We span various contexts, from formal education to organizational transformation to the new horizon of an AI-pervasive society. This keynote aims to unite the iLRN community in a collaborative journey towards a future where immersive learning research and practice coalesce, paving the way for innovative educational research and practice landscapes.
Randomised Optimisation Algorithms in DAPHNE
Slides from talk:
Aleš Zamuda: Randomised Optimisation Algorithms in DAPHNE .
Austrian-Slovenian HPC Meeting 2024 – ASHPC24, Seeblickhotel Grundlsee in Austria, 10–13 June 2024
https://ashpc.eu/
Describing and Interpreting an Immersive Learning Case with the Immersion Cub...
Current descriptions of immersive learning cases are often difficult or impossible to compare. This is due to a myriad of different options on what details to include, which aspects are relevant, and on the descriptive approaches employed. Also, these aspects often combine very specific details with more general guidelines or indicate intents and rationales without clarifying their implementation. In this paper we provide a method to describe immersive learning cases that is structured to enable comparisons, yet flexible enough to allow researchers and practitioners to decide which aspects to include. This method leverages a taxonomy that classifies educational aspects at three levels (uses, practices, and strategies) and then utilizes two frameworks, the Immersive Learning Brain and the Immersion Cube, to enable a structured description and interpretation of immersive learning cases. The method is then demonstrated on a published immersive learning case on training for wind turbine maintenance using virtual reality. Applying the method results in a structured artifact, the Immersive Learning Case Sheet, that tags the case with its proximal uses, practices, and strategies, and refines the free text case description to ensure that matching details are included. This contribution is thus a case description method in support of future comparative research of immersive learning cases. We then discuss how the resulting description and interpretation can be leveraged to change immersion learning cases, by enriching them (considering low-effort changes or additions) or innovating (exploring more challenging avenues of transformation). The method holds significant promise to support better-grounded research in immersive learning.
Recently uploaded (20)
EWOCS-I: The catalog of X-ray sources in Westerlund 1 from the Extended Weste...
EWOCS-I: The catalog of X-ray sources in Westerlund 1 from the Extended Weste...
Equivariant neural networks and representation theory
Equivariant neural networks and representation theory
GBSN - Biochemistry (Unit 6) Chemistry of Proteins
GBSN - Biochemistry (Unit 6) Chemistry of Proteins
aziz sancar nobel prize winner: from mardin to nobel
aziz sancar nobel prize winner: from mardin to nobel
THEMATIC APPERCEPTION TEST(TAT) cognitive abilities, creativity, and critic...
THEMATIC APPERCEPTION TEST(TAT) cognitive abilities, creativity, and critic...
Sharlene Leurig - Enabling Onsite Water Use with Net Zero Water
Sharlene Leurig - Enabling Onsite Water Use with Net Zero Water
Authoring a personal GPT for your research and practice: How we created the Q...
Authoring a personal GPT for your research and practice: How we created the Q...
Immersive Learning That Works: Research Grounding and Paths Forward
Immersive Learning That Works: Research Grounding and Paths Forward
Describing and Interpreting an Immersive Learning Case with the Immersion Cub...
Describing and Interpreting an Immersive Learning Case with the Immersion Cub...
Quantum Cryptography
- 1. 20210320 Presented by Dayeong, Kang Designed by Dayeong, Kang Quantum Cryptography ---------------
- 2. @tula3and --------------- Key Distribution A → 0000 + k B → 0001 + k C → 0010 + k D → 0011 + k Then the key is? + A → 0000 B → 0001 C → 0010 D → 0011 = k
- 3. @tula3and --------------- Key Distribution A → 0011 D B → 0100 E C → 0101 F D → 0110 G Then the key is? + A → 0000 B → 0001 C → 0010 D → 0011 = 3
- 4. @tula3and --------------- Keep in Secret Eve will know... Alice Bob Eve ? → Analyze messages → Caesar cipher! → Find k BAD EDG
- 5. @tula3and --------------- RSA There are two keys • Public key: n, e • Private key: n, d • Encrypt with public key 🔒 = 🍎^e mod n • Decrypt with private key 🍎 = 🔒^d mod n Use mathematical algorithms
- 6. @tula3and --------------- RSA - Encryption Public key: n, e • 🔒 = 🍎^e mod n • n = p * q (p > 10^100) • e • 1 < e < Φ(n) • Φ(n) = (p - 1) * (q - 1) • e is relatively prime with Φ(n)
- 7. @tula3and --------------- RSA - Decryption Private key: n, d • 🍎 = 🔒^d mod n • n = p * q • d • (e * d) mod Φ(n) = 1
- 8. @tula3and --------------- QKD Quantum key distribution • Two communications: classical and quantum • BB84 protocol • B92 protocol • E91 protocol (EKERT) Use quantum mechanics
- 9. @tula3and --------------- 1. BB84 Protocol Main principles • No-cloning theorem • Wave function collapse • Measurement is irreversible.
- 10. @tula3and --------------- 1. BB84 Protocol • Basis: {|0>, |1>}, |±> • Each qubit must be in 4 states. • 0: |0>, |+> • 1: |1>, |-> • Alice and Bob choose one basis. • Then, compare their bases. • Remove the qubit if they are different. • The result called shifted key.
- 11. @tula3and --------------- 2. B92 Protocol Alice Bob Basis: {|0>, |1>}, {|0’>, |1’>} {|0 > {|0> {|1’> {|0’> {|1> {|0’> Positions of {|1>, {|1’>
- 12. @tula3and --------------- 3. B91 Protocol (EKERT) Alice Bob Basis: bell states exactly same opposite Which base?
- 13. @tula3and --------------- References • Quantum Computing Explained : McMahon (translated in Korean) • RSA algorithm • Wikipedia: Bell state
- 14. Thank you for listening 0v0 --------------- @tula3and Any Questions?