Sciweavers

71 search results - page 7 / 15
» DNA-based random number generation in security circuitry
Sort
View
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
15 years 11 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
ATAL
2011
Springer
14 years 5 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...
IJNSEC
2010
143views more  IJNSEC 2010»
15 years 22 days ago
Nonce Generation For The Digital Signature Standard
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
Rajendra S. Katti, Rajesh G. Kavasseri
INFORMATICALT
2010
132views more  INFORMATICALT 2010»
15 years 3 months ago
An Improved Securer and Efficient Nonce-Based Authentication Scheme with Token-Update
In this paper, we propose a mutual authentication scheme using nonce variable instead of Mac address and accompanying with token updates to improve the functionality. Lee et al. (2...
Chiu-Hsiung Liao, Ching-Te Wang, Hon-Chan Chen
CSREASAM
2006
15 years 7 months ago
A New Robust and Secure Steganographic System for Greyscale Images
: The research work in this paper shows that the currently available stenographic methods might be quite easily detected by using sufficiently careful analysis of the transmitted d...
Hesham Elzouka