US8655932B2 - Data converting method and a device therefor - Google Patents

Data converting method and a device therefor Download PDF

Info

Publication number
US8655932B2
US8655932B2 US12/811,468 US81146810A US8655932B2 US 8655932 B2 US8655932 B2 US 8655932B2 US 81146810 A US81146810 A US 81146810A US 8655932 B2 US8655932 B2 US 8655932B2
Authority
US
United States
Prior art keywords
data
converted
bits
obtaining
offset
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US12/811,468
Other languages
English (en)
Other versions
US20120089653A1 (en
Inventor
Zhou Lu
Huazhang Yu
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Feitian Technologies Co Ltd
Original Assignee
Feitian Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Feitian Technologies Co Ltd filed Critical Feitian Technologies Co Ltd
Assigned to FEITIAN TECHNOLOGIES CO., LTD. reassignment FEITIAN TECHNOLOGIES CO., LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: LU, Zhou, YU, HUAZHANG
Publication of US20120089653A1 publication Critical patent/US20120089653A1/en
Application granted granted Critical
Publication of US8655932B2 publication Critical patent/US8655932B2/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions

Definitions

  • the invention relates to data converting algorithm field, in particular to a data converting method and a device therefor.
  • various kinds of methods are used for ensuring the security of the network, for example, obtaining message digest by computing for ensuring the completion of the message, or authenticating the password input by a user for ensuring the validity of the user.
  • the principle of applying message digest is that the message sender computes the message to be sent with one-way Hash encryption function to obtain a message digest, and sends the message and message digest to the receiver; the receiver obtains message digest by the same computing method with that used by the message sender, if the message is tampered when being sent, the computed message digest will differ from the received message digest, and thus the receiver determines whether the message is tampered by comparing the computed message digest and the received message digest, as a result, the completion of the message is ensured by the message digest.
  • the message digest is obtained by computing message to be sent with one-way Hash function, which is named Digital Finger Print. With fixed size, the message digests computed by different messages are different while message digests computed by the same message are the same, so it can be used for authenticating the completion of the received message.
  • the principle of password authenticating is generating a password by a data of random generated numbers or symbols, outputting the password in one image, adding some disturbing factors to the image; and the password being identified by user by eyes and being input to a form for submission, the input password being authenticated by a server, and the sever available only after a successful authentication.
  • the inventor finds at least disadvantages in prior art, which are that, the above solutions must be implemented by converting a kind of data to another kind, for example, converting message to message digest, or generating password by random numbers or symbols, and different data converting methods are used in different solutions which are all complicated.
  • a data converting method and device therefor are provided by the invention, simplifying data converting method.
  • a data converting method comprising:
  • size of the decimal number is not smaller than the first predetermined length, obtaining the data of the first predetermined length from the lower bit of the decimal number successively and taking the obtained data as the converted data; otherwise if size of the decimal number is smaller than the first predetermined length, keeping adding 0 to the upper digit of the decimal number till the first predetermined length is reached, and taking the data with added 0 as the converted data.
  • a data converting device comprising:
  • a first obtaining unit for obtaining offset from the data string to be converted
  • a second obtaining unit for obtaining the predetermined bits of data from the data string to be converted according to the offset
  • a converting unit for converting the obtained bits to the decimal number
  • a determining unit for determining whether size of the decimal number is smaller than the first predetermined length
  • an outputting unit for obtaining data of the first predetermined length from the lower bit of the decimal number successively and taking the obtained bits as the converted data if size of the decimal number is not smaller than the first predetermined length; and for keeping adding 0 to the upper digit of the decimal number till the first predetermined length is reached, and taking the data with added 0 as the converted data if size of the decimal number is smaller than the first predetermined length.
  • the data converting method and device therefor provided by the embodiments are implemented by obtaining predetermined bits of data from the data string to be converted successively; computing the obtained bits to obtain the offset, obtaining the predetermined bits of data from the data string to be converted according to the offset; and converting the obtained bits to decimal number and outputting the decimal number of the first predetermined length as the converted data.
  • the converted decimal number is larger enough in length, only data of the first predetermined length can be obtained, otherwise, keeping adding 0 to the decimal number till the first predetermined length is reached. So the obtained results are the same in length for the larger converted decimal number or the smaller.
  • FIG. 1 is a flow chart of data converting method of the embodiments of the invention.
  • FIG. 2 is a structural diagram of the data converting device of the embodiments of the invention.
  • FIG. 3 is a flow chart of data converting method of embodiment 1 of the invention.
  • FIG. 4 is a flow chart of data converting method of embodiment 2 of the invention.
  • FIG. 5 is a structural diagram of the data converting device of the embodiment 3 of the invention.
  • a data converting method is provided by embodiments of the invention, referring to FIG. 1 , the method including:
  • Step 101 after obtaining all kinds of data string to be converted, such as random number, and obtaining the predetermined bits of data from the data string to be converted and taking the obtained bits as offset, for example, obtaining the latest four bits of the last byte of the data string to be converted, or eight bits of the first byte of the data string to be converted etc.
  • the data string to be converted in the process can be random data directly input by a user or the data computed by non-collision one-way algorithm.
  • Step 102 after obtaining the offset, obtaining the predetermined bits of data from the data string to be converted according to the offset, wherein the predetermined bits of data in the embodiment can be adjusted according to the length difference in the data string to be converted;
  • Step 103 converting the obtained predetermined bits of data to decimal number, with the present computing method, such as the method for converting binary data to decimal number or converting hexadecimal number to decimal number.
  • Step 104 determining whether the length of the decimal number is smaller than the first predetermined length, if the length of the decimal number is not smaller than the first predetermined length, going to step 105 ; if size of the decimal number is smaller than the first predetermined length, going to step 106 .
  • Step 105 obtaining data of the first predetermined length from the lower bit of the decimal number successive and taking the obtained data as the converted data.
  • Step 106 keeping adding 0 to the upper digit of the decimal number till the first predetermined length is reached, and taking the data with added 0 as the converted data.
  • a data converting device is provided by the embodiment of the invention, referring to FIG. 2 , including a first obtaining unit 21 , a second obtaining unit 22 , a converting unit 23 , a determining unit 24 and an outputting unit 25 .
  • the first obtaining unit 21 is used for obtaining offset from the data string to be converted, and the data string to be converted can be a random number directly input by a user or data computed by non-collision one-way algorithm;
  • the second obtaining unit 22 is used for obtaining the predetermined bits of data from the data string to be converted according to the offset;
  • the converting unit 23 is used for converting the obtained bits to decimal number
  • the determining unit 24 is used for determining whether size of the decimal number is smaller than the first predetermined length
  • the outputting unit 25 is used for obtaining data of the first predetermined length from the lower bit of the decimal number successive if size of the decimal number is not smaller than the first predetermined length, or keeping adding 0 to the upper digit of the decimal number till the first predetermined length is reached, and taking the data with added 0 as converted data if size of the decimal number is smaller than the first predetermined length.
  • the data converting method and device therefor provided by the embodiments are implemented by obtaining predetermined bits of data from the data string to be converted successive; computing the obtained bits to obtain the offset, obtaining the predetermined bits of data from the data string to be converted according to the offset; and converting the obtained bits to decimal number and outputting the data of the first predetermined length as the converted data.
  • the converted decimal number is larger enough in length, only data of the first predetermined length can be obtained, otherwise, keeping adding 0 to the decimal number till the first predetermined length is reached. So the obtained results are the same for the larger decimal number or the smaller.
  • a data converting method is provided by the embodiment. Taking an example of converting the Hexadecimal number 0x3A4362FE8094C8A11D7F5BE38410E8F16758DA23FF3B3E85D7 to 4-bit decimal number for explanation, the first predetermined length is 4, and steps of the data converting method are as follows.
  • Step 301 after obtaining the data string to be converted, obtaining the predetermined bits of data from the predetermined position of the data string to be converted and taking the obtained bits as offset.
  • the predetermined position can be the first byte, the last byte or any middle byte of the data string to be converted. Generally, if size of the data string to be converted is known, the predetermined position can be any byte of the data string to be converted, for example, the one-third of size of the middle of the data or any specified location such as second and third byte of the data, etc. Preferably, in the embodiment the first byte of the data string to be converted is obtained and taken as offset 0x3A.
  • the smaller data string to be converted can be pre-computed, that is computing the data string to be converted with non-collision one-way algorithm, which is hash algorithm or Hash-Base Message Authentication Code algorithm (HMAC), such as SHA-1 algorithm etc.
  • non-collision one-way algorithm which is hash algorithm or Hash-Base Message Authentication Code algorithm (HMAC), such as SHA-1 algorithm etc.
  • HMAC Hash-Base Message Authentication Code algorithm
  • Step 302 for ensuring obtaining the predetermined bits of data from the data string to be converted, the obtained offset need to be regulated, and therefore determining whether the offset is larger than that of the predetermined data string to be converted is a must, if so, it determines the offset overflow, go to step 303 ; otherwise, it determines the offset not overflow, go to step 304 .
  • determining whether the offset is larger than the length of the data string is converting the obtained offset to decimal number, and comparing size of the decimal number with that of the data string to be converted, if the offset is larger than that of the data string to be converted, it determines the offset overflow.
  • size of the decimal number 58 corresponding to the obtained offset 0x3A is larger than size of the data string to be converted 25, and therefore the offset is overflow, go to step 303 .
  • Step 303 converting the offset to a value not bigger than the length of the data, which is taking the residue computed by the decimal number divided by the length of the data string to be converted, as the offset, the length of the data string as N, the offset as n, with codes
  • n ⁇ N
  • the decimal number 58 obtained from the step 302 corresponds to the offset 0x08.
  • new offset is obtained from computing the original offset, and in practice, it can be obtained from bits of data, to be converted, including 8 bits or 4 bits or other bits of data.
  • Step 304 after obtaining the offset, obtaining the predetermined bits of data from the position, corresponding to the offset, of the data string to be converted, wherein the predetermined bits can be obtained according to the length of the data string to be converted.
  • the predetermined bits can be 15 bits, and the obtained data of the predetermined bits is 0x1D7F, which is obtained from the offset 0x08.
  • Step 305 converting the obtained predetermined bits of data 0x1D7F to decimal number 7551.
  • Step 306 determining whether size of the decimal number is smaller than the first predetermined length, if the length of the decimal number is not smaller than the first predetermined length, going to step 307 ; otherwise, going to step 308 .
  • the first predetermined length is 4, being same with size of the decimal number 7551 computed by step 305 , and therefore the step 307 will be executed.
  • Step 307 keeping obtaining data from the lower digit of the decimal number till the first predetermined length is reached, and taking the obtained data as converted result, from the above description, the converted data 7551 is gotten; taking X as the obtained predetermined bits of data, buff as the buffer storing the converted result, the converting can be implemented by following codes Sprint(buff,“%05d”,X);
  • Step 308 keeping adding 0 to the upper digit of the decimal number till the first predetermined length is reached, and taking the data with added 0 as the converted data; which means if the decimal number converted by the obtained predetermined bits of data is smaller than 4 bits, keeping adding 0 to the decimal number till four bits are reached, and converting the data with added 0 to the converted data.
  • the data converting method and device provided in the embodiment is implemented by obtaining the predetermined bits of data from the data string to be converted; computing the obtained bits to obtain the offset, obtaining the predetermined bits of data from the data string to be converted according to the offset; and converting the obtained bits to decimal number and outputting data of the first predetermined length as the converted data. If the converted decimal number is larger enough in length, obtaining the data of first predetermined length; otherwise, keeping on adding 0 to the decimal number till the first predetermined length is reached. So the obtained results are the same for the larger decimal number or the smaller.
  • a data converting method is provided by the embodiment, in which the data string to be converted is taken as one of the predetermined bytes larger in length and is stored in Big-Endian (the lowerest address for storing the most significant byte) format.
  • the data string to be converted in the embodiment will be converted to six bits of number, wherein the hexdecimal data string to be converted is 0x5A83152391B06745E0901AA4AF315CC32056516B including 20 bytes.
  • the per-converting is computing the data string to be converted by non-collision one-way algorithm, which is Hash algorithm or HMAC algorithm, such as SHA-1 algorithm.
  • the data converting method of the embodiment includes steps as follows.
  • Step 401 obtaining predetermined bits of data from the predetermined position of the data string to be converted successive and taking the obtained bits as offset, which in details is obtaining the lower 4 bits in binary of the data string to be converted and taking the lower 4 bits as offset, such as 0x0B.
  • Step 402 obtaining the arithmetic right shifting bits by computing the offset by predetermined formula.
  • Step 403 arithmetic right shifting of the data string to be converted according to the arithmetic right shifting bits to get the shifted data, which in details is right shifting of the data string to be converted by 40 bits to get the shifted data string 0x00000000005A83152391B06745E0901AA4AF315C.
  • Step 404 obtaining the predetermined bits of data from the lower bit of the shifted data string to be converted, if the predetermined bits are 31, the data obtained successively from the lower bit of the data string to be converted after the arithmetic right shifting is 0x24AF315C.
  • the method in the embodiment can use, but not limited to, the method of taking the shifted data string as RESULT 1 and the lower 31 bits are RESULT 2 , and the obtaining method is given with the below codes:
  • RESULT 2 RESULT 1 &0x7FFFFFFF;
  • Step 405 converting the obtained predetermined bits of data to decimal number, and from the above data 0x24AF315C, the decimal number 615461212 will be obtained.
  • Step 406 determining whether size of the decimal number is smaller than the first predetermined length, if the decimal number is not smaller than the first predetermined length, going to step 407 ; otherwise, going to step 408 ;
  • the first predetermined length in the embodiment is 6, which is smaller than size of the decimal number 615461212 obtained from step 405 , and therefore step 407 is executed.
  • Step 407 obtaining data of the first predetermined length successive from the lower bit of the decimal number and taking the obtained data as the converted data, that is obtaining the lower 6 bits as the converted data 461212; taking X as the predetermined bits, buff as the buffer for storing the converted result, and the converting can be implemented by codes Sprint(buff,“%05d”,X), wherein the lower 4 bits of Buff is the converted result.
  • Step 408 keeping adding 0 to the upper digit of the decimal number till the first predetermined length is reached, and taking the data with added 0 as the converted data.
  • the decimal number converted by the obtained predetermined bits is smaller than 6 bits, keeping adding 0 to the upper digit of the decimal number till 6 bits are reached, and taking the data with added 0 as the converted data.
  • the embodiment can be implemented by both software and hardware, and the hardware is used for running instructions of the software including but not limited to codes as follows.
  • the data converting method provided by the embodiment is implemented by obtaining the predetermined bits of data from the data string to be converted; obtaining offset by computing the obtained bits, obtaining the predetermined bits of data from the data string to be converted according to the offset; and converting the obtained bits to the decimal number and outputting the data of the first predetermined length as the converted data. If the converted decimal number is larger enough in length, obtaining the data of the first predetermined length; otherwise, keeping on adding 0 to the decimal number till the first predetermined length is reached. So the obtained results are the same in length for the larger converted decimal number or the smaller.
  • the operations of right shifting of the data string to be converted, and obtaining data from the lower bit of the shifted data in the embodiment simplify the process of obtaining the predetermined bits of data, which improve the efficiency and accuracy of obtaining data.
  • the invention eliminates the problem of complicated message digest computing process, which in all makes the data converting method more easier than that in prior art, more implementable and applicable.
  • a data converting device is provided by the embodiment, referring to FIG. 5 , including a first obtaining unit 51 , a second obtaining unit 52 , a converting unit 53 , a determining unit 54 and an outputting unit 55 .
  • the first obtaining unit 51 After obtaining the data string to be converted, such as random number, the first obtaining unit 51 is used for obtaining offset from the predetermined position of the data string to be converted, which can be random data input directly by a user, or data computed by non-collision one-way algorithm;
  • the second obtaining unit 52 is used for obtaining the predetermined bits of data from the data string to be converted according to the offset;
  • the converting unit 53 is used for converting the obtained data to the decimal number
  • the determining unit 54 is used for determining whether size of the decimal number is smaller than the first predetermined length
  • the outputting unit 55 is used for obtaining data of the first predetermined length from the lower bit of the decimal number and taking the obtained data as the converted data, if size of the decimal number is not smaller than the first predetermined length; or keeping adding 0 to the upper digit of the decimal number till the first predetermined length is reached, and taking the data with added 0 as converted data.
  • the first obtaining unit 51 can obtain the offset from first byte, any middle byte or the last byte of the data string to be converted, which includes a first obtaining module 511 , a determining module 512 and an outputting module 513 .
  • the first obtaining module 511 is used for obtaining 4 or 8 bits from the predetermined position of the data string to be converted;
  • the determining module 512 is used for determining whether the decimal number corresponding to the obtained bits is larger than the data string to be converted in length;
  • the outputting module 513 is used for taking the decimal number corresponding to the obtained bits, as offset if the decimal number is not larger than the data string to be converted in length; and for taking the residue computed from the decimal number corresponding to the obtained bits divided by the length of the data string to be converted, as offset or taking the differential, computed by the decimal number corresponding to the obtained bits minus the multiple times of the length of the data string to be converted, as the offset, if the decimal number is larger than the data string to be converted in length.
  • the first obtaining unit 51 can obtain the decimal number corresponding to the 4 bits as offset if size of the data string to be converted is larger enough, which will not result in an offset overflow.
  • the second obtaining unit 52 of the embodiment can be implemented by, but not limited to, two solutions as follows.
  • One is for obtaining the predetermined bits of data from the predetermined position of the data string to be converted, which is corresponding to the offset.
  • Another includes a computing module 521 , a right shifting module 522 and a second obtaining module 223 , wherein the computing module 521 is for obtaining the arithmetic right shifting bits by computing the offset according to the predetermined formula, which can be, but limited to the formula in embodiment 2, BITS 128 ⁇ LBS4*8 wherein BITS refers to the arithmetic right shifting bits, and LBS4 refers to the offset;
  • the right shifting module 522 is for arithmetic right shifting of the data string to be converted according to the arithmetic right shifting bits
  • the second obtaining module 523 is for obtaining the predetermined bits of data from the lower bit of the shifted data string to be converted.
  • the embodiments are mainly used in all kinds of data converting devices and methods therefor, such as one time password generating method and device therefor.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
US12/811,468 2009-10-27 2010-06-28 Data converting method and a device therefor Active 2031-12-07 US8655932B2 (en)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN200910236912 2009-10-27
CN200910236912.8A CN101697116B (zh) 2009-10-27 2009-10-27 数据变换方法及装置
CN200910236912.8 2009-10-27
PCT/CN2010/074598 WO2011050624A1 (zh) 2009-10-27 2010-06-28 数据变换方法及装置

Publications (2)

Publication Number Publication Date
US20120089653A1 US20120089653A1 (en) 2012-04-12
US8655932B2 true US8655932B2 (en) 2014-02-18

Family

ID=42142222

Family Applications (1)

Application Number Title Priority Date Filing Date
US12/811,468 Active 2031-12-07 US8655932B2 (en) 2009-10-27 2010-06-28 Data converting method and a device therefor

Country Status (3)

Country Link
US (1) US8655932B2 (zh)
CN (1) CN101697116B (zh)
WO (1) WO2011050624A1 (zh)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101697116B (zh) * 2009-10-27 2011-11-09 飞天诚信科技股份有限公司 数据变换方法及装置
CN101950301A (zh) * 2010-09-26 2011-01-19 北京飞天诚信科技有限公司 数据处理的方法及装置
CN102411489B (zh) * 2011-10-18 2014-06-04 飞天诚信科技股份有限公司 一种嵌入式系统中的数据处理方法及装置
CN102594797B (zh) * 2011-12-30 2014-07-30 飞天诚信科技股份有限公司 一种在嵌入式系统中生成验证码的方法与装置
CN105721882B (zh) * 2016-04-18 2021-01-05 上海泥娃通信科技有限公司 一种分离编解码的方法
CN107154067B (zh) * 2017-03-31 2021-02-05 北京奇艺世纪科技有限公司 一种头像生成方法及装置

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4610027A (en) * 1983-12-30 1986-09-02 International Business Machines Corporation Method for converting a bit map of an image to a run length or run end representation
US4658430A (en) * 1984-12-27 1987-04-14 International Business Machines Corp. System for rotating binary images
US4959785A (en) * 1987-05-26 1990-09-25 Sharp Kabushiki Kaisha Character processing system with spelling check function that utilizes condensed word storage and indexed retrieval
US5126739A (en) * 1989-01-13 1992-06-30 Stac Electronics Data compression apparatus and method
US5367705A (en) * 1990-06-29 1994-11-22 Digital Equipment Corp. In-register data manipulation using data shift in reduced instruction set processor
US20010017899A1 (en) * 2000-02-29 2001-08-30 David Milway Qamd
CN101247233A (zh) * 2008-03-24 2008-08-20 北京飞天诚信科技有限公司 一种生成消息摘要的方法
US20090210467A1 (en) * 2008-02-15 2009-08-20 International Business Machines Corporation ASCII to Binary Floating Point Conversion of Decimal Real Numbers on a Vector Processor
US20090265392A1 (en) 2006-12-22 2009-10-22 Fujitsu Limited Data verifying device, data verifying method, and data verifying program

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6233597B1 (en) * 1997-07-09 2001-05-15 Matsushita Electric Industrial Co., Ltd. Computing apparatus for double-precision multiplication
JP2002328803A (ja) * 2001-04-27 2002-11-15 Canon Inc データ変換装置及びデータ変換方法
JP2005018310A (ja) * 2003-06-25 2005-01-20 Nippon Telegr & Teleph Corp <Ntt> データ変換方法および装置
JP4700051B2 (ja) * 2005-03-16 2011-06-15 三菱電機株式会社 暗号装置及び暗号方法
CN100561546C (zh) * 2008-01-28 2009-11-18 和舰科技(苏州)有限公司 循环扩散偏移转码加密方法
CN101227286B (zh) * 2008-01-31 2010-04-14 北京飞天诚信科技有限公司 一种生成消息认证码的方法
CN101697116B (zh) * 2009-10-27 2011-11-09 飞天诚信科技股份有限公司 数据变换方法及装置

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4610027A (en) * 1983-12-30 1986-09-02 International Business Machines Corporation Method for converting a bit map of an image to a run length or run end representation
US4658430A (en) * 1984-12-27 1987-04-14 International Business Machines Corp. System for rotating binary images
US4959785A (en) * 1987-05-26 1990-09-25 Sharp Kabushiki Kaisha Character processing system with spelling check function that utilizes condensed word storage and indexed retrieval
US5126739A (en) * 1989-01-13 1992-06-30 Stac Electronics Data compression apparatus and method
US5367705A (en) * 1990-06-29 1994-11-22 Digital Equipment Corp. In-register data manipulation using data shift in reduced instruction set processor
US20010017899A1 (en) * 2000-02-29 2001-08-30 David Milway Qamd
US20090265392A1 (en) 2006-12-22 2009-10-22 Fujitsu Limited Data verifying device, data verifying method, and data verifying program
US20090210467A1 (en) * 2008-02-15 2009-08-20 International Business Machines Corporation ASCII to Binary Floating Point Conversion of Decimal Real Numbers on a Vector Processor
CN101247233A (zh) * 2008-03-24 2008-08-20 北京飞天诚信科技有限公司 一种生成消息摘要的方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Machine Translation of CN 101247233A. *

Also Published As

Publication number Publication date
CN101697116A (zh) 2010-04-21
WO2011050624A1 (zh) 2011-05-05
US20120089653A1 (en) 2012-04-12
CN101697116B (zh) 2011-11-09

Similar Documents

Publication Publication Date Title
US8655932B2 (en) Data converting method and a device therefor
US9537657B1 (en) Multipart authenticated encryption
US8462944B2 (en) Method of public key generation
Atkins et al. PGP message exchange formats
CN101076807B (zh) 一次性密码验证的方法和系统
US7730315B2 (en) Cryptosystem based on a Jacobian of a curve
Nevelsteen et al. Software performance of universal hash functions
US8984609B1 (en) Methods and apparatus for embedding auxiliary information in one-time passcodes
US20140298038A1 (en) Generation of randomized messages for cryptographic hash functions
US11222554B2 (en) Method, apparatus, and computer-readable medium for format preserving encryption of a numerical value
US10810495B2 (en) Methods for data encoding in DNA and genetically modified organism authentication
WO2014136386A1 (ja) タグ生成装置、タグ生成方法およびタグ生成プログラム
US20210248598A1 (en) Generating emoji sequence identifications to identify wallet addresses for blockchain wallets
JP2018157411A (ja) 情報処理装置
CN117640256B (zh) 一种无线网卡的数据加密方法、推荐装置和存储介质
US9331852B2 (en) System and method for securing data transaction
JP2012110053A (ja) 圧縮されたｅｃｄｓａ署名
US20070277043A1 (en) Methods for Generating Identification Values for Identifying Electronic Messages
WO2018038444A1 (ko) 생체 코드를 등록 및 인증하는 방법 및 장치
US7809130B1 (en) Password recovery system and method
US20030188242A1 (en) Shared data refining device and shared data refining method
US7359509B2 (en) Method and system for generation of cryptographic keys and the like
JP4914381B2 (ja) メッセージ認証子生成装置、メッセージ認証子検証装置、メッセージ認証子生成方法、メッセージ認証子検証方法、プログラム、および記録媒体
CN116167093A (zh) 数字签名门限方法和装置
US20110296193A1 (en) Code-based hashing for message authentication codes

Legal Events

Date Code Title Description
AS Assignment

Owner name: FEITIAN TECHNOLOGIES CO., LTD., CHINA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LU, ZHOU;YU, HUAZHANG;REEL/FRAME:027580/0123

Effective date: 20100630

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 8