# Integrity Primitives for Secure Information Systems

@inproceedings{Bosselaers2005IntegrityPF, title={Integrity Primitives for Secure Information Systems}, author={Antoon Bosselaers and Bart Preneel}, booktitle={Lecture Notes in Computer Science}, year={2005} }

This is a manual intended for those seeking to secure information systems by applying modern cryptography. It represents the successful at tainment of goals by RIPE (RACE Integrity Primitives evaluation), a 350 man-month project funded in part by the Commission of the European Communities. The recommended portfolio of integrity primitives, which is the main product of the project, forms the heart of this volume. By integrity, we mean the kinds of security that can be achieved through…

## 68 Citations

### The Design and Analysis of Message Authentication and Authenticated Encryption Schemes

- Computer Science
- 2016

This thesis studies message authentication and authenticated encryption algorithms, which are symmetric-key solutions to providing data integrity and confidentiality, and introduces a new design, LightMAC, which enables keys to be used longer than typically possible and an existing construction, PMAC, is analyzed in depth for its potential to provide more security than what was commonly thought.

### Easing PAIN with Digital Signatures

- Computer Science
- 2011

An open source software tool can be used to study processes, procedures and algorithms used in digital signatures, and information about different types of digital signature certificates currently available, file formats used therein and programming support ofdigital signature in .NET languages is presented.

### Ensuring Authentication and Integrity of Open Source Software using Digital Signature

- Computer Science
- 2011

Methods for attaining authentication and integrity of Open Source Software for the purpose of its distribution are discussed.

### Message Authentication for Authenticated Encryption Scheme

- Computer Science
- 2011

This paper focuses on authentication component of AE mode and presents algorithms designed for the specific purpose of message authentication i.e.: Message Authentication Codes (MACs) based on CBC mode, MACsbased on cryptographic hash functions and MACs based on universal hashing.

### hPIN/hTAN: A Lightweight and Low-Cost E-Banking Solution against Untrusted Computers

- Computer Science, MathematicsFinancial Cryptography
- 2011

In this paper, we propose hPIN/hTAN, a low-cost hardware token based PIN/TAN system for protecting e-banking systems against the strong threat model where the adversary has full control over the…

### On Efficient Message Authentication Via Block Cipher Design Techniques

- Computer Science, MathematicsASIACRYPT
- 2007

In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have proposed a generic MAC…

### ECRYPT: The Cryptographic Research Challenges for the Next Decade

- Computer Science, MathematicsSCN
- 2004

Some of the challenging problems ahead in the area of cryptographic algorithms and protocols are discussed, and how the ECRYPT Network of Excellence tries to address some of the challenges by bringing together 250 European researchers in the Area of cryptology and the related area of watermarking is explained.

### Improving the Security of MACs Via Randomized Message Preprocessing

- Computer Science, MathematicsFSE
- 2007

The main insight of this work comes from the fact that, by using randomized message preprocessing via a short random salt p, one can use the "hash then encrypt" paradigm with suboptimal "practical" e-universal hash functions, and still improve its exact security to optimal O(q2/2k).

### A Concrete Security Analysis for 3GPP-MAC

- Computer ScienceFSE
- 2003

It is proved that f9 is a secure pseudorandom function by giving a concrete bound on an adversary’s inability to forge a MAC value in terms of her inability to distinguish the underlying block cipher from a random permutation.

## References

SHOWING 1-10 OF 31 REFERENCES

### Differential cryptanalysis of DES-like cryptosystems

- Computer Science, MathematicsJournal of Cryptology
- 2004

A new type of cryptanalytic attack is developed which can break the reduced variant of DES with eight rounds in a few minutes on a personal computer and can break any reduced variantof DES (with up to 15 rounds) using less than 256 operations and chosen plaintexts.

### Note on the generation of p/sub 0/ for RSA keysets

- Mathematics
- 1990

A note has been published by Clayden regarding the value p0 = sr−1 (mod rs) − rs−1 (mod rs) (where r and s are distinct primes). This value of p0 can be used in the generation of strong primes for…

### On Generation of Probable Primes By Incremental Search

- Mathematics, Computer ScienceCRYPTO
- 1992

Under the prime r-tuple conjecture, an explicit upper bound as a function of k, t and s on the probability that this algorithm outputs a composite is shown, and a lower bound on the entropy of the output distribution over the primes is shown.

### Modular multiplication without trial division

- Mathematics, Computer Science
- 1985

A method for multiplying two integers modulo N while avoiding division by N, a representation of residue classes so as to speed modular multiplication without affecting the modular addition and subtraction algorithms.

### The knowledge complexity of interactive proof-systems

- Mathematics, Computer ScienceSTOC '85
- 1985

A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.

### Comparison of Three Modular Reduction Functions

- Computer Science, MathematicsCRYPTO
- 1993

Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett's algorithm and Montgomery's algorithm, whose application in the modular exponentiation operation is considered.

### The number field sieve

- Mathematics, Computer ScienceSTOC '90
- 1990

A heuristic run time analysis indicates that the number field sieve is asymptotically substantially faster than any other known factoring method, for the integers that it applies to, and can be modified to handle arbitrary integers.

### Computer Analysis of Images and Patterns

- Computer Science, ArtLecture Notes in Computer Science
- 1993

The computer analysis of images and patterns is universally compatible with any devices to read and is available in the book collection an online access to it is set as public so you can download it instantly.

### Publication 46

- US Department of Commerce, January
- 1977

### Contemporary Cryptology: The Science of Information Integrity

- Computer Science
- 1994

This book provides the engineer and scientist with algorithms, protocols, and applications of the science of information integrity, with an emphasis on the cryptographic elements of the subject.