Sciweavers

53 search results - page 5 / 11
» Distinguishing Short Quantum Computations
Sort
View
SICHERHEIT
2008
14 years 9 days ago
Efficiency Improvement for NTRU
Abstract: The NTRU encryption scheme is an interesting alternative to well-established encryption schemes such as RSA, ElGamal, and ECIES. The security of NTRU relies on the hardne...
Johannes Buchmann, Martin Döring, Richard Lin...
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 10 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
ASIACRYPT
2000
Springer
14 years 3 months ago
Unconditionally Secure Digital Signature Schemes Admitting Transferability
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hi...

Book
363views
15 years 9 months ago
Computational Linguistics: Models, Resources, Applications
"Can computers meaningfully process human language? If this is difficult, why? If this is possible, how? This book introduces the reader to the fascinating science of computat...
Igor A. Bolshakov and Alexander Gelbukh
BMCBI
2008
128views more  BMCBI 2008»
13 years 11 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich