scispace - formally typeset
Search or ask a question
Topic

Key size

About: Key size is a research topic. Over the lifetime, 2288 publications have been published within this topic receiving 36260 citations. The topic is also known as: key length.


Papers
More filters
Book ChapterDOI
18 Aug 2015
TL;DR: An example of the additional power that a cascade provides is shown, a construction of a cascade that accepts a word in a regular language only if it is accompanied by a standard public key signature on that word.
Abstract: We introduce a functional encryption scheme based on the security of bilinear maps for the class of languages accepted by extended automata. In such an automaton, n DFAs, each with at most q states, are linked in a cascade such that the first DFA receives the input to the system and a feedback symbol from the last DFA, and in each transition the i-th DFA, $$i=1,\ldots ,n$$, both performs its own transition and outputs a symbol that acts as the input for DFA number $$i+1\mod n$$. The state of the whole system is an n-tuple consisting of the state of each component DFA. Our work extends the work of Waters Crypto'12 by replacing a single DFA with a cascade. Although both models accept all regular languages, a cascade automata reduces the number of states and therefore the key size for certain regular languages by an exponential factor. In both systems, a message m is encrypted with a word w and can be decrypted only by a key that is associated with an automaton that accepts w. Our scheme has key size $$Onq^2$$ and all its other efficiency measures including the ciphertext length, encryption and decryption times are linear in the length of w. As an example of the additional power that a cascade provides, we show a construction of a cascade that accepts a word in a regular language only if it is accompanied by a standard public key signature on that word. Our work improves on alternative approaches using functional encryption for general circuits or programs, by either being based on weaker assumptions, i.e. bilinear maps, or by being more efficient.
Journal Article
TL;DR: This work proposes the proof of concept of the GPGPU-accelerated system that can help detect and eliminate users' weak keys, and develops the GPU-optimised program code that substantially outperforms the tested CPU processor.
Abstract: We address one of the weaknesses of the RSA ciphering systems \textit{i.e.} the existence of the private keys that are relatively easy to compromise by the attacker. The problem can be mitigated by the Internet services providers, but it requires some computational effort. We propose the proof of concept of the GPGPU-accelerated system that can help detect and eliminate users' weak keys. We have proposed the algorithms and developed the GPU-optimised program code that is now publicly available and substantially outperforms the tested CPU processor. The source code of the OpenSSL library was adapted for GPGPU, and the resulting code can perform both on the GPU and CPU processors. Additionally, we present the solution how to map a triangular grid into the GPU rectangular grid \textendash{} the basic dilemma in many problems that concern pair-wise analysis for the set of elements. Also, the comparison of two data caching methods on GPGPU leads to the interesting general conclusions. We present the results of the experiments of the performance analysis of the selected algorithms for the various RSA key length, configurations of GPU grid, and size of the tested key set.
01 Jan 2015
TL;DR: This paper proposes FPGA implementations of the elliptic curve cryptography using matrix mapping concept as well as Steganography using LSB technique, which is done using XILINX.
Abstract: curve cryptography (ECC) is a new techniques for public key cryptography like RSA, it offers same security level but with smaller key size. Steganography on the other hand, hides the existence of a message and in the best case nobody can see that both parties are communicating in secret. Developing Crypto-Steg model for security enhancement in wireless network is performed by encrypting the message using Elliptic curve cryptography, and steganography technique. This paper propose FPGA implementations of the elliptic curve cryptography using matrix mapping concept as well as Steganography using LSB technique. Analysis, design and simulation of the elliptic curve and LSB module is done using XILINX.
Journal Article
TL;DR: A new network security algorithm called SF Block Cipher that uses 512 bit block size and 512 bit key size is presented that is implemented in .NET Framework.
Abstract: Now-a-days internet is widely used by a large number of people for both commercial and non-commercial purposes. Originally, internet was developed for educational and research purposes, and not for commercial applications. But today, internet is being used for entertainment, communication and education. Due to the rapid increase of users and advancements in technology, there is a great need for security. Cryptography plays a major role for providing the security for modern day applications. Many researches were carried out on secure block cipher. In this paper, we present a new network security algorithm called SF Block Cipher that uses 512 bit block size and 512 bit key size. This algorithm is implemented in .NET Framework.
Proceedings ArticleDOI
03 Jul 2021
TL;DR: In this paper, the authors proposed a secure symmetric stream cipher based on key hashing algorithm (SCKHA), which is based on hashing and splitting the encryption symmetric key to hide the encrypted key to prevent any intruder from forging the hash code.
Abstract: Cryptographic algorithms are playing an important role in the information security field. Strong and unbreakable algorithms provide high security and good throughput. The strength of any encryption algorithm is basically based on the degree of difficulty to obtain the encryption key by such cyber-attacks as brute. It is supposed that the bigger the key size, the more difficult it is to compute the key. But increasing the key size will increase both the computational complexity and the processing time of algorithms. In this paper, we proposed a reliable, effective, and more secure symmetric stream cipher algorithm for encryption and decryption called Symmetric Cipher based on Key Hashing Algorithm (SCKHA). The idea of this algorithm is based on hashing and splitting the encryption symmetric key. Hashing the key will hide the encrypted key to prevent any intruder from forging the hash code, and, thus, it satisfies the purpose of security, authentication, and integrity for a message on the network. In addition, the algorithm is secure against a brute-force attack by increasing the resources it takes for testing each possible key. Splitting the hashed value of the encryption key will divide the hashed key into two key chunks. The encryption process performed using such one chunk based on some calculations on the plaintext. This algorithm has three advantages that are represented in computational simplicity, security and efficiency. Our algorithm is characterized by its ability to search on the encrypted data where the plaintext character is represented by two ciphertext characters (symbols).

Network Information
Related Topics (5)
Encryption
98.3K papers, 1.4M citations
86% related
Wireless sensor network
142K papers, 2.4M citations
76% related
Wireless ad hoc network
49K papers, 1.1M citations
76% related
Network packet
159.7K papers, 2.2M citations
75% related
Server
79.5K papers, 1.4M citations
75% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202329
202245
202194
2020116
2019147
2018114