Online ISSN
1751-8717
Print ISSN
1751-8709
IET Information Security
Volume 1, Issue 1, March 2007
Volumes & issues:
Volume 1, Issue 1
March 2007
-
- Author(s): T. Good and M. Benaissa
- Source: IET Information Security, Volume 1, Issue 1, p. 1 –10
- DOI: 10.1049/iet-ifs:20060059
- Type: Article
- + Show details - Hide details
-
p.
1
–10
(10)
Two designs have been presented for high throughput pipelined implementation using field-programmable gate arrays (FPGAs) of the advanced encryption standard (AES). Both are believed to be faster than the existing FPGA designs and achieve throughputs of 30 and 28 Gbps. The fastest design achieves a throughput, for either encipher or decipher, in excess of 30 Gbps using a Xilinx Spartan-III part and allows key changes every 120 cycles. A second design achieves a throughput of 28 Gbps using a Xilinx Virtex-II part and supports both key and encipher/decipher changes every clock cycle. In order to achieve this, careful floor planning and a novel pipelined key expander were developed together with modifications to the MixColumns and composite field implementation of the SubBytes operation. Such an architecture has application for servers supporting multiple AES secure channels and can support, in a multi-channel environment, any feedback mode, including cipher block chaining. Previous pipelined designs have not shown this capability. - Author(s): J. Daemen and V. Rijmen
- Source: IET Information Security, Volume 1, Issue 1, p. 11 –17
- DOI: 10.1049/iet-ifs:20060099
- Type: Article
- + Show details - Hide details
-
p.
11
–17
(7)
Plateau characteristics are a special type of characteristics whose probability depends on the key and can have only two values. For a (usually small) subset of the keys it has a non-zero probability and for all other keys its probability is zero. For a large group of ciphers, including the AES, all two-round characteristics are plateau characteristics. For the AES and other ciphers with a similar structure, the vast majority of characteristics over four or more rounds are plateau characteristics. In the case of the AES, for most keys, there are two-round characteristics with fixed-key probability equal to 32/232, whereas the maximum expected differential probability of two-round differentials is at most 13.25/232. - Author(s): B. Chung ; H. Kim ; H. Yoon
- Source: IET Information Security, Volume 1, Issue 1, p. 19 –26
- DOI: 10.1049/iet-ifs:20060033
- Type: Article
- + Show details - Hide details
-
p.
19
–26
(8)
An improved base-phis expansion method is proposed, in which the bit-length of coefficients is shorter and the number of coefficients is smaller than in Kobayashi's expansion method. The proposed method meshes well with efficient multi-exponentiation algorithms. In addition, two efficient algorithms based on the proposed expansion method, named phis-wNAF and phis-SJSF, are presented which significantly reduce the computational effort involved in online precomputation by using the property of Frobenius endomorphism. The proposed algorithms noticeably accelerate computation of a scalar multiplication on Koblitz curves over optimal extension fields (OEFs). In particular, for OEFs where the characteristic is close to 32 bits or 64 bits, the required number of additions is reduced up to 50% in comparison with Kobayashi's base-phis scalar multiplication algorithm. Finally, a method that significantly reduces the memory usage of the precomputation table at the expense of slightly more computation is presented. - Author(s): J.S. Park ; G. An ; D. Chandra
- Source: IET Information Security, Volume 1, Issue 1, p. 27 –35
- DOI: 10.1049/iet-ifs:20060084
- Type: Article
- + Show details - Hide details
-
p.
27
–35
(9)
A P2P computing environment can be an ideal platform for resource-sharing services in an organisation if it provides trust mechanisms. Current P2P technologies offer content-sharing services for non-sensitive public domains in the absence of trust mechanisms. The lack of sophisticated trust mechanisms in the current P2P environment has become a serious constraint for broader applications of the technology although it has great potential. Therefore in this work an approach for securing transactions in the P2P environment is introduced, and ways to incorporate an effective and scalable access control mechanism – role-based access control (RBAC) – into current P2P computing environments has been investigated, proposing two different architectures: requesting peer-pull (RPP) and ultrapeer-pull (UPP) architectures. To provide a mobile, session-based authentication and RBAC, especially in the RPP architecture, lightweight peer certificates (LWPCs) are developed. Finally, to prove the feasibility of the proposed ideas, the RPP and UPP RBAC architectures are implemented and their scalability and performance are evaluated. - Author(s): C. Jin ; Z.-G. Qu ; Z.-M. Zhang ; Y. Jiang
- Source: IET Information Security, Volume 1, Issue 1, p. 37 –42
- DOI: 10.1049/iet-ifs:20060083
- Type: Article
- + Show details - Hide details
-
p.
37
–42
(6)
A novel dual watermark technology based on digital copyright technology is proposed, which, making full use of the advances of the web, stores the correlation information including the keys and the dual watermarks in an XML document. A new image watermarking technology to spread a digital image with copyright protection is realised successfully on the Internet. The arithmetic has very good robustness against the most common, non-malevolent data manipulations, including digital-to-analogue conversion and digital format conversion. Finally, the experimental results confirm that the two watermarks embedded by the proposed algorithm are invisible and robust against commonly used image-processing manipulations such as JPEG compression, adding noise, cropping, and rescaling and soon. The proposed algorithm is shown to provide very good results in term of image imperceptibility too. - Author(s): T. Hwang and K.-C. Lee
- Source: IET Information Security, Volume 1, Issue 1, p. 43 –45
- DOI: 10.1049/iet-ifs:20060124
- Type: Article
- + Show details - Hide details
-
p.
43
–45
(3)
Public discussion is a useful way for quantum key distribution protocols to reveal the presence of eavesdroppers. However, to ensure better security, nearly 50% of the transmitted qubits are spent in public discussions. Consequently, the original EPR quantum key distribution protocol provides only 25% qubit efficiency and Deng et al.'s scheme delivers only 50% qubit efficiency. By bringing classical cryptographic techniques into the quantum arena, this work proposes EPR quantum key distribution protocols with a potential of 100% qubit efficiency.
Pipelined AES on FPGA with support for feedback modes (in a multi-channel environment)
Plateau characteristics
Improved base-phis expansion method for Koblitz curves over optimal extension fields
Trusted P2P computing environments with role-based access control
Web dual watermarking technology using an XML document
EPR quantum key distribution protocols with potential 100% qubit efficiency
Most viewed content for this Journal
Article
content/journals/iet-ifs
Journal
5
Most cited content for this Journal
-
High accuracy android malware detection using ensemble learning
- Author(s): Suleiman Y. Yerima ; Sakir Sezer ; Igor Muttik
- Type: Article
-
Crypto-based algorithms for secured medical image transmission
- Author(s): Ali Al-Haj ; Gheith Abandah ; Noor Hussein
- Type: Article
-
Pseudorandom bit generator based on non-stationary logistic maps
- Author(s): Lingfeng Liu ; Suoxia Miao ; Hanping Hu ; Yashuang Deng
- Type: Article
-
Constructing important features from massive network traffic for lightweight intrusion detection
- Author(s): Wei Wang ; Yongzhong He ; Jiqiang Liu ; Sylvain Gombault
- Type: Article
-
Empirical analysis of Tor Hidden Services
- Author(s): Gareth Owen and Nick Savage
- Type: Article
