Results 291 to 300 of about 391,497 (318)
Some of the next articles are maybe not open access.
The American Mathematical Monthly, 1989
(1989). Factor Rings of Integers. The American Mathematical Monthly: Vol. 96, No. 6, pp. 521-522.
openaire +2 more sources
(1989). Factor Rings of Integers. The American Mathematical Monthly: Vol. 96, No. 6, pp. 521-522.
openaire +2 more sources
Recommendation for Pair-Wise Key-Establishment Schemes Using Integer Factorization Cryptography
, 2014This Recommendation specifies key-establishment schemes using integer factorization cryptography, based on ANS X9.44, Key-establishment using Integer Factorization Cryptography [ANS X9.44], which was developed by the Accredited Standards Committee (ASC ...
semanticscholar +1 more source
Discrete Logarithm and Integer Factorization using ID-based Encryption
, 2015Shamir proposed the concept of the ID-based Encryption (IBE) in [1]. Instead of generating and publishing a public key for each user, the ID-based scheme permits each user to choose his name or network address as his public key.
C. Meshram
semanticscholar +1 more source
A Note on the Factorization of Integers
Mathematics Magazine, 1960The purpose of this paper is to demonstrate the usefulness of the binary quadratic form, (1) x2 + pqy2 in integers x and y with integral coefficients, in the factorization of odd integers of the form 4k + 1, where k is a positive integer. We begin by introducing the following two lemmas. Lemma 1.
openaire +2 more sources
The Factors of a Square-Free Integer
Canadian Mathematical Bulletin, 1968This note is concerned with the number C(n) of ordered non-trivial factorizations of an integer n in the special case where n is square free. If F (m) denotes C(p1…Pm) where pi. are distinct primes, it is shown thatand that
openaire +3 more sources
Integer factorization using stochastic magnetic tunnel junctions
Nature, 2019W. A. Borders +5 more
semanticscholar +1 more source
An Efficient Provably Secure IBS Technique Using Integer Factorization Problem
, 2020C. Meshram, M. Obaidat
semanticscholar +1 more source
1993
We describe an experimental factoring method for numbers of form x3+k; at present we have used only k=2. The method is the cubic version of the idea given by Coppersmith, Odlyzko and Schroeppel (Algorithmica 1 (1986), 1–15), in their section ‘Gaussian integers’. We look for pairs of small coprime integers a and b such that: i. the integer a+bx is
openaire +2 more sources
We describe an experimental factoring method for numbers of form x3+k; at present we have used only k=2. The method is the cubic version of the idea given by Coppersmith, Odlyzko and Schroeppel (Algorithmica 1 (1986), 1–15), in their section ‘Gaussian integers’. We look for pairs of small coprime integers a and b such that: i. the integer a+bx is
openaire +2 more sources
Shor’s Algorithm for Integer Factorization
SpringerBriefs in Computer Science, 2019F. Marquezino, R. Portugal, C. Lavor
semanticscholar +1 more source