By Kenji Koyama, Yukio Tsuruoka, Noboru Kunihiro (auth.), Kwok-Yan Lam, Eiji Okamoto, Chaoping Xing (eds.)
Asiacrypt’99 was once held in Singapore on 14-18 November 1999. Asiacrypt is likely one of the significant occasions within the cryptology examine group. Asiacrypt’99, the ?fth annual Asiacrypt convention, was once subsidized via the Asiacrypt steerage Comm- tee and the Centre for structures safeguard of the nationwide collage of Singapore, and in cooperation with the overseas organization for Cryptology study. because the application Co-Chairs of Asiacrypt’99, we're tremendous venerated to or- nize this occasion, which showcases the state of the art improvement of cryptology learn on the end of this millennium. This 12 months, a complete of ninety six examine papers have been submitted to Asiacrypt’99. The portfolio of nation of beginning of submissions serves as an exceptional indicator of the - ternational popularity of the convention. nations from which submissions or- inated contain: Australia, Belgium, China, Estonia, France, Germany, Greece, India, Iran, Japan, Korea, Norway, Russia, Saudi Arabia, Switzerland, Sin- pore, Spain, Taiwan, Thailand, The Netherlands, Turkey, Ukraine, united kingdom, united states and Yugoslavia. via a stringent refereeing strategy by way of this system C- mittee, 31 papers of exceptional caliber have been authorized and are incorporated within the convention complaints. authorized papers have been authored by way of researchers from the subsequent international locations: Australia, Belgium, France, Germany, India, Japan, China, Singapore, Switzerland, Taiwan, The Netherlands, united kingdom, and USA.
Read or Download Advances in Cryptology - ASIACRYPT’99: International Conference on the Theory and Application of Cryptology and Information Security, Singapore, November 14-18, 1999. Proceedings PDF
Similar cryptography books
The booklet is designed to be available to encouraged IT execs who are looking to study extra in regards to the particular assaults coated. specifically, each attempt has been made to maintain the chapters autonomous, so if somebody is drawn to has functionality cryptanalysis or RSA timing assaults, they don't inevitably have to examine all the prior fabric within the textual content.
The aim of this ebook is to introduce the reader to mathematics subject matters, either historical and glossy, which have been on the heart of curiosity in purposes of quantity idea, rather in cryptography. No history in algebra or quantity concept is believed, and the publication starts with a dialogue of the fundamental quantity idea that's wanted.
From the foreword by means of Thomas Huang:
"During the previous decade, researchers in machine imaginative and prescient have came upon that probabilistic computer studying tools are tremendous robust. This ebook describes a few of these tools. as well as the utmost chance framework, Bayesian Networks, and Hidden Markov versions also are used. 3 points are under pressure: beneficial properties, similarity metric, and versions. Many attention-grabbing and significant new effects, according to study by way of the authors and their collaborators, are presented.
Although this booklet includes many new effects, it truly is written in a mode that fits either specialists and beginners in desktop imaginative and prescient. "
Chaos-based cryptography, attracting many researchers long ago decade, is a study box throughout fields, i. e. , chaos (nonlinear dynamic method) and cryptography (computer and information security). It Chaos homes, equivalent to randomness and ergodicity, were proved to be appropriate for designing the capacity for information security.
Extra info for Advances in Cryptology - ASIACRYPT’99: International Conference on the Theory and Application of Cryptology and Information Security, Singapore, November 14-18, 1999. Proceedings
This allows us to generate two sets of 2184 weak keys (together a fraction of approximately 2−7 − 2−16 of the key space) with a diﬀerent number of equivalent keys. These two sets have an intersection containing approximately 2172 weak keys (≈ 2−16 of the key space) with 274 equivalent keys each. – The case i = 1 is the same as for 128-bit keys. Hence, we know that 1 key in 256 is weak. We also know that the number of equivalent keys is determined by the Hamming weight of KX, and the most signiﬁcant bit of KX.
Finally we note that HPC in its present form is not suitable for use in hash function constructions. Acknowledgment The authors would like to thank R. Schroeppel for motivating their research by announcing an attractive prize for the best cryptanalysis of HPC. References 1. S. , Jan. 1977. 38 2. B. Preneel, R. Govaerts, J. Vandewalle, “Hash functions based on block ciphers: a synthetic approach,” Advances in Cryptology, Proceedings Crypto’93, LNCS 773, D. , Springer-Verlag, 1994, pp. 368–378. 38, 39 3.
We brieﬂy study the AES candidate HPC with key length equal to 192 and 256 bits. The results are summarized in Table 1. Finally we take a short look at some other key lengths. 1 Key Length 192 Bits Since the number of key words increases from two to three, we evaluate the dangerous equation (5) three times: i = 0 : s0 ^= (KX ^ KX) + KX[s0&255] (7) i = 1 : s0 ^= (KX ^ KX) + KX[s0&255] i = 2 : s0 ^= (KX ^ KX) + KX[s0&255] . (8) (9) As before, it turns out that initially, s0&255 = 0, hence there are no weak keys for i = 0.