Abstract
In this paper the key agreement protocol is given and the applicationof it in Braid groups is suggested. The one way of protocol is being justified.
Highlights
Šiuo atveju protokolo saugumas grindžiamas matricine lygtimi XQr = B · X, kai X – nežinoma matrica, r – nežinomas naturalusis skaicius ir šiu dvieju uždaviniu atskirti negalima
The one way of protocol is being justified
Summary
Darbe siuloma RAP realizacija remiasi baigtine multiplikacine grupe . 1. „Aldona“ laisvai pasirenka α ∈ G1 ir suformuoja žodi ω1 = α · θ · α−1, kuri homomorfizmo pagalba atvaizduoja i matrica V1 = φ(ω1) = φ(α) · φ(θ) · φ(α−1) = AQA−1. 3. „Bronius“ pasirenka β ∈ G2 ir konstruoja žodi ω2 = βθβ−1, kuris homomorfizmo pagalba atvaizduojamas i matrica V2 = φ (ω2) = BQB−1. 3. Braid grupeir jos ivaizdžiai Tarkime, kad turime n sruogu ri , tuomet elementai σi , i = 1, 2, ..., n − 1 apibrežia Braid grupe [3]. Pasirinkus grupe G = Br2n, G1 = {σi : i n − 1} ⊂ G, G2 = {σi : i n + 1} ⊂ G, galime taikyti pasiulyta raktu apsikeitimo protokola.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.