Sciweavers

3482 search results - page 305 / 697
» Designing for security
Sort
View
CISC
2007
Springer
111views Cryptology» more  CISC 2007»
16 years 25 days ago
Multivariates Polynomials for Hashing
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...
Jintai Ding, Bo-Yin Yang
TPDS
2010
87views more  TPDS 2010»
15 years 5 months ago
An ISP-Friendly File Distribution Protocol: Analysis, Design, and Implementation
Abstract—In the past few years, P2P file distribution applications (e.g., BitTorrent) are becoming so popular that they are the dominating source of Internet traffic. This crea...
Minghong Lin, John C. S. Lui, Dah-Ming Chiu
FSE
1998
Springer
102views Cryptology» more  FSE 1998»
15 years 11 months ago
Cryptanalytic Attacks on Pseudorandom Number Generators
In this paper we discuss PRNGs: the mechanisms used by real-world secure systems to generate cryptographic keys, initialization vectors, "random" nonces, and other values...
John Kelsey, Bruce Schneier, David Wagner, Chris H...
ACISP
2007
Springer
16 years 26 days ago
On Building Hash Functions from Multivariate Quadratic Equations
Recent advances in hash functions cryptanalysis provide a strong impetus to explore new designs. This paper describes a new hash function mq-hash that depends for its security on t...
Olivier Billet, Matthew J. B. Robshaw, Thomas Peyr...
CCR
1999
138views more  CCR 1999»
15 years 6 months ago
Context-agile encryption for high speed communication networks
Different applications have different security requirements for data privacy, data integrity, and authentication. Encryption is one technique that addresses these requirements. En...
Lyndon G. Pierson, Edward L. Witzke, Mark O. Bean,...