Branding/Logomark minus Citation Combined Shape Icon/Bookmark-empty Icon/Copy Icon/Collection Icon/Close Copy 7 no author result Created with Sketch. Icon/Back Created with Sketch.
Loading Scinapse...
  • References (0)
  • Cited By (176)
Cited By176
Published on Jan 1, 2009
Levent Ertaul8
Estimated H-index: 8
(California State University, East Bay),
Omicel Catambay (California State University, East Bay)
After all those enhancements in Internet technology, the Internet has become part of people’s lives, so they want to have it ready to use not only on their PCs but also in their mobile devices. WLANs have become very popular thanks to the development of IEEE 802.11 standard family. As wireless applications and systems are widely adopted wireless security is becoming increasingly important. Wireless security is different then wired security primarily it gives potential attackers easy medium acces...
Published on Jan 1, 2005in IACR Cryptology ePrint Archive
Hongjun Wu16
Estimated H-index: 16
(Agency for Science, Technology and Research)
In this report, we point out a serious security flaw in Microsoft Word and Excel. The stream cipher RC4 [9] with key length up to 128 bits is used in Microsoft Word and Excel to protect the documents. But when an encrypted document gets modified and saved, the initialization vector remains the same and thus the same keystream generated from RC4 is applied to encrypt the different versions of that document. The consequence is disastrous since a lot of information of the document could be recovere...
26 Citations
Published on Feb 27, 2006
This thesis introduces, specifies and evaluates a novel key establishment mechanism to enable seamless authenticated handovers in IP networks called Inter-Domain Key Exchange Protocol (IDKE). The task of the IDKE protocol is to quickly re-establish trust and a shared session-key between the mobile node and the access network. This is implemented after a mobile node s handover by forwarding the session-key from the previous to the new access network. IDKE s major strength is in providing a secure...
Published on Feb 25, 2014
Markku-Juhani O. Saarinen14
Estimated H-index: 14
BLINKER is a light-weight cryptographic suite and record protocol built from a single permutation. Its design is based on the Sponge construction used by the SHA-3 algorithm KECCAK. We examine the SpongeWrap authenticated encryption mode and expand its padding mechanism to offer explicit domain separation and enhanced security for our specific requirements: shared secret half-duplex keying, encryption, and a MAC-and-continue mode. We motivate these enhancements by showing that unlike legacy prot...
11 Citations Source Cite
Published on Jan 1, 2005
Andrea Bittau9
Estimated H-index: 9
(University College London)
The 802.11 encryption standard Wired Equivalent Privacy (WEP) is still widely used today despite the numerous discussions on its insecurity. Although WEP definitely faces serious security problems, there is no single tool which will recover any WEP key with minimal eort from the user and in a very short amount of time. In this paper, we present a mechanism which allows an attacker to send arbitrary data on a WEP network after having eavesdropped a single data packet. Many common WEP attacks requ...
7 Citations
Published on Jan 1, 2006
Keijo Haataja1
Estimated H-index: 1
2 Citations
Published on Dec 15, 2012 in International Conference on Information Systems Security
Alberto Peinado10
Estimated H-index: 10
Amparo Fúster-Sabater11
Estimated H-index: 11
Pseudorandom bit generators based on shift registers with dynamic feedback are analyzed for their possible application in symmetric cryptography (stream ciphers). Certain cryptographic parameters such as maximum period or linear span are obtained for the generated sequences, while estimations for autocorrelation and cross-correlation of such sequences are presented too. Several remarks regarding the non convenience of such generators for cryptographic or CDMA applications are also stated.
2 Citations Source Cite
Published on Jun 8, 2011 in Computational Intelligence and Security
In the present work, it is shown that the binary sequences obtained from a cryptographic generator, the so-called generalized self-shrinking generator, are just particular solutions of a type of linear difference equations. Cryptographic parameters e.g. period, linear complexity or balancedness of the previous sequences can be analyzed in terms of linear equation solutions. In brief, computing the solutions of linear difference equations is an easy method of generating new sequences with guarant...
Source Cite
Published on Jan 1, 2003
Katherine Hane Connelly (University of Illinois at Urbana–Champaign)
Published on Jun 20, 2011 in International Conference on Computational Science and Its Applications
Amparo Fúster-Sabater11
Estimated H-index: 11
In this paper, a procedure of decomposition of nonlinearly filtered sequences in primary characteristic sequences has been introduced. Such a procedure allows one to analyze structural properties of the filtered sequences e.g. period and linear complexity, which are essential features for their possible application in cryptography. As a consequence of the previous decomposition, a simple constructive method that enlarges the number of known filtered sequences with guaranteed cryptographic parame...
1 Citations Source Cite
View next paperWeaknesses in the Key Scheduling Algorithm of RC4