CN104657432B - A method for short address repetition rate to reduce the length of NAT - Google Patents

A method for short address repetition rate to reduce the length of NAT Download PDF

Info

Publication number
CN104657432B
CN104657432B CN 201510043556 CN201510043556A CN104657432B CN 104657432 B CN104657432 B CN 104657432B CN 201510043556 CN201510043556 CN 201510043556 CN 201510043556 A CN201510043556 A CN 201510043556A CN 104657432 B CN104657432 B CN 104657432B
Authority
CN
Grant status
Grant
Patent type
Prior art keywords
address
string
short
number
bit
Prior art date
Application number
CN 201510043556
Other languages
Chinese (zh)
Other versions
CN104657432A (en )
Inventor
杨爱民
龙晓春
Original Assignee
北京金和软件股份有限公司
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
Grant date

Links

Abstract

本发明提供一种降低长地址转换为短地址重复率的方法,包括:将长地址通过加密算法生成32位字符串,将所述32位字符串分成四段,每段包括8位字符串;将每段中所述8位字符串均视作16进制串,并转换为32位二进制数字,32位二进制数字全部参与运算;将所述32位二进制数字做十次循环处理,获得一个10位字符串;对所述四段的8位字符串分别十次循环处理,获得4个10位字符串;所述4个10位字符串,组合成一个长度为4的字符串数组,随机取一个短地址即可。 The present invention provides a method of reducing the length of a short address into an address repetition rate, comprising: a string of 32-bit long address generated by the encryption algorithm, the 32-bit string is divided into sections, each section comprising eight character string; each piece of the 8-digit string is treated as a hexadecimal string and converted to 32-bit binary number, 32-bit binary numbers of all participating operation; the 32-bit binary number ten times loop processing, to obtain a 10 bit string; the four 8-bit string of ten cycles each treatment to obtain a 10-bit string of 4; 4 10-bit string of the combination of the array into a string of length 4, randomly a short address. 本发明的有益效果是提供了一种长地址转换为短地址的方法,该方法可大大降低传统长地址转短地址算法的重复率,在一定时间范围内,重复短地址数/总请求数的比值从1.6%降低至5.024e‑5。 Advantageous effect of the invention is to provide a method of address translation for the short length of the address, which can greatly reduce the length of a conventional address translation algorithm address short repetition rate, within a certain time frame, the number of repeated short address / total number of requests ratio decreased from 1.6% to 5.024e-5.

Description

一种降低长地址转换为短地址重复率的方法 A method for short address repetition rate to reduce the length of NAT

技术领域 FIELD

[0001]本发明涉及长地址转换为短地址的方法。 [0001] The present invention relates to a method of address translation for the short length of the address. 更具体地说,本发明涉及一种降低长地址转换为短地址重复率的方法。 More particularly, the present invention relates to a method for the short address conversion repetition rate in order to reduce the long address.

背景技术 Background technique

[0002]短地址的兴起源于微博,由于主流微博140字限制,所以短地址渐渐流行起来,且应用范围越来越广,这是因为地址本身对用户来说没有任何意义,用户只关心它指向的内容,所以地址越简单越好。 [0002] The rise stems from the microblogging short address, because the mainstream microblogging 140 character limit, so short address gradually became popular, and increasingly wide range of applications, this is because the address does not have any meaning for the user, the user only concerned about the content it points to, the address as simple as possible.

[0003]短地址好处很多,例如它可以缩短链接长度,使得手机、微博分享比较方便等,但正是短地址需要跳转到原来长地址,也导致短地址存在着缺点,即无法查看原来的长地址。 [0003] short address many advantages, for example, it can shorten the length of the link, making the phone, microblogging share relatively easy, but it is short address needs to jump to the long address, but also lead to a short address there is a drawback that can not view the original long address. [0004]传统的长地址转换为短地址的算法为:1)将长地址MD5生成32位签名串,分为4段, 每段8个字节;2)对这四段循环处理,取8个字节,将他看成16进制串与〇x3fffffff (30位1) 与操作,即超过30位的忽略处理;3)这30位分成6段,每5位的数字作为字母表的索引取得特定字符,依次进行获得6位字符串;4)总的MD5串可以获得4个6位串;取里面的任意一个就可作为这个长地址的短地址。 [0004] The conventional short-length address into the address algorithm: 1) to generate 32-bit long address MD5 signature string, divided into four segments, each 8 bytes; 2) these four loop processing, take 8 bytes, as he would with a hexadecimal string 〇x3fffffff (30 1) and the operation, i.e., more than 30 ignores processing; 3) 30 which is divided into 6 segments, each numeral 5 as the index of the alphabet obtaining specific character string sequentially performed to obtain 6; 4) sequence can be obtained MD5 total four 6-bit string; can be taken arbitrarily as inside a short address the long address.

