◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Ariffin

6 papers hereh-index 15769 citations117 works total

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

author position
  • sole author2
  • first author3
  • last author1

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

fields
  • cs.CR5
  • cs.IT1
same name
  • M. Ariffin — 1 paper, h 0

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
20102014
most citedRabin-p Cryptosystem: Practical and Efficient Method for Rabin based Encryption Scheme

6 citations · 13 across the 6 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.CR2011★ 2 cited

Security Features of an Asymmetric Cryptosystem based on the Diophantine Equation Hard Problem

M. R. K. Ariffin, M. A. Asbullah, N. A. Abu

The Diophantine Equation Hard Problem (DEHP) is a potential cryptographic problem on the Diophantine equation U=i=1∑n​Vi​xi​. A proper implementation of DEHP…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.