Research publications highlights
Google Scholar Citations count: 201, H-index: 4, {Sole-author count , co- author count} : {5 , 1}. Cited in graduate level-text book: Protocols for Secure Electronic Commerce – third edition; preceding versions used by universities.
(Known examples of) Citations in American patents: US11901071B2, US11688516B2, US11894129B1, US11923086B2, US11923087B2, US11996194B2, US11908578B2, US11682489B2, US11935651B2, US10891383B2. (Example: https://patents.google.com/patent/US11901071B2/en)
(Known examples of) Patent citations outside of the US:
(European) https://patents.google.com/patent/EP3614645A1/en, (European) https://register.epo.org/application?number=EP17718905&tab=main, (Chinese) https://patents.google.com/patent/CN108885761B/de
(Known examples of) citation in books:Multidimensional Strategic Outlook on Global Competitive Energy Economics a… – Google Books, Blockchain Technology – Google Books, Global Perspectives on the Applications of Computer Vision in Cybersecurity – Google Books, Convergence of Blockchain and Internet of Things in Healthcare – Google Books, Blockchain for Business – Google Books, Blockchain and Web 3.0 – Google Books
Legacy Version of this page follows. The above is dated: September/16/2024
SOLELY AUTHORED INTL. RESEARCH PAPERS (5)
On the Imminent Advent of Botnet Powered Cracking
2th IEEE International Conference on Collaboration and Internet Computing. Pittsburg, U.S.A
This paper improves upon the basic technique of splitting a brute force among bots (described in my second paper “Usage of botnets for high speed MD5 hash cracking”). This article describes an integrated constant cost algorithm of splitting work when using any combination of an arbitary set of work loads defined by : Markovian filters and/or Probabilistic Context Free Grammar, combined with dictionary mangling, and both naive and masked brute force. The algorithm ensures that work load distribution is equal, regardless of the varying amounts of computing power possessed by each node (in the millions). Lost work can be recovered, added to the job pool and be assigned to other nodes regardless of the nature of the initial lost work without losing homogeneity in work assignment. Lost work can be guranteed to be recovered within a specified duration. Comparisons with hash rates of cloud-based cracking are also discussed.
Human computer interaction advancement by usage of smart phones for motion tracking and remote operation
14th IEEE International Conference on Scalable computing and communication. Bali, Indonesia
This paper describes a proof-of-concept Human Computer Interaction system not requiring a connecting network between the device and the computer. Also, this method doesn’t require construction or usage of custom devices of any sort.
Bitcoin mining acceleration and performance quantification
27th IEEE Canadian Conference on Electrical and Computer Engineering. Toronto, Canada
This paper discusses methods of contextually faster Bitcoin mining technique by usage of both the CPUs and GPUs of miners in mining pools and quantifies greater hash rates achieved. This paper also discusses possible exploitation of a similar system (Litecoin) by Botnet herders.
Accolades:
- Paper registration fee of $750 and mandatory attendance of conference waived
- Most downloaded paper of conference (1st out of 257 papers)
- Nominated “Award Quality”
Usage of Botnets for high speed MD5 hash Cracking
3rd IEEE International Conference on Innovative Computing Technology. London, Britain
This paper quantifies the advantage of using the CPU simultaneously with the GPU for hash cracking and describes how a potential attacker, with respect to the size of the botnet used, could come to possess capabilities of hash rates of at least greater than 11 times the rate of the world’s fastest GPU cluster based MD5 brute forcing machine with no investment. This also addresses a bottleneck in my previous paper by presenting a constant cost function for work break down, distribution and intake.
Accolades:
- Conference paper download count rank: 18th out of 107 papers
Cracking MD5 hashes by simultaneous usage of Multiple GPUs and CPUs over multiple machines in a network
2nd International Conference on Advances in Electronics, Electrical and Computer Engineering. Dehradun, India
This paper presents an efficient method of maximally using computing resources by simultaneously using Graphics Processing Units (GPUs) and Central Processing Units (CPUs) of machines over a network for MD5 hash brute forcing, and compares its efficiency against using networked GPUs alone. Methods to achieve work distribution without the use of custom hardware is also described.
Accolades:
- Conference paper download count rank: 13th out of 82 papers
- Journal Appearance (UACEE International Journal of Advances in Computer Science and its Applications)
Download Text from SeekDl Library Read More
CO- AUTHORED INTERNATIONAL RESEARCH PAPERS (1)
An NFC featured three level authentication system for tenable transaction and abridgment of ATM card blocking intricacies
6th International Conference and Workshop on Computing and Communication. Vancouver, Canada
Using a three factor authentication scheme employing NFC (Near Field Communication: an emerging technology evolved from a combination of contact-less identification and interconnection providing data exchange), Dash Matrix Algorithm and One-time password, we describe and quantity the potential to overcome common transaction liabilities (brute force attack, shoulder surfing, skimming of ATM cards, etc.). The auxiliary feature of blocking ATM card is implemented using a QR code authentication scheme and NFC technology, implemented both in NFC enabled phones and non-NFC enabled phones (with the help of an NFC transmitter, receiver and Bluetooth). The proposed system, therefore, ensures both secure usage of ATM cards and cost effectiveness by utility of novel and increasingly common technology, when also simultaneously proving to be user friendly.
Download Text from IEEE Xplore