Geodesic
A version of the Diffie--Hellman protocol based on using additional hidden factors
Prikladnaya Diskretnaya Matematika. Supplement, no. 10 (2017), pp. 89-91.

Voir la notice de l'article provenant de la source Math-Net.Ru

We give a version of the classical Diffie–Hellman protocol that uses hidden factors from subgroups of the multiplicative group of the corresponding finite field. To compute a secret data of the protocol, one needs not only to solve the underlined discrete logarithm problem, but simultaneously to compute the orders of some elements of the multiplicative group.
Keywords: cryptography, Diffie–Hellman protocol, hidden factors. 
@article{PDMA_2017_10_a35,
     author = {A. A. Obzor},
     title = {A version of the {Diffie--Hellman} protocol based on using additional hidden factors},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {89--91},
     publisher = {mathdoc},
     number = {10},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2017_10_a35/}
}
TY  - JOUR
AU  - A. A. Obzor
TI  - A version of the Diffie--Hellman protocol based on using additional hidden factors
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2017
SP  - 89
EP  - 91
IS  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2017_10_a35/
LA  - ru
ID  - PDMA_2017_10_a35
ER  - 
%0 Journal Article
%A A. A. Obzor
%T A version of the Diffie--Hellman protocol based on using additional hidden factors
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2017
%P 89-91
%N 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2017_10_a35/
%G ru
%F PDMA_2017_10_a35
A. A. Obzor. A version of the Diffie--Hellman protocol based on using additional hidden factors. Prikladnaya Diskretnaya Matematika. Supplement, no. 10 (2017), pp. 89-91. http://geodesic.mathdoc.fr/item/PDMA_2017_10_a35/

[1] Romankov V. A., “Novaya semanticheski stoikaya sistema shifrovaniya s otkrytym klyuchom na baze RSA”, Prikladnaya diskretnaya matematika, 2015, no. 3(29), 32–40

[2] Roman'kov V. A., “New probabilistic public-key encryption based on the RSA cryptosystem”, Groups, Complexity, Cryptology, 7:2 (2015), 153–156 | MR | Zbl

[3] Roman'kov V. A., “How to make RSA and some other encryptions probabilistic”, 7 Mar 2016, 7 pp., arXiv: 1603.02031v1[cs.CR]

[4] Romankov V. A., “Variant semanticheski stoikogo shifrovaniya na baze RSA”, Vestnik Omskogo un-ta, 2016, no. 3(81), 7–9

[5] Menezes A., van Oorschot P. C., Vanstone S. A., Handbook of Applied Cryptography, CRC Press, Boca Raton–London–New York–Washington, 1996, 816 pp. | MR

[6] Romankov V. A., Vvedenie v kriptografiyu, Forum, M., 2012, 239 pp.

[7] Romankov V. A., Algebraicheskaya kriptografiya, OmGU, Omsk, 2013, 135 pp.