Listing 1 - 7 of 7 |
Sort by
|
Choose an application
Digital signatures --- Hashing (Computer science) --- Standards --- Government policy --- Standards.
Choose an application
Digital signatures --- Hashing (Computer science) --- Standards --- Government policy --- Standards.
Choose an application
This book introduces pioneering developments in binary representation learning on visual images, a state-of-the-art data transformation methodology within the fields of machine learning and multimedia. Binary representation learning, often known as learning to hash or hashing, excels in converting high-dimensional data into compact binary codes meanwhile preserving the semantic attributes and maintaining the similarity measurements. The book provides a comprehensive introduction to the latest research in hashing-based visual image retrieval, with a focus on binary representations. These representations are crucial in enabling fast and reliable feature extraction and similarity assessments on large-scale data. This book offers an insightful analysis of various research methodologies in binary representation learning for visual images, ranging from basis shallow hashing, advanced high-order similarity-preserving hashing, deep hashing, as well as adversarial and robust deep hashing techniques. These approaches can empower readers to proficiently grasp the fundamental principles of the traditional and state-of-the-art methods in binary representations, modeling, and learning. The theories and methodologies of binary representation learning expounded in this book will be beneficial to readers from diverse domains such as machine learning, multimedia, social network analysis, web search, information retrieval, data mining, and others.
Information storage and retrieval systems. --- Image processing. --- Artificial intelligence --- Information Storage and Retrieval. --- Image Processing. --- Data Science. --- Data processing. --- Hashing (Computer science) --- Image processing --- Content-based image retrieval. --- Digital techniques.
Choose an application
This work presents recent developments in hashing algorithm design. Hashing is the process of creating a short digest (i.e., 64 bits) for a message of arbitrary length, for exam- ple 20 Mbytes. Hashing algorithms were first used for sear- ching records in databases; they are central for digital si- gnature applications and are used for authentication without secrecy. Covering all practical and theoretical issues related to the design of secure hashing algorithms the book is self contained; it includes an extensive bibliography on the topic.
Adressage calculé (Informatique) --- Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Computer algorithms --- Computer security --- Computerbeveiliging --- Computers--Beveiliging --- Hash coding (Computer science) --- Hashing (Computer science) --- Hashing (Computerleer) --- Informatique--Sécurité --- Sécurité informatique --- Computer algorithms. --- Computer security. --- Algorithmes --- Hashing (Computer science). --- Sécurité informatique --- Data structures (Computer scienc. --- Data encryption (Computer science). --- Coding theory. --- Combinatorics. --- Computer software. --- Operating systems (Computers). --- Data Structures. --- Cryptology. --- Coding and Information Theory. --- Algorithm Analysis and Problem Complexity. --- Operating Systems. --- Computer operating systems --- Computers --- Disk operating systems --- Systems software --- Software, Computer --- Computer systems --- Combinatorics --- Algebra --- Mathematical analysis --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming --- Data encoding (Computer science) --- Encryption of data (Computer science) --- Cryptography --- Operating systems
Choose an application
Build working implementations of hash tables, written in the C programming language. This book starts with simple first attempts devoid of collision resolution strategies, and moves through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. Hash tables, when implemented and used appropriately, are exceptionally efficient data structures for representing sets and lookup tables, providing low overhead, constant time, insertion, deletion, and lookup operations. The Joys of Hashing walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables. The source code used in the book is available on GitHub for your re-use and experiments. You will: Master the basic ideas behind hash tables Carry out collision resolution, including strategies for handling collisions and their consequences for performance Resize or grow and shrink tables as needed Store values by handling when values must be stored with keys to make general sets and maps.
Computer science. --- Programming Languages, Compilers, Interpreters. --- Programming Techniques. --- Hashing (Computer science) --- Hash coding (Computer science) --- File organization (Computer science) --- Informatics --- Science --- Programming languages (Electronic computers). --- Computer programming. --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Languages, Artificial --- Programming
Choose an application
This is a comprehensive description of the cryptographic hash function BLAKE, one of the five final contenders in the NIST SHA3 competition, and of BLAKE2, an improved version popular among developers. It describes how BLAKE was designed and why BLAKE2 was developed, and it offers guidelines on implementing and using BLAKE, with a focus on software implementation. In the first two chapters, the authors offer a short introduction to cryptographic hashing, the SHA3 competition, and BLAKE. They review applications of cryptographic hashing, they describe some basic notions such as security definitions and state-of-the-art collision search methods, and they present SHA1, SHA2, and the SHA3 finalists. In the chapters that follow, the authors give a complete description of the four instances BLAKE-256, BLAKE-512, BLAKE-224, and BLAKE-384; they describe applications of BLAKE, including simple hashing with or without a salt, and HMAC and PBKDF2 constructions; they review implementation techniques, from portable C and Python to AVR assembly and vectorized code using SIMD CPU instructions; they describe BLAKE’s properties with respect to hardware design for implementation in ASICs or FPGAs; they explain BLAKE's design rationale in detail, from NIST’s requirements to the choice of internal parameters; they summarize the known security properties of BLAKE and describe the best attacks on reduced or modified variants; and they present BLAKE2, the successor of BLAKE, starting with motivations and also covering its performance and security aspects. The book concludes with detailed test vectors, a reference portable C implementation of BLAKE, and a list of third-party software implementations of BLAKE and BLAKE2. The book is oriented towards practice – engineering and craftsmanship – rather than theory. It is suitable for developers, engineers, and security professionals engaged with BLAKE and cryptographic hashing in general, and for applied cryptography researchers and students who need a consolidated reference and a detailed description of the design process, or guidelines on how to design a cryptographic algorithm.
Data encryption (Computer science) --- Hashing (Computer science) --- Hash coding (Computer science) --- File organization (Computer science) --- Data encoding (Computer science) --- Encryption of data (Computer science) --- Computer security --- Cryptography --- Data encryption (Computer science). --- Computer security. --- Computer software. --- Cryptology. --- Systems and Data Security. --- Algorithm Analysis and Problem Complexity. --- Security Science and Technology. --- Software, Computer --- Computer systems --- Computer privacy --- Computer system security --- Computers --- Cyber security --- Cybersecurity --- Electronic digital computers --- Protection of computer systems --- Security of computer systems --- Data protection --- Security systems --- Hacking --- Protection --- Security measures --- Algorithms. --- System safety. --- Safety, System --- Safety of systems --- Systems safety --- Accidents --- Industrial safety --- Systems engineering --- Algorism --- Algebra --- Arithmetic --- Prevention --- Foundations
Choose an application
This SpringerBrief summarizes the development of Distributed Hash Table in both academic and industrial fields. It covers the main theory, platforms and applications of this key part in distributed systems and applications, especially in large-scale distributed environments. The authors teach the principles of several popular DHT platforms that can solve practical problems such as load balance, multiple replicas, consistency and latency. They also propose DHT-based applications including multicast, anycast, distributed file systems, search, storage, content delivery network, file sharing and communication. These platforms and applications are used in both academic and commercials fields, making Distributed Hash Table a valuable resource for researchers and industry professionals.
Computer networks. --- Electronic data processing -- Distributed processing. --- Neural networks (Computer science). --- Electronic data processing --- Engineering & Applied Sciences --- Computer Science --- Distributed processing --- Hashing (Computer science) --- Distributed operating systems (Computers) --- Hash coding (Computer science) --- Computer science. --- Computer communication systems. --- Information storage and retrieval. --- Electrical engineering. --- Computer Science. --- Information Systems Applications (incl. Internet). --- Computer Communication Networks. --- Information Storage and Retrieval. --- Communications Engineering, Networks. --- Operating systems (Computers) --- File organization (Computer science) --- Telecommunication. --- Electric communication --- Mass communication --- Telecom --- Telecommunication industry --- Telecommunications --- Communication --- Information theory --- Telecommuting --- Information storage and retrieval systems. --- Automatic data storage --- Automatic information retrieval --- Automation in documentation --- Computer-based information systems --- Data processing systems --- Data storage and retrieval systems --- Discovery systems, Information --- Information discovery systems --- Information processing systems --- Information retrieval systems --- Machine data storage and retrieval --- Mechanized information storage and retrieval systems --- Computer systems --- Electronic information resources --- Data libraries --- Digital libraries --- Information organization --- Information retrieval --- Application software. --- Electric engineering --- Engineering --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Application computer programs --- Application computer software --- Applications software --- Apps (Computer software) --- Computer software --- Distributed processing.
Listing 1 - 7 of 7 |
Sort by
|