Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,368,838 papers from all fields of science
Search
Sign In
Create Free Account
Key size
Known as:
Cryptography/key length
, 128 bit encryption
, Key length
Expand
In cryptography, key size or key length is the number of bits in a key used by a cryptographic algorithm (such as a cipher). Key length defines the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
128-bit
256-bit
40-bit encryption
56-bit encryption
Expand
Broader (1)
Key management
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
AES and ECC Mixed for ZigBee Wireless Sensor Security
Saif Al-Alak
,
Zuriati Ahmed
,
Azizol Abdullah
,
S. Subramiam
2011
Corpus ID: 5927555
In this paper, we argue the security protocols of ZigBee wireless sensor network in MAC layer. AES 128-bit encryption algorithm…
Expand
2010
2010
Efficient utilization of elliptic curve cryptosystem for hierarchical access control
M. Nikooghadam
,
A. Zakerolhosseini
,
M. Moghaddam
Journal of Systems and Software
2010
Corpus ID: 41893066
2009
2009
An Efficient Authentication Scheme for Access Control in Mobile Pay-TV Systems
Hung-Min Sun
,
M. Leu
IEEE transactions on multimedia
2009
Corpus ID: 18339721
In a mobile pay-TV system, a large number of messages are exchanged for mutual authentication purposes. In traditional…
Expand
Highly Cited
2008
Highly Cited
2008
WG: A family of stream ciphers with designed randomness properties
Yassir Nawaz
,
G. Gong
Information Sciences
2008
Corpus ID: 21817972
Highly Cited
2004
Highly Cited
2004
Better Privacy for Trusted Computing Platforms: (Extended Abstract)
J. Camenisch
European Symposium on Research in Computer…
2004
Corpus ID: 15701256
The trusted computing group (TCG) specified two protocols that allow a trusted hardware device to remotely convince a…
Expand
2004
2004
Parallel cryptographic arithmetic using a redundant Montgomery representation
D. Page
,
N. Smart
IEEE transactions on computers
2004
Corpus ID: 3249212
We describe how using a redundant Montgomery representation allows for high-performance SIMD-based implementations of RSA and…
Expand
2003
2003
Optimal grouping algorithm for a group decision feedback detector in synchronous CDMA communications
Jie Luo
,
K. Pattipati
,
P. Willett
,
G. Levchuk
IEEE Transactions on Communications
2003
Corpus ID: 18052283
The group decision feedback (GDF) detector is studied in this letter. Given the maximum group size, a grouping algorithm is…
Expand
Highly Cited
2001
Highly Cited
2001
A Specification for Rijndael, the AES Algorithm
B. Gladman
2001
Corpus ID: 59635653
1.1 Rijndael Inputs and Outputs The input, the output and the cipher key for Rijndael are each bit sequences containing 128, 192…
Expand
1997
1997
The SPEED Cipher
Yuliang Zheng
Financial Cryptography
1997
Corpus ID: 15341893
SPEED is a private key block cipher. It supports three variable parameters: (1) data length — the length of a plaintext…
Expand
1997
1997
Reinterpreting Menopause : Cultural and Philosophical Issues
P. Komesaroff
,
Philipa Rothfield
,
J. Daly
1997
Corpus ID: 141540576
Reinterpreting Menopause brings together a number of reflections from a broad range of areas including feminism, cultural studies…
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
or Only Accept Required