Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Barry Fagin"'
Autor:
Barry Fagin
Publikováno v:
Information, Vol 12, Iss 8, p 305 (2021)
Previous work established the set of square-free integers n with at least one factorization n=p¯q¯ for which p¯ and q¯ are valid RSA keys, whether they are prime or composite. These integers are exactly those with the property λ(n)∣(p¯−1)(q
Externí odkaz:
https://doaj.org/article/9fbbb87b59d4478a8e8665e15cef3902
Autor:
Barry Fagin
Publikováno v:
Information, Vol 10, Iss 7, p 232 (2019)
We explore the class of positive integers n that admit idempotent factorizations n = p ¯ q ¯ such that λ ( n ) ∣ ( p ¯ − 1 ) ( q ¯ − 1 ) , where λ is the Carmichael lambda function. Idempotent factorizations with p ¯ and q ¯ prime have
Externí odkaz:
https://doaj.org/article/7ab4f52f44a249f9999ada70b93c472d
Autor:
Barry Fagin
Publikováno v:
Information, Vol 9, Iss 9, p 216 (2018)
RSA key pairs are normally generated from two large primes p and q. We consider what happens if they are generated from two integers s and r, where r is prime, but unbeknownst to the user, s is not. Under most circumstances, the correctness of encryp
Externí odkaz:
https://doaj.org/article/9b7159094ab648568c33acb78e36cfbd
Autor:
Barry Fagin
Publikováno v:
The College Mathematics Journal. 51:195-203
The RSA cryptosystem [14] requires two primes (p, q). Its security is based on the time required to factor n = pq without knowing p or q, since no polynomial-time factoring algorithms are known. Cu...
Autor:
Barry Fagin
Publikováno v:
ITiCSE
While it is commonly believed RSA requires two primes p and q, that is incorrect. Infinite examples of RSA encryption moduli n=pq exist with p and/or q composite that generate correct RSA keys. This can be explained in the undergraduate cryptography
Autor:
Paul Graham, Traci A. Sarmiento, Joel Coffman, Steve Hadfield, Troy Weingart, David Caswell, Barry Fagin
Publikováno v:
WCCCE
Recent updates to the ABET accreditation body's Criteria for Accrediting Computing Programs provide opportunities for program design and assessment efficiency and effectiveness improvements. An exploration of these opportunities resulted in a re-exam
Autor:
Barry Fagin
Publikováno v:
Proceedings of the 50th ACM Technical Symposium on Computer Science Education.
Autor:
Barry Fagin
Publikováno v:
SIGCSE
Once you introduce RSA and probabilistic primality testing to your cryptography class, one of your brighter students will ask "What happens if the test is wrong?" It turns out the answer can vary from "You'll find out immediately" to "It makes no dif
Publikováno v:
COMPSAC (2)
IRONSIDES is an open-source Domain Name System (DNS) server designed using formal methods to reduce DNS vulnerabilities to cyber attacks. The use of formal methods gives IRONSIDES provable security properties, including the absence of numerous securi
Publikováno v:
Knowledge, Technology & Policy. 20:231-242
Cryptography is an essential component of America’s national security infrastructure. Billions of dollars are spent on cryptosystems every year, in both the public and private sector. Unfortunately, the field is rife with dubious claims, snake oil