Sciweavers

IMA
2001
Springer
134views Cryptology» more  IMA 2001»
13 years 10 months ago
Almost-Certainly Runlength-Limiting Codes
Standard runlength-limiting codes – nonlinear codes defined by trellises – have the disadvantage that they disconnect the outer errorcorrecting code from the bit-by-bit likeli...
David J. C. MacKay
IMA
2001
Springer
117views Cryptology» more  IMA 2001»
13 years 10 months ago
An Identity Based Encryption Scheme Based on Quadratic Residues
We present a novel public key cryptosystem in which the public key of a subscriber can be chosen to be a publicly known value, such as his identity. We discuss the security of the ...
Clifford Cocks
IMA
2001
Springer
91views Cryptology» more  IMA 2001»
13 years 10 months ago
The Wide Trail Design Strategy
n, important for interoperability only. We can make abstraction from the representation of the elements of GF(28 ) and consider a block cipher that operates on strings of elements ...
Joan Daemen, Vincent Rijmen
IMA
2001
Springer
90views Cryptology» more  IMA 2001»
13 years 10 months ago
Key Recovery Scheme Interoperability - A Protocol for Mechanism Negotiation
This paper investigates interoperability problems arising from the use of dissimilar key recovery mechanisms in encrypted communications. The components that can cause interoperabi...
Konstantinos Rantos, Chris J. Mitchell
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
13 years 10 months ago
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
Matthew G. Parker
Cryptology
Top of PageReset Settings