scispace - formally typeset
Patent

Method of building fast MACS from hash functions

Bart Preneel, +1 more
TLDR
In this article, the authors proposed a keyed hash function, in which secret keys are used at certain locations of the compression process and the keys are also hashed, in order to build fast message authentication codes from hash functions.
Abstract: 
Hash functions are important in modern cryptography. Main applications are their use in conjunction with digital signature schemes and message authentication. Hash functions, commonly known as message authentication codes (MACs), have received widespread use in practice for data integrity and data origin authentication. New and inventive ways of building fast MACs from hash functions involve keyed hash functions in which secret keys are used at certain locations of the compression process and the keys are also hashed.

read more

Citations
More filters
Patent

Method and apparatus for authenticating an open system application to a portable IC device

John D. DeTreville
TL;DR: In this paper, a secure communication channel between an open system and a portable IC device is established, where an application running on the open system desiring access to the information on the portable IC devices authenticates itself to the portable device, proving that it is trustworthy.
Patent

Secure execution of program code

Paul England, +1 more
TL;DR: In this paper, the memory is organized into hierarchically curtained rings, and peer sub-rings are denied access to each other as well as to more secure rings, where code entry points are restricted and atomic execution is assured.
Patent

Method and system for allowing code to be securely initialized in a computer

Paul England, +1 more
TL;DR: In this paper, a memory controller prevents CPUs and other I/O bus masters from accessing memory during a code (for example, trusted core) initialization process and allows a CPU to begin accessing memory at a particular location (identified to the CPU by the memory controller).
Patent

A method and apparatus for digital watermarking of images

Ping Wah Wong
TL;DR: The watermark insertion procedure computes a hash function and then combines the output of the hashed function of a modified image block, a key and various image parameters with a block of the watermark bitmap, resulting in a combined image block as discussed by the authors.
Patent

Controlling access to content based on certificates and access predicates

Paul England, +2 more
TL;DR: In this article, the authors propose an access predicate for content downloaded to a subscriber computer from a provider, which is compared with a rights manager certificate associated with an entity, such as an application, that wants access to the content.
References
More filters
Book ChapterDOI

LFSR-based Hashing and Authentication

Hugo Krawczyk
TL;DR: The characterization of the properties required from a family of hash functions in order to be secure for authentication when combined with a (secure) stream cipher is characterization.
Book ChapterDOI

The MD4 Message-Digest Algorithm

Ronald L. Rivest
TL;DR: The MD4 message digest algorithm takes an input message of arbitrary length and produces an output 128-bit "fingerprint" or "message digest", in such a way that it is (hopefully) computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message digest.
Book ChapterDOI

Collisions for the compression function of MD5

Bert den Boer, +1 more
TL;DR: In this paper an algorithm is described that finds collisions for the compression function of MD5 and results in an approximate relation between any four consecutive additive constants.
Book ChapterDOI

On the need for multipermutations: Cryptanalysis of MD4 and SAFER

Serge Vaudenay
TL;DR: It is argued that boxes which fail to be multipermutations can open the way to unsuspected attacks.
Patent

Pseudo-random generator

William Aiello, +1 more
TL;DR: In this article, a secure block cypher encoder was proposed to generate cryptographically strong pseudo-random bit streams, where each bit is related to an inner product between each input to the encoder and a second seed (h).