Distributed Systems Page 1 DS 2006; Ch1 16-Jan-06 Timo Alanko, 2006 1 Distributed Systems Spring 2006 Timo Alanko 16-Jan-06 2 Sources of material • Tanenbaum, van …
Classic cryptographic protocols based on user-chosen keys allow an attacker to mount password-guessing attacks. A combination of asymmetric (public-key) and symmetric (secret …
W Diffie, PC Van Oorschot, MJ Wiener - Designs, Codes and cryptography, 1992 - Springer
We discuss two-party mutual authentication protocols providing authenticated key exchange, focusing on those using asymmetric techniques. A simple, efficient protocol …
Elliptic curves have been intensively studied in algebraic geometry and number theory. In recent years they have been used in devising efficient algorithms for factoring integers and …
This paper presents a new password authentication and key-exchange protocol suitable for authenticating users and exchanging keys over an untrusted network. The new protocol …
This book is intended as a text for a course on cryptography with emphasis on algebraic methods. It is written so as to be accessible to graduate or advanced undergraduate …
We present the first known implementation of elliptic curve cryptography over F/sub 2p/for sensor networks based on the 8-bit, 7.3828-MHz MICA2 mote. Through instrumentation of …
AK Lenstra, HW Lenstra Jr, MS Manasse… - Proceedings of the …, 1990 - dl.acm.org
The number field sieve is an algorithm to factor integers of the form r, 4-s for small positive r and s. This note is intended as a'report on work in progress' on this algorithm. We informally …
ЕР Данилкова - ШКОЛА МОЛОДЫХ УЧЕНЫХ, 2021 - elibrary.ru
В статье рассмотрены некоторые элементы теории чисел и показано, как они используются в современной криптографии. В качестве примеров выбраны наиболее …