<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-05-02T10:20:53Z</responseDate>
  <request metadataPrefix="oai_dc" identifier="oai:meral.edu.mm:recid/5526" verb="GetRecord">https://meral.edu.mm/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:meral.edu.mm:recid/5526</identifier>
        <datestamp>2021-12-13T01:15:57Z</datestamp>
        <setSpec>1582963413512:1596119372420</setSpec>
        <setSpec>user-ytu</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Enhanced Honey Encryption Algorithm for Increasing Message Space against Brute Force Attack</dc:title>
          <dc:creator>Khin Su Myat Moe</dc:creator>
          <dc:creator>Thanda Win</dc:creator>
          <dc:description>Abstract –In the era of digitization, data security is a vital role in
message transmission and all systems that deal with users require
stronger encryption techniques that against brute force attack.
Honey encryption (HE) algorithm is a user data protection
algorithm that can deceive the attackers from unauthorized
access to user, database and websites. The main part of
conventional HE is distribution transforming encoder (DTE).
However, the current DTE process using cumulative distribution
function (CDF) has the weakness in message space limitation
because CDF cannot solve the probability theory in more than
four messages. So, we propose a new method in DTE process
using discrete distribution function in order to solve message
space limitation problem. In our proposed honeywords
generation method, the current weakness of existing honeywords
generation method such as storage overhead problem can be
solved. In this paper, we also describe the case studies
calculation of DTE in order to prove that new DTE process has
no message space limitation and mathematical model using
discrete distribution function for DTE process facilitates the
distribution probability theory.</dc:description>
          <dc:date>2018-07-18</dc:date>
          <dc:identifier>http://hdl.handle.net/20.500.12678/0000005526</dc:identifier>
          <dc:identifier>https://meral.edu.mm/records/5526</dc:identifier>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
