KR20160083823A - Method, server and computer program for transmitting binary data - Google Patents

Abstract

A method for transmitting message comprise steps of: encoding the message using predetermined letter codes; and transmitting the message to a receiver terminal. The letter code expresses each letter as N bit binary data, and N bit can be 12 bit, 13 bit, 14 bit, or 15 bit. The encoding step comprises the steps of: expressing a message in binary data; splitting binary data into N bit binary data; matching the split N bit binary data to corresponding letters of the letter code; and converting the matched letters into 16 bit binary data.

Description

METHOD, SERVER AND COMPUTER PROGRAM FOR TRANSMITTING BINARY DATA BACKGROUND OF THE INVENTION 1. Field of the Invention [

The present invention relates to a binary data transmission method, a server, and a computer program.

In recent years, there has been an increasing tendency to apply security by encrypting messages in order to prevent information from being leaked through hacking or smashing. When encrypting a text message, the text message is represented by binary data. Since the binary data can not be transmitted in a text-based service system such as SMS, MMS, or the web, it is converted into alphabet, numerals, do. In this case, the base64 coding method is generally used for conversion. When the base64 modified code is transmitted in the text message system, UCS2, UTF-16, etc. are processed in the domestic system in order to process Hangul. In this process, the part included in the ASCII code such as alphabets, numbers, and common symbols is processed as 2 bytes, and the data capacity of the corresponding part is doubled.

In connection with the data encryption method, Korean Unexamined Patent Publication No. 2008-0018768 discloses a data encryption method and apparatus, in which bits included in each data unit are allocated to a plurality of data blocks based on bit positions in the data units , And after encrypting the data blocks, error-correction-encodes the encrypted data blocks according to different coding rates, thereby collecting only important bits in each data unit and managing them separately.

A server and a computer program capable of efficiently transmitting an encrypted message by minimizing a capacity increase of a message in the transmission of an encrypted message. A server and a computer program for dividing a message and minimizing an increase in capacity of an encrypted message and transmitting the message to a Short Message Service (SMS), a Long Message Service (LMS), or a Multimedia Message Service (MMS) do. A binary data transmission method, a server, and a computer program capable of efficiently transmitting binary data in a text message transmission system. A server, and a computer program in which compatibility with a conventional text message transmission system is maintained. A binary data transmission method, a server and a computer program which can apply the existing encryption algorithm as it is.

According to an aspect of the present invention, there is provided a method of transmitting a message, the method including: encoding the message using a predetermined character code; and transmitting the message to a receiving terminal Wherein the character code is a character representation of N bits of binary data, and the N bits are any one of 12 bits, 13 bits, 14 bits, or 15 bits, and the encoding step comprises: . The method comprising the steps of: dividing the binary data into N-bit binary data; matching the divided N-bit binary data to a corresponding character of the character code; and converting the matched character into 16-bit binary data , A message transmission method can be provided.

Another embodiment of the present invention is a computer program stored in a medium for transmitting a message in combination with a terminal, the computer program comprising a sequence of instructions for encoding the message using a predetermined character code and for transmitting the message to a receiving terminal Wherein the character code is a character representation of N bits of binary data and the N bits are any one of 12 bits, 13 bits, 14 bits, and 15 bits, and wherein the computer program causes the message to be converted into binary data A sequence of instructions to divide the binary data into N-bit binary data, to match the divided N-bit binary data to a corresponding character in the character code, and to convert the matched character into 16-bit binary data And a computer program product.

According to another embodiment of the present invention, there is provided a server for transmitting a message, comprising: an encoding unit encoding the message using a predetermined character code; and a transmitting unit transmitting the message to a receiving terminal, Wherein the N bits are represented by 12 bits, 13 bits, 14 bits, and 15 bits, and the encoding unit expresses the message as binary data and converts the binary data into N Bit binary data, the divided N-bit binary data is matched with the corresponding character of the character code, and the matched character is converted into 16-bit binary data.

The above-described task solution is merely exemplary and should not be construed as limiting the present invention. In addition to the exemplary embodiments described above, there may be additional embodiments described in the drawings and the detailed description of the invention.

According to any one of the above-mentioned objects of the present invention, it is possible to provide a binary data transmission method, a server, and a computer program capable of efficiently transmitting an encrypted message by minimizing a capacity increase of a message in encryption of a message. A server, and a computer program for dividing a message (in the case of a message exceeding the SMS capacity) and minimizing an increase in capacity of an encrypted message and transmitting the message. A binary data transmission method, a server and a computer program which can maintain the compatibility with the existing text message transmission system and can apply the existing encryption algorithm can be provided.

1 is a flowchart illustrating a method of transmitting a message according to an exemplary embodiment of the present invention.
2 is a diagram for explaining a conventional method of encoding an encrypted message (binary data).
3 is a diagram for explaining an encoding method using a Hangul code according to an embodiment of the present invention.
4 is a diagram for further illustrating an encoding method using a Hangul code according to an embodiment of the present invention.
5 is a diagram for explaining an encoding method using a Hanja code according to another embodiment of the present invention.
6 is a diagram for explaining an encoding method using a mixed code of a Hangul code and a Hanja code according to another embodiment of the present invention.
7 is a diagram for further illustrating an encoding method using a mixed code of a Hanja code and a Hanja code according to another embodiment of the present invention.
8 is a diagram for explaining a process of decoding a message encoded using a Hangul code according to an embodiment of the present invention.
9 is a view for comparing message transmission efficiency according to an encoding method according to an embodiment of the present invention.
10 is a configuration diagram of a message transmission server according to an embodiment of the present invention.
11 is a view for explaining an SMS message generated according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings, which will be readily apparent to those skilled in the art. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. In order to clearly illustrate the present invention, parts not related to the description are omitted, and similar parts are denoted by like reference characters throughout the specification.

Throughout the specification, when a part is referred to as being "connected" to another part, it includes not only "directly connected" but also "electrically connected" with another part in between . Also, when an element is referred to as "including" an element, it is to be understood that the element may include other elements as well as other elements, And does not preclude the presence or addition of one or more other features, integers, steps, operations, components, parts, or combinations thereof.

In this specification, the term " part " includes a unit realized by hardware, a unit realized by software, and a unit realized by using both. Further, one unit may be implemented using two or more hardware, or two or more units may be implemented by one hardware.

In this specification, some of the operations or functions described as being performed by the terminal or the device may be performed in the server connected to the terminal or the device instead. Similarly, some of the operations or functions described as being performed by the server may also be performed on a terminal or device connected to the server.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a flowchart illustrating a method of transmitting a message in a message transmission server according to an embodiment of the present invention. Referring to FIG. 1, in step S120, a message is encrypted or binary data (image, etc.) is input. Encrypted messages are represented by binary data. In the present invention, the message encryption method and the encryption key format are not limited to specific methods, and may include a public key, a symmetric key, a hybrid type, an OTP scheme, and the like.

When encrypting a message, the length of the encrypted message may be increased according to the encryption scheme. For example, in the case of block encryption, the length of the message may increase according to the length of the block. The encryption processing terminal can be changed according to the structure such as the originating phone, the origin server, the relay server, etc., and is not limited to a specific terminal in the present invention.

In step S140, the encrypted message or the inputted binary data is encoded. In an embodiment of the present invention, a message can be encoded using a predetermined character code. The predetermined character code may include, but is not limited to, a Hangul code, a Hanja code, and a mixed code of Hangul code and Hanja code as character codes using more than 12 bits of 2 bytes at the time of code conversion.

Encrypted messages are represented as binary data, and since binary data can not be transmitted in a text-based service system by itself, encoding is performed so as to be converted into characters such as alphabets and Korean characters for transmission in a text-based service system.

The encoding method according to the related art and the encoding method using Hangul code, Hanja code and mixed code according to an embodiment of the present invention will be described in detail with reference to FIG. 2 to FIG.

In step S160, the message is divided into predetermined lengths to generate a Short Message Service (SMS) message, a Long Message Service (LMS) message, or a Multimedia Message Service (MMS) message. Hereinafter, the SMS message will be mainly described. The division length of the message can be set within the capacity range that can be transmitted by the SMS message. The message may be a message that includes an encryption portion and a plain portion, and the user may view the plain portion of the received character by predicting the contents of the character before decrypting by sending the encryption portion along with the plain portion.

The generated SMS message includes a tag for distinguishing the encrypted portion and the plain text portion, a flag for distinguishing the first SMS and the second SMS, an index indicating the order of SMS, an overall length of the message, The length of the segmented message, and the like.

In an embodiment of the present invention, a first SMS message including a tag, a flag, an entire length and a divided length may be generated, and a second and subsequent SMS messages including a tag, a flag, an index and a divided length may be generated But is not limited thereto.

The insertion order of tags, flags, etc., can be changed according to the ease of implementation, and it is also possible to set a rule in the plain text part so that the plain text part replaces the tag function. When a CAPTCHA is specified in the header, the tag, flag, length, and the like can be described in the header. When multiple security messages are simultaneously sent to one recipient, [msg_id], etc., may be inserted in the SMS message so that security messages can be distinguished.

If the message exceeds the capacity of the SMS, the message is transmitted not by the MMS but by the SMS message, so that the message can be transmitted even when one of the terminals is not connected to the data network or the like. Although SMS is exemplified in the above description, it can be used in LMS and MMS in the same way.

In step S180, the generated SMS / MMS / LMS message is transmitted. The transmission of the SMS / MMS / LMS message can be performed using an existing message transmission system, and the receiving terminal can receive the divided message and combine it into one encrypted message and decode it.

In the above description, steps S120 to S180 may be further divided into further steps or combined into fewer steps, according to an embodiment of the present invention. Also, some of the steps may be omitted as necessary, and the order between the steps may be changed.

Hereinafter, a method of encoding a message will be described in detail with reference to FIG. 2 to FIG.

2 is a diagram for explaining a message encoding method as a conventional technique. Referring to FIG. 2, in steps S200 and S220, a general text message is encrypted. The encrypted message is represented by binary data. In step S240, Base64 conversion is performed to convert the binary data into alphabets, numbers, and two symbols (+, /) using the Base 64 table. The Base 64 table matches different alphabets, numbers, and symbols for each of the 6-bit binaries. Therefore, the encrypted binary data is arranged in six bits, and the binary data is matched to the Base 64 table with alphabets, numbers, and symbols corresponding to the six bits, so that the binary data can be represented by letters such as alphabets. Since the computer processes binary data in units of 8 bits (1 byte), the corresponding alphabet, number, and symbol are re-matched to the ASCII code (alphabet, number, and symbols are matched to 8-bit binary) To be represented by an 8-bit binary. In this process, since the 6-bit binary data is represented by 8 bits, the capacity of the message is increased by 8/6 times.

If the message contains only numbers and alphabets, it can be converted to ASCII code. However, if the message contains characters other than alphabets, numbers and symbols, it can not correspond to ASCII codes. The user must perform the conversion again using the code shown in FIG. Therefore, the UCS2 conversion is performed again using the UCS2 code in the base 64 switched message in step S260. The UCS2 code is a compatible code commonly used for processing Hangul in a text-based system, and matches characters such as alphabets and Hangul characters for each binary of 2 bytes (= 16 bits). Since each character of a message is represented by a 2-byte binary at the time of UCS2 conversion, each character corresponding to 8 bits (1 byte) is represented by 16 bits, thereby doubling the character capacity of the encrypted portion of the message.

In step S280, the UCS2 switched message is transmitted to the receiving terminal.

Referring to the reference numeral 200, in the binary data aspect, the encrypted message is listed as binary data, and six bits of the listed binary data are allocated to generate a six bit array for Base 64 conversion. The generated 6-bit arrays match the alphabets, numbers, and symbols in the Base 64 table, and the matched letters, numbers, and symbols are represented in 8-bit binary corresponding to the ASCII code. Therefore, in this process, the message capacity increases 8/6 times. Then, when the message is converted to UCS2 including Hangul, each character is represented by a 2-byte (16-bit) binary corresponding to the UCS2 code, so that the capacity of the message is doubled from that of Base64 conversion.

As described above, in the conventional encoding method, 16 bits are used to convert the encrypted binary data to the UCS2 after conversion to Base64 and consequently to transfer the 6 bits of binary. Therefore, the bit efficiency at transmission is 6/16, which is inefficient . Hereinafter, an encoding method according to an embodiment of the present invention using 12 bits or more out of 16 bits, that is, a bit efficiency at transmission is 12/16 or more will be described.

3 is a diagram for explaining an encoding method using a Hangul code according to an embodiment of the present invention. Referring to FIG. 3, the messages input in steps S300 and S320 are encrypted, and this process is similar to the prior art shown in FIG. Thereafter, in step S340, the encrypted message is encoded using Hangul code.

The procedure of the Hangul code conversion in step S340 will be described with reference to the reference numeral 300. [ The encrypted binary data is divided into units of 12 bits (302). Each of the 12 bits of binary data is matched to the Hangeul character and the matched Hangeul character is represented by corresponding 16 bits of binary code in the USC2 code. In the case of the encoding using the Hangul code according to an embodiment of the present invention, the Base 64 conversion process 304 in the prior art is ignored. In the case of encoding using Hangul code, the transmission efficiency of the message is 12/16 because it uses 16 bits to transmit 12 bits.

The Hangul code contains 11172 Hangul characters, <11172 <, so that up to 13 bits can be expressed using Hangul code. In the embodiment shown in FIG. 3, a case where the code is divided into units of 12 bits and is matched to the code is described. However, the unit may be divided into units of 13 bits and matched to the code. In this case, Message can be transmitted.

Next, UCS2 conversion is performed in step S360. Since the 16 bits are used per character through zero padding when switching from Hangul to S340, there is no increase in message capacity even if UCS2 conversion is performed. Thereafter, in step 380, a message is transmitted. Hereinafter, an encoding method using Hangul codes will be described in more detail with reference to FIG.

4 is a diagram for further illustrating an encoding method using a Hangul code according to an embodiment of the present invention. Referring to FIG. 4, the binary data listed after encryption is divided by 12 bits (400). Since the computer processes the binary data in units of bytes, a 2-byte (16-bit) binary array is generated by padding 4-bit zeros to the divided 12-bit binary data (420, 440). Thereafter, the binary data from 0 to 4095 are sequentially matched to the Hangul code 460, and then the divided 2-byte binary can be displayed in the corresponding Hangul character. In the process of representing the displayed Hangul characters as 2 bytes of binary data corresponding to the UCS2 code table, the arrangement of binary data is different (480) but the message capacity does not change.

As described above, in the case of encoding using the Hangul code, since the message capacity is increased by 16/12 times and there is no increase in the message capacity even after switching to the UCS2 code, the transmission efficiency is 12/16, It can be seen that the transmission efficiency is increased. When the binary data is divided into units of 13 bits and matched to Hangul codes, the transmission efficiency is 13/16, which enables more efficient transmission.

5 is a diagram for explaining an encoding method using a Hanja code according to another embodiment of the present invention. Referring to FIG. 5, a message is encrypted in steps S500 and S520, and the process up to here is similar to the prior art. In step S540, encoding is performed using the Hanja code. In the case of Hanja code, binary data can be expressed up to 14 bits. Therefore, referring to reference numeral 500, binary data listed after encryption may be divided into 14 bits, and then 2-bit zeros may be padded to match a Chinese character code. At this time, the message capacity increases by 16/14 times due to 2-bit zero padding. Even in the case of the encoding method using the Hanja code, the Base 64 conversion process is ignored (504). The matched kanji are represented by UCS2 code, but the capacity of the message is not increased (506). In the case of using the Hanja code, 16 bits are used for transmitting 14 bits of binary, so that the transmission efficiency is 14/16, which means that the transmission efficiency is improved as compared with the case using the conventional technology and Hangul code.

6 is a diagram for explaining an encoding method using a mixed code of a Hangul code and a Hanja code according to another embodiment of the present invention. Referring to FIG. 6, in step S600 and S620, a message is encrypted using the same technique as the conventional technique, and in step S640, an encrypted message is encoded using a mixed code of Hangul code and Hanja code. Mixed code can represent up to 15 bits of binary data. Referring to reference numeral 600, the encrypted binary data is divided into 15-bit units (602). In this case, the Base64 conversion process 604 is ignored. A 15-bit binary is padded with 1 bit of zeros and matched to each of Korean or Chinese characters, and the message capacity is increased by 16/15 times by 1 bit zero padding. In the process of expressing matched Hangul or Hanja as binary data of UCS2 code, the arrangement of binary data changes, but the capacity of message does not change. Therefore, in this case, since 16 bits are used for transmitting 15 bits of binary data, it is found that the transmission efficiency is 15/16, which is more efficient than the case of using the conventional technology and the Korean / Hanja code.

7 is a diagram for further illustrating an encoding method using a mixed code of a Hanja code and a Hanja code according to another embodiment of the present invention. Referring to FIG. 7, the encrypted binary data is divided into units of 15 bits (700), and a 15-bit binary is padded with 1-bit zeros to form a 16-bit binary array (720 and 740). Thereafter, the binary code is sequentially matched to the mixed code 760 of the Chinese character code and the Hangul code, and then the Chinese character or the Chinese character corresponding to each 16-bit binary is displayed. The matching Hangul or Hanja is represented by UCS2 code, but the message capacity is not changed although the arrangement of binary data is changed.

8 is a diagram for explaining a process of decoding a message encoded using a Hangul code according to an embodiment of the present invention. Referring to FIG. 8, in step S800, the receiving terminal receives the encrypted SMS message. In step S820, a section to be decoded is extracted through a tag included in the received SMS message. In step S840, the encrypted part represented by Korean characters is converted into binary data. In this case, the units of bits to be extracted may be different according to the encoding method in the calling terminal. In step S860, the generated binary data is decoded in a specified manner to obtain the original text. At this time, the encryption, decryption method, and key transmission method can use a conventional method or the like, and are not specified in the present invention.

9 is a view for comparing message transmission efficiency according to an encoding method according to an embodiment of the present invention. Referring to FIG. 9, in the conventional technique using the Base 64 code, since 16 bits are used to transmit 6 bits, the transmission efficiency is 6/16. In the case of dividing 12 bits by using Hangul codes, 12/16, and 13 bits, the transmission efficiency is 13/16. In case of using the Hanja code, the transmission efficiency is 14/16, and when the mixed code of the Hangul code and the Hanja code is used, the transmission efficiency is 15/16. Therefore, when the mixed code is used, the most efficiently encrypted message can be transmitted.

10 is a configuration diagram of a message transmission server according to an embodiment of the present invention. 10, the message transmission server may include an encryption unit 1020, an encoding unit 1040, an SMS generation unit 1060, and a transmission unit 1080, but is not limited thereto.

The encryption unit 1020 can encrypt the message. In the present invention, the method of encrypting a message or the format of an encryption key is not limited to a specific method. The encoding unit 1040 encodes the encrypted message. In an embodiment of the present invention, an encrypted message can be encoded using a predetermined character code. The predetermined character code may include, but is not limited to, a Hangul code, a Hanja code, and a mixed code of Hangul code and Hanja code as character codes using more than 12 bits of 2 bytes at the time of code conversion.

The message of the embodiment of the present invention may include an image, a voice or a data file represented by binary data, and the image or voice may be encoded using a character code including a Hangul code, Lt; / RTI &gt;

 The SMS generating unit 1060 may generate the SMS by dividing the message into predetermined lengths. The SMS generating unit 1060 includes a tag for distinguishing the encrypted portion and the plain text portion from the divided message, a flag for distinguishing the first SMS and the SMS after the second SMS, an index indicating the order of the SMS, , The total length of the message, the length of the divided message, and the like. Hereinafter, a method of generating an SMS message according to an embodiment of the present invention will be described with reference to FIG.

11 is a view for explaining an SMS message generated according to an embodiment of the present invention. 11, reference numeral 1120 denotes an example of a first SMS message, and reference numeral 1140 denotes an example of a second and a third SMS message. Referring to reference numeral 1120, the first SMS message may be generated including a plaintext description part and an encryption part 1 including a tag, a flag, an entire length, and a divided length. Referring to reference numeral 1140, the second and subsequent SMS messages may be generated by further including a tag, a flag, an index, and a divided length in an encryption portion, but may include a plain text description portion. The order of insertion of tags, flags, etc. may be changed according to the implementation convenience.

Returning to FIG. 10, the transmitting unit 1080 may transmit the SMS message generated by the SMS generating unit 1060 to the receiving terminal.

The message transmission method according to the embodiment shown in FIG. 1 may be implemented in the form of a computer program or a recording medium including instructions executable by a computer such as a program module executed by a computer. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. In addition, the computer-readable medium can include both computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Communication media typically includes any information delivery media, including computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave, or other transport mechanism.

It will be understood by those skilled in the art that the foregoing description of the present invention is for illustrative purposes only and that those of ordinary skill in the art can readily understand that various changes and modifications may be made without departing from the spirit or essential characteristics of the present invention. will be. It is therefore to be understood that the above-described embodiments are illustrative in all aspects and not restrictive. For example, each component described as a single entity may be distributed and implemented, and components described as being distributed may also be implemented in a combined form.

The scope of the present invention is defined by the appended claims rather than the detailed description and all changes or modifications derived from the meaning and scope of the claims and their equivalents are to be construed as being included within the scope of the present invention do.

1020:
1040:
1060: SMS generating unit
1080:

Claims (19)

In a method for transmitting a message,
Encoding the message using a predetermined character code; And
Transmitting the message to a receiving terminal
, &Lt; / RTI &
Wherein the character code is a character represented by N bits of binary data, and the N bits are any one of 12 bits, 13 bits, 14 bits, or 15 bits,
Wherein the encoding step comprises:
Expressing the message as binary data;
Dividing the binary data into N-bit binary data;
Matching the divided N-bit binary data to a corresponding character of the character code; And
Converting the matched character into 16-bit binary data
The method comprising the steps of:
The method according to claim 1,
Encrypting the message
Further comprising the steps of:
The method according to claim 1,
Wherein the character code is a Hangul code.
The method according to claim 1,
Wherein the character code is a Hanja code.
The method according to claim 1,
Wherein the character code is a mixed code of Hangul code and Hanja code.
The method according to claim 1,
Dividing the message into predetermined lengths to generate a Short Message Service (SMS) message
Further comprising:
The generating step includes a tag for distinguishing the encrypted part and the plain text part from the divided message, a flag for distinguishing the first SMS from the second SMS, an Index indicating the order of the SMS, The total length of the message and the length of the divided message.
The method according to claim 6,
Wherein the step of generating comprises generating a first SMS message including the tag, the flag, the total length and the length, and generating a second and subsequent SMS messages including the tag, the flag, the index and the length, The method comprising:
The method according to claim 1,
Wherein the message comprises an encryption period and a non-encryption period.
The method according to claim 1,
Wherein the message comprises an image or binary data.
A computer program stored on a medium for transmitting a message in combination with a terminal,
Encodes the message using a predetermined character code,
And sending the message to a receiving terminal,
Wherein the character code is a character represented by N bits of binary data, and the N bits are any one of 12 bits, 13 bits, 14 bits, and 15 bits,
The computer program comprising:
The message is represented by binary data,
Divides the binary data into N-bit binary data,
Bit binary data into a corresponding character of the character code,
Further comprising a sequence of instructions for causing the matched character to be converted to 16-bit binary data.
11. The method of claim 10,
The computer program product further comprising a sequence of instructions for causing the computer to encrypt the message.
11. The method of claim 10,
Wherein the character code is a Hangul code, a Hanja code, or a mixed code of Hanja code and Hanja code.
11. The method of claim 10,
Generates an SMS message by dividing the message into predetermined lengths,
The SMS message includes a tag for distinguishing the encrypted part and the plain text part, a flag for distinguishing the first SMS and the second SMS, an index indicating the order of the SMS, Lt; RTI ID = 0.0 &gt; and / or &lt; / RTI &gt;
11. The method of claim 10,
Wherein the message comprises an encryption period and a non-encryption period.
11. The method of claim 10,
Wherein the message comprises an image or binary data,
A server for transmitting a message,
An encoding unit encoding the message using a predetermined character code; And
A transmitting unit for transmitting the message to a receiving terminal
, &Lt; / RTI &
Wherein the character code is a character represented by N bits of binary data, and the N bits are any one of 12 bits, 13 bits, 14 bits, and 15 bits,
The encoding unit may include:
The message is represented by binary data,
Divides the binary data into N-bit binary data,
Bit binary data into a corresponding character of the character code,
And converts the matched character into 16-bit binary data.
17. The method of claim 16,
An encryption unit
Further comprising: &lt; / RTI &gt;
17. The method of claim 16,
Wherein the character code is a Hangul code, a Hanja code, or a mixed code of Hanja code and Hanja code.
17. The method of claim 16,
An SMS generating unit for generating an SMS message by dividing the message into predetermined lengths,
Further comprising:
The SMS generator includes a tag for distinguishing the encrypted part and the plain text part from the divided message, a flag for distinguishing the first SMS from the SMS after the second SMS, an index indicating the order of the SMS, The total length of the message, and the length of the partitioned message.

Images