Michael Anshel

New Key Agreement Protocols in Braid Group Cryptography

Key agreement protocols are presented whose security is based on the difficulty of inverting one-way functions derived from hard problems for braid groups. Efficient/low cost algorithms for key transfer/ extraction are presented. Attacks/security parameters are discussed.

Reducing medical errors using secure RFID technology

RFID technology can successfully be used to reduce medical errors. This technology can aid in the accurate matching of patients with their medications and treatments. The enthusiasm for using RFID technology in medical settings has been tempered by privacy concerns. We discuss new encryption methods that address these concerns.

A Linear Time Matrix Key Agreement Protocol Over Small Finite Fields

This note introduces Braid–Diffie–Hellman (BDH), a key agreement protocol employing matrices over small finite fields. The method employs colored Burau matrices and a refinement of a Diffie–Hellman type protocol. We discuss the security and examine performance parameters of BDH which permit linear time execution on platforms supporting basic algebraic primitives.

Topological quantum scheme based on quantum walk

Topological quantum computation provides efficiency with fault-tolerant and error-correction to overcome decoherence problem. Here we investigate a class of topological quantum computation device. We discuss a method of constructing topological quantum scheme based on quantum walk for the state space.

A simple secure quantum authorization scheme

Based on the law of quantum mechanics we present a simple authorization scheme: Quauth. The description of the scheme is given in details. The authorization is accomplished through a quantum channel by one way communication. We show that eavesdropper gets no information about key no matter how many times s/he is listening on the channel. The scheme is robust against both the passive and active attacks. By induction we prove that the scheme is information theoretically secure.

A Fast lattice-based polynomial digital signature system for m-commerce

The privacy and data integrity are not guaranteed in current wireless communications due to the security hole inside the Wireless Application Protocol (WAP) version 1.2 gateway. One of the remedies is to provide an end-to-end security in m-commerce by applying application level security on top of current WAP1.2. The traditional security technologies like RSA and ECC applied on enterprises server are not practical for wireless devices because wireless devices have relatively weak computation power and limited memory compared with server. In this paper, we developed a lattice based polynomial digital signature system based on NTRUs Polynomial Authentication and Signature Scheme (PASS), which enabled the feasibility of applying high-level security on both server and wireless device sides.

Partitions, Egyptian fractions, and free products of finite abelian groups

Some computational questions concerning free products of finite abelian groups are reduced to questions in additive number theory involving partitions and Egyptian fractions. These in turn are resolved employing the Mathematica TM computer system