2897 search results - page 235 / 580 » Mobile Code Security |
148
click to vote
DCC
2001
IEEE
16 years 6 months ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
192
click to vote
SACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...
164
click to vote
PKC
2010
Springer
15 years 10 months ago
2010
Springer
Network coding is a method for achieving channel capacity in networks. The key idea is to allow network routers to linearly mix packets as they traverse the network so that recipi...
183
click to vote
IACR
2011
14 years 6 months ago
2011
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
198
click to vote
OOPSLA
1991
Springer
15 years 10 months ago
1991
Springer
PICASSOis a graphical user interface development environment built using the Common Lisp Object System (CLOS). This paper describes how CLOS features including multiple inheritanc...