Book Chapter10.1007/3-540-48184-2_12
Strong Practical Protocols
Judy H. Moore
- 16 Aug 1987
- pp 167-172
TL;DR: The mere existence of such algorithms is not enough to solve the problems of message secrecy and authentication, so the procedures for handling the data, including the use of a cryptoalgorithm, must insure that the desired level of security is achieved.
read more
Abstract: Recent progress in the area of cryptography has given rise to strong cryptoalgorithms using complex mathematical systems. These algorithms often require quite sophisticated computing capabilities for their implementation and are designed to withstand attack by equally sophisticated opponents with nearly unlimited resources available to them. However, the mere existence o f such algorithms is not enough to solve the problems of message secrecy and authentication. The procedures for handling the data, including the use of a cryptoalgorithm, must insure that the desired level of security is achieved. Such a set of rules or procedures is known as a cryptographic protocol.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Attacks on the HKM/HFX Cryptosystem
Xuejia Lai,Rainer A. Rueppel +1 more
- 21 Feb 1996
TL;DR: The HKM / HFX cryptosystem is proposed for standardization at the ITU Telecommunication Standardization Sector Study Group 8 and is designed to provide authenticity and confidentiality of FAX messages at a commercial level of security.
References
The Interrogator: Protocol Secuity Analysis
TL;DR: The Interrogator is a Prolog program that searches for security vulnerabilities in network protocols for automatic cryptographic key distribution, and has been able to rediscover a known vulnerability in a published protocol.
228
On Using RSA with Low Exponent in a Public Key Network
Johan Håstad
- 18 Aug 1985
TL;DR: The problem of solving systems of equations Pi(x) ? 0 (mod ni) i = 1... k where Pi are polynomials of degree d and the ni are distinct relatively prime numbers is considered and it is shown that x can recover x in polynomial time provided ni ? 2k.
A “weak” privacy protocol using the rsa crypto algorithm
TL;DR: In this paper, a "weaker" PRIVACY PROTOCOL USING the RSA CRYPTO ALGORITHM was proposed. But the RSA algorithm was not used in this paper.
72
Strong signature schemes
Shafi Goldwasser,Silvio Micali,Andrew Chi-Chih Yao +2 more
- 01 Dec 1983
TL;DR: Two signature schemes are exhibited for which any strategy of an adversary, who has seen all previously signed messages, that has a moderate success in forging even a single additional signature is transformable to a fast algorithm for factoring or inverting the RSA function.
63
A further weakness in the common modulus protocol for the rsa cryptoalgorithm
TL;DR: In this article, a further weakening in the common modulus protocol for the RSA cryptosystem has been discussed, leading to a further deterioration in the RSA's security and stability.
57