hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An alternative Diffie-Hellman protocol
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR - Center for Applied Intelligent Systems Research. (SA3L, HMC2, CyRev, SmartSafe)ORCID iD: 0000-0001-9307-9421
2020 (English)In: Cryptography, E-ISSN 2410-387X, Vol. 4, no 1, article id 5Article in journal (Refereed) Published
Abstract [en]

The Diffie–Hellman protocol, ingenious in its simplicity, is still the major solution in protocols for generating a shared secret in cryptography for e-trading and many other applications after an impressive number of decades. However, lately, the threat from a future quantum computer has prompted successors resilient to quantum computer-based attacks. Here, an algorithm similar to Diffie–Hellman is presented. In contrast to the classic Diffie–Hellman, it involves floating point numbers of arbitrary size in the generation of a shared secret. This can, in turn, be used for encrypted communication based on symmetric cyphers. The validity of the algorithm is verified by proving that a vital part of the algorithm satisfies a one-way property. The decimal part is deployed for the one-way function in a way that makes the protocol a post-quantum key generation procedure. This is concluded from the fact that there is, as of yet, no quantum computer algorithm reverse engineering the one-way function. An example illustrating the use of the protocol in combination with XOR encryption is given. © 2020 MDPI (Basel, Switzerland)

Place, publisher, year, edition, pages
Basel: MDPI, 2020. Vol. 4, no 1, article id 5
Keywords [en]
encryption key generation protocol, key exchange, shared secret, decimal part, one-way function, real numbers
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-41725DOI: 10.3390/cryptography4010005OAI: oai:DiVA.org:hh-41725DiVA, id: diva2:1405995
Projects
SmartSafe
Funder
Knowledge Foundation
Note

Other funding: Halmstad University, grant number F2019/151. The APC was funded by Halmstad University.

Available from: 2020-02-28 Created: 2020-02-28 Last updated: 2020-03-03Bibliographically approved

Open Access in DiVA

fulltext(235 kB)18 downloads
File information
File name FULLTEXT01.pdfFile size 235 kBChecksum SHA-512
dcfcef91883b13bfba74ee20b877874ac4c8b9e044f1e752d5128c9dd4c09b9182f43c94c9d7529a30a774e6d77fbbfaa6e45e2c7e3a8d2bd8eec97192a280ce
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Järpe, Eric

Search in DiVA

By author/editor
Järpe, Eric
By organisation
CAISR - Center for Applied Intelligent Systems Research
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 18 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 22 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf