Sciweavers

1763 search results - page 20 / 353
» A Formalization of Polytime Functions
Sort
View
LPAR
2005
Springer
14 years 3 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...
ESORICS
2009
Springer
14 years 10 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
ACL2
2006
ACM
14 years 1 months ago
Quantification in tail-recursive function definitions
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Sandip Ray
DATE
2004
IEEE
130views Hardware» more  DATE 2004»
14 years 1 months ago
Utilizing Formal Assertions for System Design of Network Processors
System level modeling with executable languages such as C/C++ has been crucial in the development of large electronic systems from general processors to application specific desig...
Xi Chen, Yan Luo, Harry Hsieh, Laxmi N. Bhuyan, Fe...
PPDP
2009
Springer
14 years 4 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus