MOBS (Matrices Over Bit Strings) public key exchange

Nael Rahman; Vladimir Shpilrain

REVIEW

MOBS (Matrices Over Bit Strings) public key exchange

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.01116 v1 pith:6A3MWD5L submitted 2021-06-02 cs.CR math.GR

MOBS (Matrices Over Bit Strings) public key exchange

Nael Rahman , Vladimir Shpilrain This is my paper

classification cs.CR math.GR

keywords matricesstringsbooleandiffie-hellman-likeexchangeoperationplaceprotocols

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

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.

MOBS (Matrices Over Bit Strings) public key exchange

discussion (0)