Results 1  10
of
18
Are `Strong' Primes Needed for RSA?
 In The 1997 RSA Laboratories Seminar Series, Seminars Proceedings
, 1999
"... We review the arguments in favor of using socalled "strong primes" in the RSA publickey cryptosystem. There are two types of such arguments: those that say that strong primes are needed to protect against factoring attacks, and those that say that strong primes are needed to protect a ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We review the arguments in favor of using socalled "strong primes" in the RSA publickey cryptosystem. There are two types of such arguments: those that say that strong primes are needed to protect against factoring attacks, and those that say that strong primes are needed to protect against "cycling" attacks (based on repeated encryption).
Verifiable Escrowed Signature
, 1997
"... . We combine a publicly verifiable encryption technique and a Schnorr type signature scheme to achieve a verifiable escrowed signature scheme. The scheme allows a signer to convince a verifier the validity of a signature without letting him see the signature value. The unavailable but verifiable sig ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
. We combine a publicly verifiable encryption technique and a Schnorr type signature scheme to achieve a verifiable escrowed signature scheme. The scheme allows a signer to convince a verifier the validity of a signature without letting him see the signature value. The unavailable but verifiable signature is encrypted under a public key of someone (e.g., a trusted third party) who stays offline. The technique will have useful applications in such as fair exchange of contracts between two untrusted parties without using online help of a commonly trusted third party, and fair escrow cryptosystems using offline escrow agents. 1 Introduction In [14], Stadler presented a publicly verifiable encryption (PVE) technique that allows to verifiably encrypt the discrete logarithm of a known value. In other words, Alice (prover) sends to Bob (verifier) a value V and ciphertext C which encrypts a plaintext message under someone's public key (of course, other than the verifier's); Alice can convi...
Atkin's test: news from the front
 IN ADVANCES IN CRYPTOLOGY
, 1990
"... We make an attempt to compare the speed of some primality testing algorithms for certifying 100digit prime numbers. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We make an attempt to compare the speed of some primality testing algorithms for certifying 100digit prime numbers.
DISTRIBUTED PRIMALITY PROVING AND THE PRIMALITY OF (2^3539+ 1)/3
, 1991
"... We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the lO65digit (2^3539+ l)/3, the fir ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certification of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the lO65digit (2^3539+ l)/3, the first ordinary Titanic prime.
Short Signatures from Difficulty of Factorization Problem
"... New ways are proposed to design short signature schemes based on difficulty of factorizing a composite number n that is a product of two large secret primes. The paper presents digital signature schemes in which the signature represents a pair of numbers (k, g) and its length is reduced to 320 bits ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
New ways are proposed to design short signature schemes based on difficulty of factorizing a composite number n that is a product of two large secret primes. The paper presents digital signature schemes in which the signature represents a pair of numbers (k, g) and its length is reduced to 320 bits providing security of the RSA cryptosystem with 1024bit modulus.
Secure Computations on Handheld Devices with the Help of an Untrusted Server
 SERVER. THE 7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS (SCI 2003
, 2003
"... Recently, handheld devices have become one of the most popular computing tools. Although handheld devices are able to perform anything that a PC can do, their lack of computing power makes it next to impossible to perform some heavy calculations. Hence it appears very useful to have a combination of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Recently, handheld devices have become one of the most popular computing tools. Although handheld devices are able to perform anything that a PC can do, their lack of computing power makes it next to impossible to perform some heavy calculations. Hence it appears very useful to have a combination of a handheld with a PC, where the PC can perform heavy calculations to assist the handheld. However, we must be assured that the PC will not have learnt anything from the interaction. In this paper, we show two schemes which involve some serveraided computation where the server has not learnt anything from the interaction with the handheld device. The first scheme is to generate a strong prime number in a handheld, which can be used as a candidate for the RSA algorithm. The second scheme is to allow the server to behave as an authentication oracle on behalf of the handheld. The handheld will prepare a message that needs to be authenticated by sending it to the server in a blinded form, so that the server will not learn about the message. On the other hand, the handheld will not learn about the server's secret.
UNIVERSITY OF WOLLONGONG
, 2004
"... COPYRIGHT WARNING You may print or download ONE copy of this document for the purpose of your own research or study. The University does not authorise you to copy, communicate or otherwise make available electronically to any other person any copyright material contained on this site. You are remind ..."
Abstract
 Add to MetaCart
COPYRIGHT WARNING You may print or download ONE copy of this document for the purpose of your own research or study. The University does not authorise you to copy, communicate or otherwise make available electronically to any other person any copyright material contained on this site. You are reminded of the following: Copyright owners are entitled to take legal action against persons who infringe their copyright. A reproduction of material that is protected by copyright may be a copyright infringement. A court may impose penalties and award damages in relation to offences and infringements relating to copyright material. Higher penalties may apply, and higher damages may be awarded, for offences and infringements involving the conversion of material into digital or electronic form.
Cryptoschemes Based on Difficulty of Simultaneous Solving Two Different Difficult Problems ∗
"... The paper proposes a general method for construction cryptoschemes based on difficulty of simultaneous solving factoring (FP) and discrete logarithm modulo prime problem (DLpP). The proposed approach is applicable for construction digital signatures (usual, blind, collective), public key encryption ..."
Abstract
 Add to MetaCart
The paper proposes a general method for construction cryptoschemes based on difficulty of simultaneous solving factoring (FP) and discrete logarithm modulo prime problem (DLpP). The proposed approach is applicable for construction digital signatures (usual, blind, collective), public key encryption algorithms, public key distribution protocols, and cryptoschemes of other types. Moreover, the proposed approach provides reducing the signature size and increasing the rate of the cryptoschemes, while comparing with the known designs of the digital signature protocols based on the FP and DLpP.