Sciweavers

700 search results - page 122 / 140
» An Introduction to Quantum Computing
Sort
View
ASIACRYPT
2009
Springer
14 years 2 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
APSCC
2008
IEEE
14 years 2 months ago
Runtime Prediction Based Grid Scheduling of Parameter Sweep Jobs
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...
Sam Verboven, Peter Hellinckx, Frans Arickx, Jan B...
STACS
2007
Springer
14 years 1 months ago
A New Rank Technique for Formula Size Lower Bounds
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
Troy Lee
FOCS
2002
IEEE
14 years 19 days ago
Graph Isomorphism is in SPP
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
Vikraman Arvind, Piyush P. Kurur
SICHERHEIT
2008
13 years 9 months 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...