MOBS (Matrices Over Bit Strings) public key exchange
classification
💻 cs.CR
math.GR
keywords
matricesstringsbooleandiffie-hellman-likeexchangeoperationplaceprotocols
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.