Hasil Pencarian  ::  Simpan CSV :: Kembali

"This Festschrift volume, published in honor of Jean-Jaques Quisquater on the occasion of his 65th Birthday, contains 33 papers from colleagues all over the world and deals with all the fields to which Jean-Jaques dedicated his work during his academic career. Focusing on personal tributes and re-visits of Jean-Jaques Quisquater's legacy, the volume addresses the following central topics: symmetric and asymmetric cryptography, side-channels attacks, hardware and implementations, smart cards, and information security. In addition there are four more contributions just "as diverse as Jean-Jacques' scientific interests"."

"Preventing fault attacks without sacrificing performance is nontrivial and this is the subject of this book. Part I deals with side-channel analysis and its relevance to fault attacks. The chapters in Part II cover fault analysis in secret key cryptography, with chapters on block ciphers, fault analysis of DES and AES, countermeasures for symmetric-key ciphers, and countermeasures against attacks on AES. Part III deals with fault analysis in public key cryptography, with chapters dedicated to classical RSA and RSA-CRT implementations, elliptic curve cryptosystems and countermeasures using fault detection, devices resilient to fault injection attacks, lattice-based fault attacks on signatures, and fault attacks on pairing-based cryptography. Part IV examines fault attacks on stream ciphers and how faults interact with countermeasures used to prevent power analysis attacks. Finally, Part V contains chapters that explain how fault attacks are implemented, with chapters on fault injection technologies for microprocessors, and fault injection and key retrieval experiments on a widely used evaluation board."

"This book constitutes the thoroughly refereed proceedings of the 9th Theory of Cryptography Conference, TCC 2012, held in Taormina, Sicily, Italy, in March 2012. The 36 revised full papers presented were carefully reviewed and selected from 131 submissions. The papers are organized in topical sections on secure computation, (blind) signatures and threshold encryption, zero-knowledge and security models, leakage-resilience, hash functions, differential privacy, pseudorandomness, dedicated encryption, security amplification, and resettable and parallel zero knowledge."

"This book constitutes the refereed proceedings of the 10th International Conference on Applied Cryptography and Network Security, ACNS 2012, held in Singapore, in June 2012.The 33 revised full papers included in this volume were carefully reviewed and selected from 192 submissions. They are organized in topical sessions on authentication, key management, block ciphers, identity-based cryptography, cryptographic primitives, cryptanalysis, side channel attacks, network security, Web security, security and privacy in social networks, security and privacy in RFID systems, security and privacy in cloud systems, and security and privacy in smart grids."

"This festschrift volume, published in honor of Jürgen Dassow on the occasion of his 65th birthday, contains 19 contributions by leading researchers, colleagues, and friends. Covering topics on picture languages, cooperating distributed systems of automata, quantum automata, grammar systems, online computation, word equations, biologically motivated formal systems, controlled derivations, descriptional complexity, as well as 'classical' topics of automata and language theory, the articles presented span the range of the scientific work of Jürgen Dassow."

"This book constitutes the refereed proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2012, held in Cambgridge, UK, in April 2012. The 41 papers, presented together with 2 invited talks, were carefully reviewed and selected from 195 submissions. The papers are organized in topical sections on index calculus, symmetric constructions, secure computation, protocols, lossy trapdoor functions, tools, symmetric cryptanalysis, fully homomorphic encryption, asymmetric cryptanalysis, efficient reductions, public-key schemes, security models, and lattices."

"This festschrift volume, published in honor of Bernd Krämer on the occasion of his 65th birthday, contains 11 contributions by close scientific companions. Covering topics like Petri nets and theoretical computer science, software and service engineering, cloud computing, and e-learning, the articles presented span the range of the scientific work of Bernd Krämer."

"ABSTRAKSandi Caesar merupakan salah satu algoritma kriptografi tertua didunia. Motode yang dimiliki sangat dasar dan sederhana sehingga mudah untuk ditembus. Peningkatan keamanan algoritma disusun dengan memberikan pergeseran angka yang bervariasi serta menggunakan karakter ASCII. Variasi nilai k dinamakan sebagai Countdown yang artinya nilai k menurun hingga k bernilai 1. Kunci Countdown diperoleh melalui panjang masukan. Pengujian dilakukan pada kecepatan dan tingkat keamanan kriptografi. Pada kecepatan keseluruhan proses kriptografi yang paling cepat dimiliki oleh sandi Caesar pada setiap nilai n masukan yaitu masing masing sebesar 22, 38, dan 234 μs. Pada n bernilai 1000 dan 10000, pengembangan algoritma memiliki perbedaan kecepatan yang kecil yaitu sebesar 1 dan 13 μs. Keamanan kriptografi diuji menggunakan uji kerandoman NIST dengan 3 metode yaitu Uji Frekuensi Monobit, Uji Frekuensi Monobit dalam Suatu Blok, dan Uji Runs. Pada uji frekuensi monobit, terdapat 22 barisan random dari 30 plaintext yang diujikan sedangkan ciphertext memiliki 25 barisan random. Pada uji frekuensi dalam suatu blok, terdapat 24 barisan random dari 30 plaintext yang diujikan sedangkan ciphertext memiliki 25 barisan random. Pada uji runs, 24 dari 30 pengujian plaintext disimpulkan bahwa barisan terseebut adalah random. Setelah diujiakan pada ciphertext, didapatkan bahwa 23 dari 30 pengujian merupakan barisan random.

---

ABSTRACTCaesar password is one of the oldest cryptographic algorithms in the world. The method you have is very basic and simple so it's easy to penetrate. Improved security algorithms are arranged by giving a varying number of shifts and using ASCII characters. Variations in the value of k are called Countdown, which means the value of k decreases to k value 1. The Countdown key is obtained through input length. Tests are carried out at the speed and level of cryptographic security. At the speed of the entire cryptographic process, the fastest is owned by the Caesar password on each input n value, which is 22, 38, and 234 μs respectively. In n values of 1000 and 10000, the development of algorithms has a small difference in speed which is equal to 1 and 13 μs. Cryptographic security was tested using the NIST standard test with 3 methods namely the The Frequency (Monobit) Test, Frequency Test within a Block, and Runs Test. In the monobit frequency test, there were 22 random rows of 30 plaintexts tested while the ciphertext had 25 random sequences. In the frequency test in a block, there are 24 random rows of 30 plaintexts tested while the ciphertext has 25 random rows. In the runs test, 24 of the 30 plaintext tests concluded that the sequence was random. After testing the ciphertext, it was found that 23 of the 30 tests were random sequences.

"

"This book constitutes the thoroughly refereed post-conference proceedings of the Joint Workshop on Theory of Security and Applications (formely known as ARSPA-WITS), TOSCA 2011, held in Saarbrücken, Germany, in March/April 2011, in association with ETAPS 2011. The 9 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 24 submissions. The papers feature topics including various methods in computer security, including the formal specification, analysis and design of security protocols and their applications, the formal definition of various aspects of security such as access control mechanisms, mobile code security and denial-of-service attacks, and the modeling of information flow and its application."