researcher

A. Mahalanobis

27 papers hereh-index 9273 citations45 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author12
first author3
middle author2
last author8

Across the 25 of 27 papers where every author was matched, so the position is known.

fields

cs.CR16
math.GR10
cs.IT1

same name

A. Mahalanobis — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20062026

most citedA new method for solving the elliptic curve discrete logarithm problem

8 citations · 32 across the 25 of their papers we have counts for

collaborators

Showing 2007Show all

2 papers · 1 filter

cs.CR2007

A simple generalization of the ElGamal cryptosystem to non-abelian groups II

Ayan Mahalanobis

This is a study of the MOR cryptosystem using the special linear group over finite fields. The automorphism group of the special linear group is analyzed for this purpose. At our c…

cs.CR2007★ 4 cited

A note on using finite non-abelian $p$ -groups in the MOR cryptosystem

Ayan Mahalanobis

The MOR cryptosystem is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a $p$ -group, a cryptosystem was built by this author in 'A simple general…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

A simple generalization of the ElGamal cryptosystem to non-abelian groups II

A note on using finite non-abelian p-groups in the MOR cryptosystem

A note on using finite non-abelian $p$ -groups in the MOR cryptosystem