[0005]在大并发大数据量的情况下,传统的长地址转换为短地址算法会产生重复的数据,即不同的长地址生成了相同的短地址,导致通过短地址不能正确的定位到原始长地址。 [0005] In the case of large complicated large amount of data, the traditional long address into a short address, the algorithm produces repeated data, i.e., different long address generation same short address, can make proper positioning of the original by a short address long address.

发明内容 SUMMARY

[0006] 本发明针对上述问题,提供了一种降低长地址转换为短地址重复率的方法,该方法可大大降低传统长地址转换为短地址算法的重复率,在一定时间范围内,重复短地址数/ 总请求数的比值从1 • 6 %降低至5.024e 一5 [0006] The present invention addresses the above problems, there is provided a method of reducing the length of the short address into an address repetition rate, the conventional method can greatly reduce the length of the short address to address translation algorithm repetition rate, within a certain time, repeated short the ratio of the number of addresses / decrease the total number of requests from 1 • 6% to a 5 5.024e

[0007] 本发明的一个目的是研究了长地址转换为短地址的方法。 [0007] An object of the present invention studied a method of address translation for the short length of the address.

[0008] 本发明还有一个目的是该方法解决了传统长地址转换为短地址时重复率较高的问题,在一定的时间范围内,使得重复短地址数/总请求数的比值由传统算法的1.6%降低为5.024e_5。 [0008] Another object of the present invention is that the solution to the conventional repetition rate is converted to a long address the problem of high short address, within a certain time, so that the number of addresses in the short repeat / request by the ratio of the total number of conventional algorithms 1.6% reduction for the 5.024e_5.

[0009]本发明还有一个目的是通过对传统算法的步骤2和步骤3进行改进,大大降低了长地址转换为短地址的重复率。 [0009] Another object of the present invention is produced by the step 2 algorithm and a conventional step 3 to improve greatly reduce the length of a short address into an address repetition rate.

[0010]为此,本发明提供了一种降低长地址转换为短地址重复率的方法,包括: [0010] To this end, the present invention provides a method for the short address repetition rate in order to reduce the long address translation, comprising:

[0011] 将长地址通过加密算法生成32位字符串,将所述32位字符串分成四段,每段包括8 位字符串; [0011] The 32-bit long address generated by the encryption string, the string is divided into 32 sections, each section comprising eight character string;

[0012]将每段中所述8位字符串均视作16进制串,并转换为32位二进制数字,32位二进制数字全部参与运算; [0012] In each piece of the 8-digit string is treated as a hexadecimal string and converted to 32-bit binary number, 32-bit binary number all involved in computing;

[0013]将所述32位二进制数字做十次循环处理,获得一个1〇位字符串; [0013] The 32-bit binary number ten times loop processing, to obtain a 1〇 bit string;

[0014]对所述四段的8位字符串分别十次循环处理,获得4个10位字符串; [0014] each of the ten cycles of treatment string of four 8-bit, four 10-character string obtained;

[0015] 所述4个10位字符串,组合成一个长度为4的字符串数组,随机取一个短地址即可。 The [0015] Four 10-bit string of a length to a combination of an array of strings 4, a randomly selected short address.

[0016] 优选的是,其中,还包括预先给出构成短地址的基础字符数组。 [0016] Preferably, wherein the base further comprises a predefined array of characters constituting the short address.

[0017] 优选的是,其中,所述加密算法为MD5算法。 [0017] Preferably, wherein the encryption algorithm is MD5.

[0018] 优选的是,其中,所述长地址为请求的整个地址。 [0018] Preferably, wherein the entire length of the address is the address of the request.

