Results 301 to 310 of about 7,526,383 (337)

A Novel Key Management for Virtually Limitless Key Size

2015
The paper proposes key management between two parties, based on set of multimedia files shared by sender and recipient. The method is simple, fast, secure and robust. Possible key sizes are virtually limitless. One implementation, which uses YouTube website as a source of multimedia files, is presented.
Sasa Mrdovic, Narcis Behlilovic, Damir Omerasevic   +2 more
openaire   +2 more sources

Group Size and Composition of the Florida Key Deer

The Journal of Wildlife Management, 1976
During January 1968 through September 1973, 233 Key deer (Odocoileus virginianus clavium) were marked for individual recognition and monitored to gain information on their life history, habitat requirements, and behavior. As part of the study, the group size and composition were studied and compared to that of other races of white-tailed deer.
W. D. Klimstra, Nova J. Silvy, J. W. Hardin   +2 more
openaire   +2 more sources

Reducing the Key Size of the SRP Encryption Scheme

2016
Multivariate Public Key Cryptography MPKC is one of the main candidates for secure communication in a post-quantum era. Recently, Yasuda and Sakurai proposed in [8] a new multivariate encryption scheme called SRP, which is very efficient and resists all known attacks against multivariate schemes. However, the key sizes of the scheme are quite large. In
Duong, Dung Hoang, Petzoldt, Albrecht, Takagi, Tsuyoshi   +2 more
openaire   +3 more sources

ON MAXIMUM KEY POOL SIZE FOR A KEY PRE-DISTRIBUTION SCHEME IN WIRELESS SENSOR NETWORKS

International Journal of Computers and Applications, 2009
AbstractBootstrapping secure communication among sensor nodes deployed in hostile environments is an important and challenging problem. A common approach to solve this problem is to use a key predistribution scheme in which each sensor node is assigned a subset of keys selected from some key pool. The resilience of a key pre-distribution scheme depends
T.R. Belagodu, Neeraj Mittal
openaire   +2 more sources

Expanding Weak PRF with Small Key Size

2006
We propose modes for weakly-secure block ciphers that take one block input to provide output of arbitrary length. Damgard and Nielsen proposed such a mode called the Pseudorandom Tree (PRT) mode, and demonstrated that PRT could be used to establish a communication channel that is secure against Chosen-Plaintext Attacks, if the underlying block cipher ...
Yukiyasu Tsunoo, Kazuhiko Minematsu
openaire   +2 more sources

Fundamental study on the size and inter-key spacing of numeric keys for touch screen.

Journal of human ergology, 1996
The purpose of this study was to reveal the optimum size and inter-key spacing of numeric square keys for touch screens. Six male students (22-25 years old) and three female students (21-24 years old) volunteered as subjects for this experiment. Each subject took part in data entry tasks using numeric square keys of touch devices.
Yasuyuki Kikuchi, Tetsuo Katsuura, Hajime Harada   +2 more
openaire   +3 more sources

Secure sharing data using constant key size-aggregate key system

2016 3rd International Conference on Advanced Computing and Communication Systems (ICACCS), 2016
sharing data in a secure manner is a key factor in the aspect of data storage. In this project we propose a new system called key aggregate cryptosystem (KAC), which produces constant size aggregate key for efficient data sharing, instead of sharing multiple keys for multiple files.
M John Sathya, B S Revathi
openaire   +2 more sources

Fast and secure generating and exchanging a symmetric keys with different key size in TVWS

2015 International Conference on Computing, Control, Networking, Electronics and Embedded Systems Engineering (ICCNEEE), 2015
For efficient network applications, it's necessary to build security mechanisms for a secure communication. End-to-end security plays a crucial role for the communication in the network, to provide the confidentiality, the authentication and mostly the prevention from DOS attacks at high level.
Rashid A. Saeed, Rania A. Mokhtar, M.A Elshaikh, Mubark A. Elmubark   +3 more
openaire   +2 more sources

Large Key Sizes and the Security of Password-Based Cryptography

International Journal of Information Security and Privacy, 2009
We expose a potential vulnerability in the common use of password-based cryptography. When employing a user-chosen password to generate cryptographic keys which themselves are larger than the digest size of the underlying hash function, a part of the resulting key is produced deterministically and this, in turn, may lead to an exploitable weakness.
openaire   +2 more sources

Optimal multiway search trees for variable size keys

Acta Informatica, 1984
This paper considers the construction of optimal search trees for a sequence of n keys of varying sizes, under various cost measures. Constructing optimal search cost multiway trees is NP-hard, although it can be done in pseudo-polynomial time O3 and space O2, where L is the page size limit.
openaire   +2 more sources