Sciweavers

1560 search results - page 57 / 312
» Order Functions and Evaluation Codes
Sort
View
IMA
1999
Springer
69views Cryptology» more  IMA 1999»
14 years 1 months ago
Some Applications of Bounds for Designs to the Cryptography
Recent years have seen numerous examples when designs play an important role in the study of such topics in cryptography as secrecy and authentication codes, secret sharing scheme...
Svetla Nikova, Ventzislav Nikov
ICSM
1996
IEEE
14 years 29 days ago
Using Informal and Formal Techniques for the Reverse Engineering of C Programs
Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be...
Gerald C. Gannod, Betty H. C. Cheng
CGF
2005
159views more  CGF 2005»
13 years 8 months ago
Real-Time Shape Editing using Radial Basis Functions
Current surface-based methods for interactive freeform editing of high resolution 3D models are very powerful, but at the same time require a certain minimum tessellation or sampl...
Mario Botsch, Leif Kobbelt
SEMWEB
2007
Springer
14 years 2 months ago
OWL-CM: OWL Combining Matcher based on Belief Functions Theory
In this paper we propose a new tool called OWL-CM (OWL Combining Matcher) that deals with uncertainty inherent to ontology mapping process. On the one hand, OWL-CM uses the techniq...
Boutheina Ben Yaghlane, Najoua Laamari
LPAR
2005
Springer
14 years 2 months ago
Functional Correctness Proofs of Encryption Algorithms
Abstract. We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an imple...
Jianjun Duan, Joe Hurd, Guodong Li, Scott Owens, K...