1 option
Progress in Cryptology -- INDOCRYPT 2003 : 4th International Conference on Cryptology in India, New Delhi, India, December 8-10, 2003, Proceedings / edited by Thomas Johansson, Subhamoy Maitra.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2904.
- Lecture Notes in Computer Science, 0302-9743 ; 2904
- Language:
- English
- Subjects (All):
- Data encryption (Computer science).
- Coding theory.
- Information theory.
- Computer networks.
- Operating systems (Computers).
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Cryptology.
- Coding and Information Theory.
- Computer Communication Networks.
- Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Local Subjects:
- Cryptology.
- Coding and Information Theory.
- Computer Communication Networks.
- Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (XII, 436 pages).
- Edition:
- First edition 2003.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
- System Details:
- text file PDF
- Contents:
- Invited Talks
- Linear Complexity and Related Complexity Measures for Sequences
- Forensic Computing
- Stream Cipher
- Hiji-bij-bij: A New Stream Cipher with a Self-synchronizing Mode of Operation
- Analysis of Non-fortuitous Predictive States of the RC4 Keystream Generator
- Block Cipher
- Nonlinearity Properties of the Mixing Operations of the Block Cipher IDEA
- Impossible Differential Cryptanalysis for Block Cipher Structures
- Impossible Differential Attack on 30-Round SHACAL-2
- Boolean Function
- Construction of Perfect Nonlinear and Maximally Nonlinear Multi-output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria
- Improved Cost Function in the Design of Boolean Functions Satisfying Multiple Criteria
- Secrect Sharing
- On Multiplicative Linear Secret Sharing Schemes
- A New (2,n)-Visual Threshold Scheme for Color Images
- On the Power of Computational Secret Sharing
- Bilinear Pairing
- Identity-Based Broadcasting
- Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings
- Extending Joux's Protocol to Multi Party Key Agreement
- Public Key
- Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups
- Prime Numbers of Diffie-Hellman Groups for IKE-MODP
- Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems
- Signature Scheme
- Security Analysis of Several Group Signature Schemes
- Forking Lemmas for Ring Signature Schemes
- Protocol
- Practical Mental Poker Without a TTP Based on Homomorphic Encryption
- Lightweight Mobile Credit-Card Payment Protocol
- Elliptic Curve and Algebraic Geometry
- On the Construction of Prime Order Elliptic Curves
- Counting Points on an Abelian Variety over a Finite Field
- Implementation and Digital Watermarking
- Side Channel Attack on Ha-Moon's Countermeasure of Randomized Signed Scalar Multiplication
- Systolic and Scalable Architectures for Digit-Serial Multiplication in Fields GF(p m )
- Cryptanalysis of Block Based Spatial Domain Watermarking Schemes
- Authentication
- More Efficient Password Authenticated Key Exchange Based on RSA
- A Password-Based Authenticator: Security Proof and Applications
- Stronger Security Bounds for OMAC, TMAC, and XCBC
- Progressive Verification: The Case of Message Authentication.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-24582-7
- 9783540245827
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.