Three-pass protocol
메모
Elliptic curve analog of the Massey-Omura system. Let $q=p^{n}$ be large, let $E$ be an elliptic curve defined over $\mathrm{GF}(q)$, and let $N=|E|$. Here $q$ and $E$ are fixed and publicly known, as is $N$. We also have a publicly known imbedding $m \mapsto P_{m}$ of plaintexts as points of $E$. Suppose that user $A$ wants to send user $B$ a message $m$. She chooses a random integer $c$ satisfying $0<c<N$ and g.c.d. $(c, N)=1$, and transmits $c P_{m}$. Next, $B$ chooses a random integer $d$ with the same properties, and transmits $d\left(c P_{m}\right)$ to $A$. Then $A$ transmits $c^{\prime}\left(d c P_{m}\right)=d P_{m}$ back to $B$, where $c^{\prime} c \equiv 1$ $(\bmod N)$. Finally, $B$ computes $d^{\prime} d P_{m}=P_{m}$, where $d^{\prime} d \equiv 1(\bmod N)$.
노트
말뭉치
- It is called a three-pass protocol because the sender and the receiver exchange three encrypted messages.[1]
- The first three-pass protocol was developed by Adi Shamir circa 1980, and is described in more detail in a later section.[1]
- The basic concept of the three-pass protocol is that each party has a private encryption key and a private decryption key.[1]
- The first three-pass protocol was the Shamir three-pass protocol developed circa in 1980.[1]
- In particular, the traditional Massey-Omura system is an exponential system which uses a prime modulus.[2]
- A stronger version of the enhanced Massey-Omura system (EMO-2) adds a digital signature to the EMO-1 system.[2]
- The enhanced Massey-Omura system (EMO-1) replaces the prime modulus with a composite which is the product of two distinct (large) primes.[3]
- The three-pass protocol uses commutative encryption to let two people communicate privately without having to exchange keys in advance.[4]
- The three-pass protocol is a cryptographic protocol that allows two people to communicate privately without having to exchange keys in advance.[4]
- The three-pass protocol does not (and generally cannot) provide authentication.[4]
- Introduction to ECC September 11, 2013 7 / 23 Solution 2: The three-pass protocol: Alice attaches her lock to the box and sends it to Bob.[5]
- The three-pass protocol: Alice attaches her lock to the box and sends it to Bob.[5]
- Some of the major systems based on this premise include the Diffie-Hellman key exchange system, the Massey-Omura cryptosystem, and the ElGamal cryptosystem.[6]
- Massey–Omura cryptosystem has some features that make it vulnerable to cryptanalysts.[7]
- In this research will be applied Three-Pass Protocol scheme using the Massey-Omura algorithm to secure files.[8]
- Therefore, it can be concluded that Massey-Omura algorithm with Three-Pass Protocol scheme in the Android platform is running well and can be implemented as an alternative for data security.[9]
소스
- ↑ 이동: 1.0 1.1 1.2 1.3 Three-pass protocol
- ↑ 이동: 2.0 2.1 [1]
- ↑ CiteSeerX — Enhancing the Massey-Omura Cryptosystem
- ↑ 이동: 4.0 4.1 4.2 'three-pass-protocol' tag wiki
- ↑ 이동: 5.0 5.1 Introduction to
- ↑ Fields of the Order 2^n
- ↑ Hamza Mutaher, Pradeep Kumar
- ↑ Analysis of File Security with Three-Pass Protocol Scheme Using Massey-Omura Algorithm In Android
- ↑ Analisis Algoritma Massey-Omura Pada Three Pass Protocol Untuk Pengamanan File Berbasis Android
메타데이터
위키데이터
- ID : Q1907602
Spacy 패턴 목록
- [{'LOWER': 'three'}, {'OP': '*'}, {'LOWER': 'pass'}, {'LEMMA': 'protocol'}]
- [{'LOWER': 'massey'}, {'OP': '*'}, {'LOWER': 'omura'}, {'LEMMA': 'system'}]
- [{'LOWER': 'massey'}, {'OP': '*'}, {'LOWER': 'omura'}, {'LEMMA': 'cryptosystem'}]