[0019] 优选的是,其中,对每段中所述8位字符串进行十次循环处理具体步骤为: [0019] Preferably, wherein each segment of the 8-digit string loop process ten times the specific steps:

[0020] 步骤一、所述32位二进制数字与参数进行与运算,得到第一数,把所述第一数当做索引在基础字符数组中得到对应的第一位字符;将所述32位二进制数字右移三位得到第一个新数字,完成第一次循环; [0020] Step a, the 32-bit binary numbers and the calculation parameters to obtain a first number, said first number as an index to obtain a first character corresponding to the character array in the base; the 32-bit binary first digital right to give a new number three, the first cycle is completed;

[0021] 步骤二、将所述步骤一中的新数字与所述参数进行与运算,得到第二数,把所述第二数当做索引在基础字符数组中得到对应的第二位字符;将所述第一个新数字右移三位得到第二个新数字完成第二次循环; [0021] Step two, the new step number in a parameter of the operation and obtain a second number, the second number as said second index to obtain a corresponding character on the basis of the character array; and the first three new digital right to obtain a second new digital completion of the second cycle;

[0022] 步骤三,按照所述步骤二的计算方法循环十次,即可获得所述一个10位字符串。 [0022] Step three, ten cycles according to the calculation method of step two, to obtain the 10-bit string.

[0023] 优选的是,其中,所述参数为0x0000003D。 [0023] Preferably, wherein the parameter is 0x0000003D.

[0024] 优选的是,其中,所述基础字符数组的长度为62,所述基础字符数组包括0至9的数字与大小写字母。 [0024] Preferably, wherein the length of the base 62 is an array of characters, the fundamental character array including uppercase and lowercase letters with the numbers 0 to 9.

[0025] 本发明至少包括以下有益效果:本发明提供了一种降低长地址转换为短地址的重复率的方法,该方法中对传统长地址转换为短地址方法中的步骤2和步骤3进行了改进,传统方法经过步骤2得到30位(即超过30位的忽略),然后进行步骤3的操作,而本发明的步骤2 保留全部,并参与步骤3的运算;本发明将请求传递的长地址经过MD5加密算法生成32位字符串,32位字符串经过十次内循环和四次外循环得到长度为4的10位字符串,通过本发明的方法将一定的时间范围内的重复短地址数/总请求数的比值由传统算法的1.6%降低为5.024f5,解决了传统长地址转换为短地址时重复率较高的问题,大大降低了长地址转换为短地址的重复率。 [0025] The present invention comprises at least the following advantages: The present invention provides a method for the long address into the address short repetition rate is reduced, the conventional method is converted to the long address to address the short process step 2 and Step 3 improvements, the conventional method after step 2 to give 30 (i.e., over 30 to ignore), followed by step 3, and steps of the present invention will retain all, and participate in calculating step 3; the invention will pass the request length after the address the MD5 algorithm generates a 32-character string, the string 32 after ten cycles and the outer loop to give four 10-bit string of length 4, by the process of the present invention will be repeated within a short address time range ratio of the number / total number of requests decreased from 1.6% to traditional methods 5.024f5, to solve the conventional repetition rate short address to long address translation higher, and greatly reduce the length of the address into the address short repetition rate.

[0026] 本发明的其它优点、目标和特征将部分通过下面的说明体现,部分还将通过对本发明的研究和实践而为本领域的技术人员所理解。 [0026] Additional advantages, objects and features of the invention will be reflected in part by the following description, the section will also be appreciated by the skilled person on the research and practice of the invention and in the art.

附图说明 BRIEF DESCRIPTION

[0027]图1为本发明的一个实施例中降低长地址转换为短地址重复率方法的流程图。 An embodiment [0027] FIG. 1 is a flowchart of the present invention address into a short length of address examples repetition rate reduction method.

具体实施方式 detailed description

[0028]下面结合附图对本发明做进一步的详细说明,以令本领域技术人员参照说明书文字能够据以实施。 [0028] DRAWINGS further detailed description of the present invention, in order to make those skilled in the art with reference to the description text can be implemented accordingly.

