• Journal of Information Technology Services
• /
• v.8 no.2
• /
• pp.157-171
• /
• 2009

In mobile XML environments, the efficient synchronization technique is required to maintain the consistency of replicated XML data because the same data can be replicated between so many different XML documents. In this paper, we propose a message digest based synchronization technique to maintain the consistency of replicated data between client XML documents and a server XML database in mobile XML environments. The proposed an XML data synchronization technique(XSA) has the advantage of model generality aspect and storage space aspect by using the tuple-based message digest table to detect the data conflicts. The proposed technique can be applicable to the application requiring the consistency of replicated XML data without any restrictions in the heterogeneous(between hierarchical XML documents and relational XML databases) mobile environments.

• Journal of Internet Computing and Services
• /
• v.7 no.5
• /
• pp.1-12
• /
• 2006

In mobile database environments, the efficient synchronization technique is required to maintain the consistency of replicated data because the same data can be replicated between so many different databases, In this paper, we propose a message digest based synchronization technique to maintain the consistency of replicated data between client databases and a server database in mobile environments. The proposed data synchronization technique has the advantage of generality aspect and extensibility aspect by using the tuple-based message digest output to detect the data conflicts.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.357-368
• /
• 2007

This paper proposes the SAMD(Synchronization Algorithms based on Message Digest) algorithm based on message digest in order to data synchronization between a database server and a mobile database. The SAMD algorithm makes the images at the database server and the mobile database using message digest tables and compares two images in order to select the rows needed to synchronization. If two images are different, the synchronization is progressed according to synchronization policy. The SAMD algorithm does not use techniques which are dependent the some database vendor and also triggers, stored procedures and timestamps. The SAMD only uses the standard SQL functions for the synchronization. Therefore the SAMD algorithm is used in any combinations of the database server and the mobile database because the SAMD algorithm is not depended on some database venders. Also the SAMD algorithm shows better performance compared with existing synchronization products.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.885-899
• /
• 1999

We propose a new hash function-SMD(Strengthened Mes-sage Digest) based on the design principle of dedicated hash functions. It processes an arbitrary finite message by 512-bit block and outputs 160 bits digest and has data-dependent rotation characteristic which guar-anteens the strength against existing known attacks. Moreover we also propose a new keyed MAC(Message Authentication Code) constructed by using the proposed hash function. The proposed MAC uses a max-imum keys of 160 bits and hs an output-length less than equal to the hash result. From the viewpoint of performance the proposed MAC is only reduced about 10% comparing to the underlying hash function.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.117-120
• /
• 2002

In this paper, we construct cryptographic accelerators using hardware Implementations of HMACS based on a hash algorithm such as MD5.It is basically a secure version of his previous algorithm, MD4 which is a little faster than MD5 The algorithm takes as Input a message of arbitrary length and produces as output a 128-blt message digest The input is processed In 512-bit blocks In this paper, new architectures, Iterative and full loop, of MD5 have been implemented using Field Programmable Gate Arrays(FPGAS). For the full-loop design, the performance Is about 500Mbps @ 100MHz

• Journal of the Chungcheong Mathematical Society
• /
• v.13 no.2
• /
• pp.87-98
• /
• 2001

In this paper, we study hash function, which will take a message of arbitrary length and produce a massage digest of a specified size. The message digest will then be signed. We have to be careful that the use of a hash function h does not weaken the security of the signature scheme, for it is the message digest that is signed, not the message. It will be necessary for h to satisfy certain properties in order to prevent various forgeries. In order to prevent various type of attack, we require that hash function satisfy collision-free property. In section 1, we introduce some definitions and collision-free properties of hash function. In section 2, we study a discrete log hash function and introduce the main theorem as follows : Theorem Suppose $h:X{\rightarrow}Z$ is a hash function. For any $z{\in}Z$, let $$h^{-1}(z)={\lbrace}x:h(x)=z{\rbrace}$$ and denote $s_z={\mid}h^{-1}(z){\mid}$. Define $$N={\mid}{\lbrace}{\lbrace}x_1,x_2{\rbrace}:h(x_1)=h(x_2){\rbrace}{\mid}$$. Then (1) $\sum\limits_{z{\in}Z}s_z={\mid}x{\mid}$ and the mean of the $s_z$'s is $\bar{s}=\frac{{\mid}X{\mid}}{{\mid}Z{\mid}}$ (2) $N=\sum\limits_{z{\in}Z}{\small{s_z}}C_2=\frac{1}{2}\sum\limits_{z{\in}Z}S_z{^2}-\frac{{\mid}X{\mid}}{2}$. (2) $\sum\limits_{z{\in}Z}(S_z-\bar{s})^2=2N+{\mid}X{\mid}-\frac{{\mid}X{\mid}^2}{{\mid}Z{\mid}}$.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.592-596
• /
• 2002

