Sciweavers

6251 search results - page 840 / 1251
» Randomness, Computability, and Density
Sort
View
ISW
2000
Springer
15 years 11 months ago
A Signcryption Scheme Based on Integer Factorization
Abstract. Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable origin authenticity, at a lower ...
Ron Steinfeld, Yuliang Zheng
IWSSD
2000
IEEE
15 years 11 months ago
The Complexity of TRMCS-like Spiral Specification
Modern software is often constructed using "spiral specification"; i.e. the specification is a dynamic document that is altered by experience with the current version of...
Tim Menzies
IMA
1995
Springer
97views Cryptology» more  IMA 1995»
15 years 11 months ago
A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
Anne Canteaut
AAAI
2007
15 years 10 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
USENIX
2007
15 years 10 months ago
Passwords for Everyone: Secure Mnemonic-based Accessible Authentication
In many environments, a computer system is severely constrained to the extent that the practical input mechanisms are merely binary switches. Requiring the user to remember a long...
Umut Topkara, Mercan Topkara, Mikhail J. Atallah