[0029]图1示出了根据本发明的一种降低长地址转换为短地址重复率的方法实现形式, 其中包括:对长地址经MD5算法生成的32位字符串进行10次内循环和4次外循环生成四个不同的10位短地址,具体为: [0029] FIG. 1 shows according to the present invention reduces the long address into the address short repetition rate method realization form, which comprises: a string of 32-bit long addresses generated by the MD5 algorithm is performed within 10 cycles 4 and outer loop generates four different 10-bit short address, specifically:

[0030] (1)将长地址通过加密算法生成32位字符串,将32位字符串分成四段,每段包括8 位字付串;例如长地址为:http://XXXX.XXXX.com/app/GetAppDetail?appId = d8a701a〇-〇67b-4e3a-abba-6 dObb4〇214ca,经过加密算法生成32位字符串,例如所述32位字符串为数字和字母。 [0030] (1) The long address generated by the encryption algorithm 32-bit string, the string is divided into 32 sections, each section comprising a string of 8-bit words to pay; for example, the long address is: http: //XXXX.XXXX.com / app / GetAppDetail? appId = d8a701a〇-〇67b-4e3a-abba-6 dObb4〇214ca, encrypted algorithm to generate 32-bit string, for example, the 32-bit string of numbers and letters.

[0031] (2)将每段中包含的8位字符串均视作16进制串,并将16进制的8位字符串转换为32位二进制数字,32位二进制数字全部参与下一步的运算; [0031] (2) each segment comprising a string of eight bits is treated as a hexadecimal string, and the string of hexadecimal 8 to 32-bit binary number, 32-bit binary number next full participation operations;

[0032] (3)将(2)中的32位二进制数字做十次循环处理,获得一个1〇位字符串;例如生成的短地址为:7mFnr6IZJf; [0032] (3) (2) 32-bit binary number ten times loop processing, to obtain a bit string 1〇; short address is generated, for example: 7mFnr6IZJf;

[OO33] ⑷对⑴中四段的8位字符串分别十次循环处理,获得4个10位字符串; [OO33] ⑷ each ten cycles of treatment ⑴ four 8-bit string, the string 10 is obtained 4;

[0034] (5)所述4个10位字符串,组合成一个长度为4的字符串数组,随机取一个短地址即可。 [0034] (5) 4 10-bit string, are combined into a string array 4, a randomly selected short address.

[0035] 在另一种实例中,还包括预先给出构成短地址的基础字符数组。 [0035] In another example, the character array further comprises a base configured predefined short addresses.

[0036] 在另一种实例中,经过加密算法生成32位字符串的加密算法为MD5算法。 [0036] In another example, the encrypted algorithm to generate 32-bit string of the encryption algorithm is the MD5 algorithm.

[0037] 在另一种实例中,(1)中的长地址为请求的整个长地址。 Address entire length [0037] In another example, in (1) the long address request.

[0038] 在另一种实例中,对每段中包含的16进制的8位字符串进行十次循环处理具体步骤为: [0038] In another example, the 8-bit hexadecimal character string included in each segment loop process ten times the specific steps:

[0039]步骤一、所述32位二进制数字与参数进行与运算,得到第一数,把第一数当做索引在基础字符数组中得到对应的第一位字符;将所述32位二进制数字右移三位得到第一个新数字,完成第一次循环; [0039] Step a, the 32-bit binary numbers and the calculation parameters to obtain the first number, the first number as an index to obtain a first character corresponding to the character array in the base; the 32-bit binary numbers to right three first shift to obtain a new number, the first cycle is completed;

[0040]步骤二、将所述步骤一中的新数字与所述参数进行与运算,得到第二数,把所述第二数当做索引在基础字符数组中得到对应的第二位字符;将所述第一个新数字右移三位得到第二个新数字完成第二次循环; [0040] Step two, the new step number in a parameter of the operation and obtain a second number, the second number as said second index to obtain a corresponding character on the basis of the character array; and the first three new digital right to obtain a second new digital completion of the second cycle;

[0041] 步骤三,按照所述步骤二的计算方法循环十次,即可获得所述一个10位字符串。 [0041] Step three, ten cycles according to the calculation method of step two, to obtain the 10-bit string.

[0042] 在另一种实例中,所述参数为0x0000003D。 [0042] In another example, the parameter is 0x0000003D.

