Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,872,405 papers from all fields of science
Search
Sign In
Create Free Account
Weak key
Known as:
Flat keyspace
, Linear keyspace
, Linear key space
Expand
In cryptography, a weak key is a key, which, used with a specific cipher, makes the cipher behave in some undesirable way. Weak keys usually…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
27 relations
Authentication
Bar mitzvah attack
Block cipher
CIKS-1
Expand
Broader (1)
Key management
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Attribute-Based Encryption Goes X.509
Florian Reimair
,
Johannes Feichtner
,
Peter Teufl
IEEE International Conference on e-Business…
2015
Corpus ID: 7254440
Key authentication as well as an intended recipient not having a key available are, among others, challenges that public key…
Expand
2015
2015
Ensuring Distributed Accountability for Data Sharing in Cloud Using AES and SHA
V. Lonare
,
J. N. Nandimath
2015
Corpus ID: 18191079
Cloud computing is used to provide scalable services which are easily used over the internet as per the need basis. Cloud…
Expand
2014
2014
Weak key-IV Pairs in the A5/1 Stream Cipher
A. Al-Hamdan
,
Harry Bartlett
,
E. Dawson
,
L. Simpson
,
Kenneth Koon-Ho Wong
Artificial Intelligence and Symbolic Computation
2014
Corpus ID: 7272758
A5/1 is a shift register based stream cipher which provides privacy for the GSM system. In this paper, we analyse the loading of…
Expand
2012
2012
Weak Keys of the Full MISTY1 Block Cipher for Related-Key Cryptanalysis
Jiqiang Lu
,
W. Yap
,
Yongzhuang Wei
IACR Cryptology ePrint Archive
2012
Corpus ID: 8570931
The MISTY1 block cipher has a 64-bit block length, a 128-bit user key and a recommended number of 8 rounds. It is a Japanese…
Expand
2009
2009
Weak Keys in RSA with Primes Sharing Least Significant Bits
X. Meng
,
Jingguo Bi
Conference on Information Security and Cryptology
2009
Corpus ID: 23665272
Let N = pq be an LSBS-RSA modulus where primes p and q have the same bit-length and share the m least significant bits, and (p…
Expand
2005
2005
New Attacks Against Reduced-Round Versions of IDEA
P. Junod
Fast Software Encryption Workshop
2005
Corpus ID: 980420
In this paper, we describe a sequence of simple, yet efficient chosen-plaintext (or chosen-ciphertext) attacks against reduced…
Expand
2004
2004
Weak keys of graph cryptography
C. Prissette
Proceedings. International Conference on…
2004
Corpus ID: 24298596
This paper presents two families of weak keys, which can be combined to build a family of very weak keys. The detection algorithm…
Expand
Highly Cited
2002
Highly Cited
2002
New Weak-Key Classes of IDEA
A. Biryukov
,
Jorge Nakahara
,
B. Preneel
,
J. Vandewalle
International Conference on Information…
2002
Corpus ID: 2175249
This paper presents a large collection of new weak-key classes for the IDEA cipher. The classes presented in this paper contain…
Expand
1999
1999
Improved Analysis of Some Simplified Variants of RC6
S. Contini
,
R. Rivest
,
M. Robshaw
,
Y. Yin
Fast Software Encryption Workshop
1999
Corpus ID: 1414147
RC6 has been submitted as a candidate for the Advanced Encryption Standard (AES). Two important features of RC6 that were absent…
Expand
1993
1993
Block Ciphers Based on Modular Arithmetic
J. Daemen
,
R. Govaerts
,
J. Vandewalle
1993
Corpus ID: 3713254
The block ciphers PES and IPES were originally designed with the ambition to become the successor of DES as a standard. In this…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE