Search - hash function

Search - hash function - List

[JSP/Java] jSecureKit DL : 0: 用图形用户界面编写的加解密文件系统，还可实现哈希函数算法-graphical user interface with the preparation of the increase declassified document systems, but also achieve hash function algorithm
Date : 2008-10-13 Size : 41.92kb User : 张旭
[JSP/Java] jSecureKit DL : 0: 用图形用户界面编写的加解密文件系统，还可实现哈希函数算法-graphical user interface with the preparation of the increase declassified document systems, but also achieve hash function algorithm
Date : 2025-12-16 Size : 42kb User : 张旭
[JSP/Java] HASHexampleJAVA DL : 0: Hash函数实例，所用文章为5000单词以内，所以初始为求出所取单词的hash值,然后对1901求余,所得的余数作为一个数组的下标,数组的每一个数又是一个链表,凡余数相同的单词放入同一链表.此为所构造的hash函数.-Hash function examples used in the article for the 5000 words or less, so the initial word is derived by taking the hash value, and then seek to 1901 while the remainder of the proceeds as a subscript array, the array of each number is also a linked list, Where more than the same number of words placed in the same list. This is the structure of the hash function.
Date : 2025-12-16 Size : 3kb User : 王争社
[JSP/Java] java3 DL : 0: 创建一个包装学生信息的java类：包括name，number, age，height，创建该对象的数组用于表示n个学生的信息，并具备显示所有学生信息，查找某个学生的功能。（有输入流，输入数据，使用hash表存储数据）包含相关代码和运行结果-Create a package of java category of student information: including name, number, age, height, create the object array used to represent n student information and have the capacity to display information for all students to find a student function. (With input flow, input data, the use of hash table to store data) contains the relevant code and operating results
Date : 2025-12-16 Size : 13kb User : zhou
[JSP/Java] sha1 DL : 0: 　SHA (Secure Hash Algorithm，译作安全散列算法) 是美国国家安全局 (NSA) 设计，美国国家标准与技术研究院 (NIST) 发布的一系列密码散列函数。正式名称为 SHA 的家族第一个成员发布于 1993年。然而现在的人们给它取了一个非正式的名称 SHA-0 以避免与它的后继者混淆。两年之后， SHA-1，第一个 SHA 的后继者发布了。另外还有四种变体，曾经发布以提升输出的范围和变更一些细微设计: SHA-224, SHA-256, SHA-384 和 SHA-512 (这些有时候也被称做 SHA-2)。 -SHA (Secure Hash Algorithm, Secure Hash Algorithm translated) is a U.S. National Security Agency (NSA) design, the U.S. National Institute of Standards and Technology (NIST) released a series of password hash function. Formally known as the SHA family members of the first release in 1993. But now people take it the informal name of a SHA-0 in order to avoid confusion of its successor. Two years later, SHA-1, the first successor to SHA issued. There are four variants have been released to enhance the output of some minor changes to the scope and design: SHA-224, SHA-256, SHA-384 and SHA-512 (these are sometimes also known as SHA-2).
Date : 2025-12-16 Size : 1kb User : 陈诚
[JSP/Java] hash DL : 0: 通过hash函数实现节目单的编排节目单输入区.add(new JLabel("节目名称:")) 节目单输入区.add(名称文本框) -Through the hash function implementation program for the scheduling of programs single-input area. Add (new JLabel ( " Program Name :" )) program single-input area. Add (Name text box)
Date : 2025-12-16 Size : 14kb User : 刘婷婷
[JSP/Java] k-DNA DL : 0: k-长DNA子序列在DNA全序列中出现频数的计数问题。该算法通过一个哈希函数把k－长DNA子序列映射为整数关键字从而把k-长DNA子序列出现频数的计数问题转化为整数关键字的重复计数问题，使得能够利用经典B树算法来解决k-长DNA子序列的出现频数计数问题-k-long DNA sequence in the DNA sequence in the frequency of counting problems arise. In the algorithm, a hash function to k-long DNA sequence tags mapped to an integer to the k-long DNA sequence there counting frequency is transformed into an integer repeat count keyword problem, makes it possible to use the classic B tree algorithm to solve k-length DNA sequence of the emergence frequency of counting problems
Date : 2025-12-16 Size : 17kb User : 张莉
[JSP/Java] HashFunction DL : 0: A simple hash function-The input of this hash function is a stream of binary data which is read from file. The data is encrypted by each 32bits. Each block first is initialized by doing XOR with the modified ciphertext and a random binary array, and then encrypted by passing 3 consecutive permutation boxes, and then expands to 48 bits, do XOR with the key. After this, do substitute box, the bits become 32bits again, now we get the first ciphertext. And we repeat doing these actions until the last block encrypted,
Date : 2025-12-16 Size : 162kb User : zhaoxiao
[JSP/Java] HashFunction_SHA1 DL : 0: This a code for Hash Function SHA-1 in cryptography.-This is a code for Hash Function SHA-1 in cryptography.
Date : 2025-12-16 Size : 24kb User : RJ
[JSP/Java] hash DL : 0: 运用javascript实现hashmap功能-Hashmap function using javascript to achieve
Date : 2025-12-16 Size : 2kb User : 阿迪
[JSP/Java] hash_c DL : 0: hash算法C代码实现标准接口函数方便修改hash函数-hash algorithm C code implements the standard interface functions easily modified hash function
Date : 2025-12-16 Size : 2kb User : aniu
[JSP/Java] PasswordHash DL : 0: password hash function using java code.used on md5 hash function algorithm
Date : 2025-12-16 Size : 2kb User : ram
[JSP/Java] jxta-meteor DL : 0: 基于jxta平台的分布式哈希表（DHT)子项目，路由寻址均基于jxta的地址机制，实现了经典的chord,can协议，项目属于jxta的子项目，尚在开发中，还不是很稳定，但基本功能已经实现了-Based on a distributed hash table jxta platform (DHT) subprojects, addressing both routing mechanism based on the address jxta achieve a classic chord, can the agreement, the project belongs jxta subprojects, under development, is not very stable However, the basic function has been achieved
Date : 2025-12-16 Size : 2.36mb User : 王礼坊
[JSP/Java] MD5 DL : 0: Message Digest Algorithm MD5（中文名为消息摘要算法第五版）为计算机安全领域广泛使用的一种散列函数，用以提供消息的完整性保护。-A hash function Message Digest Algorithm MD5 (Message Digest algorithm called Chinese fifth edition) is widely used in the field of computer security, to provide message integrity protection.
Date : 2025-12-16 Size : 8kb User : rain
[JSP/Java] MD5 DL : 0: 这款软件采用Java编写，主要实现了将任意长度的单项散列函数进行加密。-Using Java , this software mainly realizes the encryption for the arbitrary length of hash function.
Date : 2025-12-16 Size : 148kb User : 张一
[JSP/Java] HashItOut2(source-code) DL : 0: Hash Table with .equal(Object obj) function and Difference function with Hash table Output-Hash Table with .equal(Object obj) function and Difference function with Hash table Output...
Date : 2025-12-16 Size : 2kb User : TacoMeat
[JSP/Java] BloomFilter DL : 0: 如需要判断一个元素是不是在一个集合中，我们通常做法是把所有元素保存下来，然后通过比较知道它是不是在集合内，链表、树都是基于这种思路，当集合内元素个数的变大，我们需要的空间和时间都线性变大，检索速度也越来越慢。 Bloom filter 采用的是哈希函数的方法，将一个元素映射到一个 m 长度的阵列上的一个点，当这个点是 1 时，那么这个元素在集合内，反之则不在集合内。这个方法的缺点就是当检测的元素很多的时候可能有冲突，解决方法就是使用 k 个哈希函数对应 k 个点，如果所有点都是 1 的话，那么元素在集合内，如果有 0 的话，元素则不在集合内。- Such as the need to determine an element is not in a collection, we usually practice is to save all the elements, and then by comparing it is not in the collection, linked list, the tree is based on this idea, when the number of elements within the collection Larger, we need the space and time are linearly larger, more and more slow retri speed. Bloom filter uses a hash function to map an element to a point on an array of length m. When the point is 1, then the element is within the set, and vice versa. The disadvantage of this method is that when the detection of many elements may have a conflict, the solution is to use k hash function corresponding to k points, if all points are 1, then the element in the set, if 0, then the element Is not in the collection.
Date : 2025-12-16 Size : 5kb User : 李晓阳
[JSP/Java] HashFunction DL : 0: Hash function complete 11 papers
Date : 2025-12-16 Size : 2.94mb User : ariki