[0043] 在另一种实例中,构成短地址的基础字符数组的个数为62,包括0至9的数字与A- Z ? a_z 〇 [0043] In another example, the number of characters constituting the short array base address is 62, including digital and A- Z 0 to 9? A_z square

[0044]尽管本发明的实施方案己公开如上,但其并不仅仅限于说明书和实施方式中所列运用。 [0044] While the embodiments of the present invention already disclosed above, but its use is not limited to the description set forth and described embodiments. 它完全可以被适用于各种适合本发明的领域。 It can be applied to various fields suitable for the present invention. 对于熟悉本领域的人员而言,可容易地实现另外的修改。 For the person skilled in the art, it can be easily realized additional modifications. 因此在不背离权利要求及等同范围所限定的一般概念下,本发明并不限于特定的细节和这里示出与描述的图例。 Therefore, in the general concept without departing from the scope of the claims and the equivalents as defined in the present invention is not limited to the specific details shown and described herein with legend.

Claims (5)

  1. 1. 一种降低长地址转换为短地址重复率的方法,其中,包括: 将长地址通过加密算法生成32位字符串,将所述32位字符串分成四段,每段包括8位字符串; 将每段中所述8位字符串均视作16进制串,并转换为32位二进制数字,32位二进制数字全部参与运算; 将所述32位二进制数字做十次循环处理,获得一个10位字符串; 对所述四段的8位字符串分别十次循环处理,获得4个10位字符串,其中,对每段中所述8位字符串进行十次循环处理具体步骤为: 步骤一、所述32位二进制数字与参数进行与运算,得到第一数,把所述第一数当做索引在基础字符数组中得到对应的第一位字符;将所述32位二进制数字右移三位得到第一个新数字,完成第一次循环; 步骤二、将所述步骤一中的新数字与所述参数进行与运算,得到第二数,把所述第二数当做索引在基础字符数组中得 CLAIMS 1. A method of reducing the length of a short address into an address repetition rate, comprising: a string of 32-bit long address generated by the encryption algorithm, the 32-bit string is divided into sections, each section comprising a string of eight ; each piece of the 8-digit string is treated as a hexadecimal string and converted to 32-bit binary number, 32-bit binary numbers of all participating operation; the 32-bit binary number ten times loop processing, to obtain a 10 string; the four 8-bit string of ten cycles each treatment, four 10-character string is obtained, wherein for each segment of the 8-digit string loop process ten times the specific steps: step one, the 32-bit binary numbers and the calculation parameters to obtain a first number, said first number as an index to obtain a first character corresponding to the character array in the base; the right 32-bit binary number the first three obtain a new number, the completion of the first cycle; two step, a new step in the number of parameters and the operation to obtain a second number, said second number as an index on the basis of character array was 对应的第二位字符;将所述第一个新数字右移三位得到第二个新数字完成第二次循环; 步骤三,按照所述步骤二的计算方法循环十次,即可获得所述一个10位字符串; 所述4个10位字符串,组合成一个长度为4的字符串数组,随机取一个短地址即可; 其中,还包括预先给出构成短地址的基础字符数组。 Corresponding to the second character; the first three right a new number to obtain a second new digital completion of the second cycle; Step three, according to the method step of calculating two cycle ten times, to obtain a string 10 described later; a 10-bit string of 4, combined into a string array 4, a short address can be randomly selected; wherein the base further comprises an array of characters constituting predefined short addresses.
  2. 2. 如权利要求1所述的降低长地址转换为短地址重复率的方法,其中,所述加密算法为MD5算法。 2. The long address of the reducing method of converting a short address repetition rate claim, wherein the encryption algorithm is MD5.
  3. 3.如权利要求1所述的降低长地址转换为短地址重复率的方法,其中,所述长地址为请求的整个地址。 Reduced long address as claimed in claim 1, a method of converting an address short repetition rate, wherein the length of the entire address of the requested address.
  4. 4.如权利要求3所述的降低长地址转换为短地址重复率的方法,其中,所述参数为0x0000003D〇 Reduced long address as claimed in claim 3 is a method of converting an address short repetition rate, wherein said parameter is 0x0000003D〇
  5. 5.如权利要求1所述的降低长地址转换为短地址重复率的方法,其中,所述基础字符数组的长度为62,所述基础字符数组包括〇至9的数字与大小写字母。 5. reducing the long address of a method of converting a short address repetition rate claim, wherein the length of the base 62 is an array of characters, the fundamental character array comprises a square case letters and numbers to 9.
