| Srl | Item |
| 1 |
ID:
130562
|
|
|
| 2 |
ID:
149001
|
|
|
|
|
| Summary/Abstract |
International data encryption algorithm (IDEA) is a secret key or symmetric key block cipher. The purpose of IDEA was to replace data encryption standard (DES) cipher, which became practically insecure due to its small key size of 56 bits and increase in computational power of systems. IDEA cipher mainly to provide data confidentiality in variety of applications such as commercial and financial application e.g. pretty good privacy (PGP) protocol. Till 2015, no successful linear or algebraic weaknesses IDEA of have been reported. In this paper, author explained IDEA cipher, its application in PGP and did a systematic survey of various attacks attempted on IDEA cipher. The best cryptanalysis result which applied to all keys could break IDEA up to 6 rounds out of 8.5 rounds of the full IDEA cipher1. But the attack requires 264 known plaintexts and 2126.8 operations for reduced round version. This attack is practically not feasible due to above mention mammoth data and time requirements. So IDEA cipher is still completely secure for practical usage. PGP v2.0 uses IDEA cipher in place of BassOmatic which was found to be insecure for providing data confidentiality.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 3 |
ID:
000481
|
|
|
|
|
| Publication |
DelhI, Shubhi Publication, 2000.
|
| Description |
xii, 432p.
|
| Standard Number |
8187226382
|
|
|
|
|
|
|
|
|
|
|
|
Copies: C:1/I:0,R:0,Q:0
Circulation
| Accession# | Call# | Current Location | Status | Policy | Location |
| 041784 | 355.0209546/SHA 041784 | Main | On Shelf | General | |
|
|
|
|
| 4 |
ID:
149005
|
|
|
|
|
| Summary/Abstract |
This paper presents the number of k-stage integer recurrence relations (IRR) over the ring Z2 which generates sequences of maximum possible period (2k-1)2e-1 for e>1. This number corresponds to the primitive polynomials mod 2 which satisfy the condition proposed by Brent and is2(e-2)k+1(2k-1-1) for e>3. This number is same as measured by Dai but arrived at with a different condition for maximum period. Our way of counting gives an explicit method for construction of such polynomials. Furthermore, this paper also presents the number of different sequences corresponding to such IRRs of maximum period.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|