MOBS (Matrices Over Bit Strings) public key exchange

06/02/2021
by   Nael Rahman, et al.
0

We use matrices over bit strings as platforms for Diffie-Hellman-like public key exchange protocols. When multiplying matrices like that, we use Boolean OR operation on bit strings in place of addition and Boolean AND operation in place of multiplication. As a result, (1) computations with these matrices are very efficient; (2) standard methods of attacking Diffie-Hellman-like protocols are not applicable.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/14/2018

Tropical cryptography II: extensions by homomorphisms

We use extensions of tropical algebras as platforms for very efficient p...
09/01/2020

MAKE: a Matrix Action Key Exchange

We offer a public key exchange protocol based on a semidirect product of...
04/27/2020

Computing the Boolean product of two n× n Boolean matrices using O(n^2) mechanical operation

We study the problem of determining the Boolean product of two n× n Bool...
09/10/2018

On Finding a First-Order Sentence Consistent with a Sample of Strings

We investigate the following problem: given a sample of classified strin...
10/28/2016

Learnable Visual Markers

We propose a new approach to designing visual markers (analogous to QR-c...
04/09/2021

Secret Key Distribution Protocols Based on Self-Powered Timekeeping Devices

In this paper, we present novel secret key distribution protocols using ...
04/15/2019

IoD-Crypt: A Lightweight Cryptographic Framework for Internet of Drones

Internet of Drones (IoD) is expected to play a central role in many civi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.