Can speak that DTD is meta data that define meaning of expressed data on XML document. Therefore, In case DTD information is damaged this information to base security of XML document dangerous. Not that attach digital signature on XML document at send-receive process of XML document in this research, proposed method to attach digital signature to DTD. As reading DTD file to end first, do parsing, and store abstracted element or attribute entitys in hash table. Read hash table and achieve message digest if parsing is ended. Compose and create digital signature with individual key after achievement. When sign digital, problem that create entirely other digest cost because do not examine about order that change at message digest process is happened. This solved by method to create DTD's digital signature using DOM that can embody tree structure for standard structure and document.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1995.11a
• /
• pp.126-137
• /
• 1995

VDM-SL(Vienna Development Method - Specification Language)은 다양한 표준들의 정확한 기술을 위해 제시되고 있는 형식규격어의 하나로서 특히 보안표준의 표현에 적합한 형식규격어이다. 이러한 VDM-SL을 사용하여 보안표준의 표현 및 실행코드 생성의 정확성과 편리성을 제공하기 위한 다양한 도구들이 개발되고 있으며 이들 중 IFAD VDM-SL Toolbox는 가장 많은 기능을 구진 도구이다. 본 논문에서는 IFAD WDM-SL Toolbox를 이용해 해쉬알고리즘의 하나인 MD4 Message Digest Algorithm을 형식적 표현기법으로 나타내고 이를 바탕으로 참조구현 코드를 C++로 생성하는 방법을 설명한다. 또한 형식적 표현기법과 IFAD VDM-SL Toolbox를 이용해 생성된 참조구현코드의 실행 결과를 MD4의 테스트 벡터 (test vector)를 이용하여 RSA사에서 구현한 MD4 알고리즘과 비교 분석하여 형식적 표현기법을 이용하여 생성된 코드의 활용성에 대해 설명하고자 한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.77-84
• /
• 2003

A mobile agent is a program which represents a user in a network and is capable of migrating from one node to another node, performing computations on behalf of the user. In this paper, we suggest a scheme that can safely recover mobile agent using the checkpoint that is saved at the platform that it visited previously and restart its execution from the abnormal termination point of the mobile agent. For security, mobile agent uses its public key to encrypt the checkpoint and the home platform uses the private key of the mobile agent to decrypt the encrypted checkpoints at the recovery stage. When home platform receives the checkpoint of the mobile agent, home platform verifies the checkpoint using message digest. Home platform verifies the correctness of the checkpoint by comparing the message digest generated at checkpoint mention time with the message digest generated at mobile agent recovery time.

• Journal of IKEEE
• /
• v.9 no.1 s.16
• /
• pp.31-39
• /
• 2005

This paper presented new biometrics data transfer model, and use MD5 (Message Digest5) and RSA (Ron Rivest, Adi Shamir, Len Adleman) algorithm to improve biometrics data's security. So, did so that can run user authentication more safely. That is, do so that may input fingerprint among biometrics through client, and transmit processed fingerprint to server. When fingerprint information is transmitted, it uses MD5 algorithm to solve problem that get seized unlawful living body information from outside and information does Digest. And did to pass through process that transmit again this by RSA method. Also, experimented general text data and living body data that is not encoded, transmission speed and security of living body data that encoding and transmit each comparison. By running user authentication through such improved method, is expected to be applied in several. fields by method to simplify certification procedure and is little more correct and stable.