CN 201510043556 2015-01-28 2015-01-28 A method for short address repetition rate to reduce the length of NAT CN104657432B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201510043556 CN104657432B (en) 2015-01-28 2015-01-28 A method for short address repetition rate to reduce the length of NAT

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201510043556 CN104657432B (en) 2015-01-28 2015-01-28 A method for short address repetition rate to reduce the length of NAT

Publications (2)

Publication Number Publication Date
CN104657432A true CN104657432A (en) 2015-05-27
CN104657432B true CN104657432B (en) 2018-01-23

Family

ID=53248560

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201510043556 CN104657432B (en) 2015-01-28 2015-01-28 A method for short address repetition rate to reduce the length of NAT

Country Status (1)

Country Link
CN (1) CN104657432B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20110132849A (en) * 2010-06-03 2011-12-09 주식회사 다음커뮤니케이션 Device and method for transformation url
AU2012100308A4 *
CN102651714A (en) * 2011-02-24 2012-08-29 腾讯科技(深圳)有限公司 Security method and device for mail addresses
CN102917307A (en) * 2012-10-16 2013-02-06 北京小米科技有限责任公司 Information transmission method and device, UE and communication system
CN104104649A (en) * 2013-04-02 2014-10-15 阿里巴巴集团控股有限公司 Webpage logging method, device and system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7545755B2 (en) * 2000-03-03 2009-06-09 Adtran Inc. Routing switch detecting change in session identifier before reconfiguring routing table

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2012100308A4 *
KR20110132849A (en) * 2010-06-03 2011-12-09 주식회사 다음커뮤니케이션 Device and method for transformation url
CN102651714A (en) * 2011-02-24 2012-08-29 腾讯科技(深圳)有限公司 Security method and device for mail addresses
CN102917307A (en) * 2012-10-16 2013-02-06 北京小米科技有限责任公司 Information transmission method and device, UE and communication system
CN104104649A (en) * 2013-04-02 2014-10-15 阿里巴巴集团控股有限公司 Webpage logging method, device and system

Also Published As

Publication number Publication date Type
CN104657432A (en) 2015-05-27 application

Similar Documents

Publication Publication Date Title
US20080240423A1 (en) Speeding up galois counter mode (gcm) computations
US20120288089A1 (en) System and method for device dependent and rate limited key generation
US20080010463A1 (en) Method for producing truncated message digests
CN101692636A (en) Data element and coordinate algorithm-based method and device for encrypting mixed data
CN101216754A (en) Modular multiplication processing method, data encryption and decryption processing method and device
Elishco et al. Capacity and coding for the Ising channel with feedback
CN102509549A (en) Language model training method and system
CN101996298A (en) Encrypting method and decrypting method corresponding to same
Kumaravel et al. An application of non-uniform cellular automata for efficient cryptography
US20100275192A1 (en) Generating optimal instruction sequences for bitwise logical expressions
CN1425987A (en) Encrypting method for reinforcing disordered block cipher
JP2000122534A (en) Ciphering method
CN101000582A (en) Enciphering method and device for data of memory and its deciphering device and method
JPH07199808A (en) Ciphering method/system
RU2504911C1 (en) Method for iterative cryptographic transformation of data
CN101217341A (en) A fast velocity matching method
US20160048531A1 (en) Adaptive Rate Compression Hash Processor
CN103019648A (en) True random number generator with digital post-processing circuit
Chun-Mei et al. Fast implementation of length-adaptive privacy amplification in quantum key distribution
Mandal et al. An adaptive neural network guided secret key based encryption through recursive positional modulo-2 substitution for online wireless communication (ANNRPMS)
Biryukov et al. Fast and Tradeoff-Resilient Memory-Hard Functions for Cryptocurrencies and Password Hashing.
Wiemer et al. High-speed implementation of bcrypt password search using special-purpose hardware
CN102084346A (en) Address generation for multiple access of memory
JP2003216025A (en) Non-linear transformation device, its method, non-linear transformation program, and adding method
KR20050065976A (en) Apparatus and method for computing sha-1 hash function

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
GR01