The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for primes with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1960-1975 (15) 1977-1986 (15) 1987-1988 (16) 1989-1991 (21) 1992-1993 (20) 1994-1996 (17) 1997-1998 (36) 1999-2000 (22) 2001 (23) 2002 (23) 2003 (20) 2004 (21) 2005 (20) 2006 (28) 2007 (27) 2008 (36) 2009 (25) 2010-2011 (26) 2012 (15) 2013 (28) 2014 (18) 2015 (24) 2016 (18) 2017 (23) 2018 (22) 2019 (25) 2020 (28) 2021 (17) 2022 (24) 2023 (24) 2024 (3)
Publication types (Num. hits)
article(406) book(2) incollection(2) inproceedings(270)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 213 occurrences of 152 keywords

Results
Found 680 publication records. Showing 680 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
121Preda Mihailescu Fast Generation of Provable Primes Using Search in Arithmetic Progressions. Search on Bibsonomy CRYPTO The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
109Juris Hartmanis, H. Shank On the Recognition of Primes by Automata. Search on Bibsonomy J. ACM The full citation details ... 1968 DBLP  DOI  BibTeX  RDF
92Ueli M. Maurer Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity. Search on Bibsonomy EUROCRYPT The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
92Shafi Goldwasser, Joe Kilian Primality Testing Using Elliptic Curves. Search on Bibsonomy J. ACM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF distribution of primes, prime certification, prime generation, elliptic curves, group theory, primes, Las Vegas algorithms
75Song Y. Yan, Glyn James Testing Mersenne Primes with Elliptic Curves. Search on Bibsonomy CASC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mersenne numbers, Lucas-Lehmer test, elliptic curve test, Mersenne primes
63Ivan Korec Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 States. Search on Bibsonomy MFCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
63Yue-Sun Kuo, W. K. Chou Generating essential primes for a Boolean function with multiple-valued inputs. Search on Bibsonomy DAC The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
63John Gordon Strong Primes are Easy to Find. Search on Bibsonomy EUROCRYPT The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
63Emil Ong, John Kubiatowicz Optimizing Robustness While Generating Shared Secret Safe Primes. Search on Bibsonomy Public Key Cryptography The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Distributed key generation, safe primes, threshold RSA signatures
58Felix Ulmer, Jacques Calmet On Liouvillian Solutions of Homogeneous Linear Differential Equations. Search on Bibsonomy ISSAC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
52Abderrahmane Nitaj Cryptanalysis of RSA Using the Ratio of the Primes. Search on Bibsonomy AFRICACRYPT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Coppersmith’s Method, Cryptanalysis, RSA, Factorization, Continued Fraction
52Milena Slavcheva Semantic Representation of Events: Building a Semantic Primes Component. Search on Bibsonomy TSD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF event types, verbal predicates, metamodel
52Paul C. Leyland, Arjen K. Lenstra, Bruce Dodson, Alec Muffett, Samuel S. Wagstaff Jr. MPQS with Three Large Primes. Search on Bibsonomy ANTS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
46Qi Cheng 0001 Primality Proving via One Round in ECPP and One Iteration in AKS. Search on Bibsonomy J. Cryptol. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
46Yasuyuki Sakai, Kouichi Sakurai Simple Power Analysis on Fast Modular Reduction with NIST Recommended Elliptic Curves. Search on Bibsonomy ICICS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF generalized Mersenne prime, unified code, elliptic curve cryptosystem, Side channel analysis, modular reduction
46Marc Joye, Pascal Paillier, Serge Vaudenay Efficient Generation of Prime Numbers. Search on Bibsonomy CHES The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Prime number generation, crypto-processors, smart-cards, RSA, DSA, key generation, fast implementations
46Adam L. Young, Moti Yung Finding Length-3 Positive Cunningham Chains. Search on Bibsonomy ANTS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Cunningham Chains, Auto-Recoverable and Auto-Certifiable Cryptosystem, ElGamal system, Public-Key Cryptosystems, Primality testing
46Jørgen Brandt, Ivan Damgård, Peter Landrock Speeding up Prime Number Generation. Search on Bibsonomy ASIACRYPT The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
46Sergey Yekhanin Towards 3-query locally decodable codes of subexponential length. Search on Bibsonomy J. ACM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF private information retrieval, Locally decodable codes, Mersenne primes
46Maciej Grzeskowiak Generating a Large Prime Factor of p4±p2+1 in Polynomial Time. Search on Bibsonomy OTM Conferences (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF The Gong-Harn Public Key System, CEILIDH Public Key System, Torus-Based Cryptography, primes of a special form
46Joy Algesheimer, Jan Camenisch, Victor Shoup Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. Search on Bibsonomy CRYPTO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF safe primes, distributed primality test, RSA, threshold cryptography
40Viliam Geffert, Dana Pardubská Factoring and Testing Primes in Small Space. Search on Bibsonomy SOFSEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF sublogarithmic space, computational complexity, factoring, prime numbers
40László Babai, Daniel Stefankovic Simultaneous diophantine approximation with excluded primes. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
40Jan Camenisch, Markus Michels Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes. Search on Bibsonomy EUROCRYPT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
40Dan Boneh, Jeremy Horwitz Generating a Product of Three Primes with an Unknown Factorization. Search on Bibsonomy ANTS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
40Bruce Dodson, Arjen K. Lenstra NFS with Four Large Primes: An Explosive Experiment. Search on Bibsonomy CRYPTO The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
40Kencheng Zeng, Chung-Huang Yang, T. R. N. Rao Large Primes in Stream Cipher Cryptography. Search on Bibsonomy AUSCRYPT The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
40Brian Baldwin, William P. Marnane, Robert Granger Reconfigurable Hardware Implementation of Arithmetic Modulo Minimal Redundancy Cyclotomic Primes for ECC. Search on Bibsonomy ReConFig The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Minimal Redundancy Cyclotomic Primes, Elliptic Curve Cryptography, Modular Multiplication
35Christian Schridde, Bernd Freisleben On the Validity of the phi-Hiding Assumption in Cryptographic Protocols. Search on Bibsonomy ASIACRYPT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF ?-Hiding assumption, Jacobi symbol, Euler’s totient function
35Haotian Zhou, Xiaolan Fu Understanding, Measuring, and Designing User Experience: The Causal Relationship Between the Aesthetic Quality of Products and User Affect. Search on Bibsonomy HCI (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF beauty, affective priming, user experience, aesthetics, affect
35Adam L. Young, Moti Yung A Key Recovery System as Secure as Factoring. Search on Bibsonomy CT-RSA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Rabin, Blum integer, pseudosquare, PKCS #1, standard compatibility, RSA, public key cryptography, zero-knowledge, chosen ciphertext security, key recovery, semantic Security, quadratic residue
35Michael B. Monagan Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF rational reconstruction, euclidean algorithm, modular algorithms
35Ingrid Biehl, Tsuyoshi Takagi A New Distributed Primality Test for Shared RSA Keys Using Quadratic Fields. Search on Bibsonomy ACISP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Distributed RSA, quadratic fields, parallel computation, primality test
35Eric Allender, David A. Mix Barrington, William Hesse Uniform Circuits for Division: Consequences and Problems. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
35Renate Scheidler A Public-Key Cryptosystem Using Purely Cubic Fields. Search on Bibsonomy J. Cryptol. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Purely cubic field, Cubic residuacity character, Euclidean division, Purely cubic field, Cubic residuacity character, Euclidean division, Public-key cryptosystem, Public-key cryptosystem, Key words
35Paul C. van Oorschot, Michael J. Wiener On Diffie-Hellman Key Agreement with Short Exponents. Search on Bibsonomy EUROCRYPT The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
35Gustavus J. Simmons Cryptanalysis and Protocol Failures (abstract). Search on Bibsonomy CCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
35Paul S. Wang Parallel Univariate Polynomial Factorization on Shared-Memory Multiprocessors. Search on Bibsonomy ISSAC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
34Sergey Yekhanin Towards 3-query locally decodable codes of subexponential length. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF private information retrieval, locally decodable codes, Mersenne primes
34Daniel V. Bailey, Christof Paar Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. Search on Bibsonomy CRYPTO The full citation details ... 1998 DBLP  DOI  BibTeX  RDF fast arithmetic, pseudo-Mersenne primes, OEF, binomials, cryptographic implementation, finite fields, elliptic curves, hyperelliptic curves, modular reduction, Optimal Extension Fields
34Hadi Kharaghani, Sho Suda Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes. Search on Bibsonomy Finite Fields Their Appl. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
34Igor E. Shparlinski On products of primes and almost primes in arithmetic progressions. Search on Bibsonomy Period. Math. Hung. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
34Leandro Marín, Antonio J. Jara, Antonio Fernandez Gómez-Skarmeta Shifting Primes: Extension of Pseudo-Mersenne Primes to Optimize ECC for MSP430-Based Future Internet of Things Devices. Search on Bibsonomy ARES The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
34Tanja C. W. Nijboer, Martine J. E. van Zandvoort, Edward H. F. de Haan Seeing red primes tomato: evidence for comparable priming from colour and colour name primes to semantically related word targets. Search on Bibsonomy Cogn. Process. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Karl-Heinz Indlekofer, Antal Járai Largest known twin primes and Sophie Germain primes. Search on Bibsonomy Math. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
34Olivier Coudert, Jean Christophe Madre Implicit and Incremental Computation of Primes and Essential Primes of Boolean Functions. Search on Bibsonomy DAC The full citation details ... 1992 DBLP  BibTeX  RDF
34Paul Bratley Remarks on algorithms 372: Algorithm 401: An algorithm to produce complex primes, csieve: an improved algorithm to produce complex primes. Search on Bibsonomy Commun. ACM The full citation details ... 1970 DBLP  DOI  BibTeX  RDF number theory, prime numbers, complex numbers
29Hung-Min Sun, Mu-En Wu, Ron Steinfeld, Jian Guo 0001, Huaxiong Wang Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits. Search on Bibsonomy CANS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF LSBS-RSA, short exponent attack, lattice reduction technique, the Boneh-Durfee attack, RSA, least significant bits (LSBs)
29Tim Güneysu, Christof Paar Ultra High Performance ECC over NIST Primes on Commercial FPGAs. Search on Bibsonomy CHES The full citation details ... 2008 DBLP  DOI  BibTeX  RDF FPGA, High-Performance, Elliptic Curve Cryptosystems
29Yao-Dong Zhao, Wen-Feng Qi 0001 Small Private-Exponent Attack on RSA with Primes Sharing Bits. Search on Bibsonomy ISC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29Ching-Nung Yang, Kun-Hsuan Yu, Rastislav Lukac User-Friendly Image Sharing in Multimedia Database Using Polynomials with Different Primes. Search on Bibsonomy MMM (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29Ron Steinfeld, Yuliang Zheng 0001 On the Security of RSA with Primes Sharing Least-Significant Bits. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Partial Key Exposure, Boneh-Durfee-Frankel Attack, Coppersmith Algorithm, Server-Aided Signature Generation, Cryptanalysis, RSA Cryptosystem, Communication Security, Least-Significant Bits
29Albert Atserias Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Weak Pigeonhole Principle, Proof Complexity, Bounded Arithmetic
29Peter Landrock Primality Tests and Use of Primes in Public-Key Systems. Search on Bibsonomy Lectures on Data Security The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
29Giovanni Cesari, Roman Maeder Parallel 3-Primes FFT Algorithm. Search on Bibsonomy DISCO The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
29Yvo Desmedt, Peter Landrock, Arjen K. Lenstra, Kevin S. McCurley, Andrew M. Odlyzko, Rainer A. Rueppel, Miles E. Smid The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel). Search on Bibsonomy EUROCRYPT The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
29Jørgen Brandt, Ivan Damgård On Generation of Probable Primes By Incremental Search. Search on Bibsonomy CRYPTO The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
29Ronald L. Rivest Finding Four Million Large Random Primes. Search on Bibsonomy CRYPTO The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
29Bert den Boer Diffie-Hellman is as Strong as Discrete Log for Certain Primes. Search on Bibsonomy CRYPTO The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
23Mark A. Iwen, Craig V. Spencer Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm. Search on Bibsonomy CISS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
23Adam L. Young, Moti Yung A Timing-Resistant Elliptic Curve Backdoor in RSA. Search on Bibsonomy Inscrypt The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Twisted elliptic curves, RSA, subliminal channel, kleptography
23Ryan Williams 0001 Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. Search on Bibsonomy CCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Jonathan Sorenson The Pseudosquares Prime Sieve. Search on Bibsonomy ANTS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
23Satyanarayana V. Lokam Quadratic Lower Bounds on Matrix Rigidity. Search on Bibsonomy TAMC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
23Maciej Grzeskowiak New Key Generation Algorithms for the XTR Cryptosytem. Search on Bibsonomy OTM Workshops (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
23Luis Paricio Homotopy Categories for Simply Connected Torsion Spaces. Search on Bibsonomy Appl. Categorical Struct. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2001) 55U35, 55U40, 55N25, 55Q70
23Udayan Khurana, Anirudh Koul Using Patterns to Generate Prime Numbers. Search on Bibsonomy ICAPR (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Daniele Micciancio The RSA Group is Pseudo-Free. Search on Bibsonomy EUROCRYPT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
23Michael J. Jacobson Jr., Hugh C. Williams, Kjell Wooding Imaginary Cyclic Quartic Fields with Large Minus Class Numbers. Search on Bibsonomy ANTS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
23Andrew J. Holt, James H. Davenport Resolving Large Prime(s) Variants for Discrete Logarithm Computation. Search on Bibsonomy IMACC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
23Qi Cheng 0001 Primality Proving via One Round in ECPP and One Iteration in AKS. Search on Bibsonomy CRYPTO The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
23M. Jason Hinek, Mo King Low, Edlyn Teske On Some Attacks on Multi-prime RSA. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
23Carl Pomerance, Igor E. Shparlinski Smooth Orders and Cryptographic Applications. Search on Bibsonomy ANTS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
23Kamila Bendová On ordering and multiplication of natural numbers. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
23S. Ali Miri, V. Kumar Murty An Application of Sieve Methods to Elliptic Curves. Search on Bibsonomy INDOCRYPT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
23Erkay Savas, Thomas A. Schmidt, Çetin Kaya Koç Generating Elliptic Curves of Prime Order. Search on Bibsonomy CHES The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
23Clifton Davis, Christoph F. Eick A heuristic search based factoring tool. Search on Bibsonomy ICTAI The full citation details ... 2000 DBLP  DOI  BibTeX  RDF heuristic search based factoring tool, RSA cryptography, state-based search, heuristic formula, pseudo-smooth integers, security, cryptography, heuristic programming, depth first search, tree searching
23Joshua Holden Irregularity of Prime Numbers over Real Quadratic Fields. Search on Bibsonomy ANTS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
23Michael J. Jacobson Jr. Experimental Results on Class Groups of Real Quadratic Fields. Search on Bibsonomy ANTS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
23Hans-Gert Gräbe Minimal Primary Decomposition and Factorized Gröbner Bases. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Primary decomposition, Constructive methods
23Patrick C. McGeer, Jagesh V. Sanghavi, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli ESPRESSO-SIGNATURE: a new exact minimizer for logic functions. Search on Bibsonomy IEEE Trans. Very Large Scale Integr. Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
23Daniel M. Gordon Designing and Detecting Trapdoors for Discrete Log Cryptosystems. Search on Bibsonomy CRYPTO The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
23Claus-Peter Schnorr Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations. Search on Bibsonomy EUROCRYPT The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
23Wieb Bosma, Marc-Paul van der Hulst Faster Primality Testing (Extended Abstract). Search on Bibsonomy EUROCRYPT The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
23Michael W. Mislove On the Smyth Power Domain. Search on Bibsonomy MFPS The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
23Alfredo De Santis, Silvio Micali, Giuseppe Persiano Non-Interactive Zero-Knowledge Proof Systems. Search on Bibsonomy CRYPTO The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
23Hugh C. Williams Some Public Key Crypto-Functions as Intractable as Factorization. Search on Bibsonomy CRYPTO The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
23Aleksey Koval, Boris S. Verkhovsky Analysis of RSA over Gaussian Integers Algorithm. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Gaussian Integers, Gaussian primes, Cryptography, RSA
23Aleksey Koval, Boris S. Verkhovsky Cryptosystem Based on Extraction of Square Roots of Complex Integers. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Gaussian integers, Rabin algorithm, extraction of square roots, complex integers, Gaussian primes, Cryptography, RSA
23Maciej Grzeskowiak On Generating Elements of Orders Dividing p2k±pk+1. Search on Bibsonomy IWSEC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF The Gong-Harn Public Key System, The XTR Public Key System, primes of a special form, solving polynomial equations modulo p
23Kiran S. Kedlaya, Sergey Yekhanin Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers. Search on Bibsonomy CCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Locally decodable codes, Mersenne primes
23Andrea Vietri Combinatorial Aspects of Total Weight Orders over Monomials of Fixed Degree. Search on Bibsonomy Order The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Gröbner bases, monomial ordering, weight order, coloring, linearization, primes, linear inequalities, logical consequence
23Michael R. Darnel, Jorge Martinez 0001 Radical Classes of Lattice-Ordered Groups vs. Classes of Compact Spaces. Search on Bibsonomy Order The full citation details ... 2002 DBLP  DOI  BibTeX  RDF F-spaces, disconnected spaces, completeness of a class, laterally separated, radical class of -groups, spectral space, stranded primes, Yosida space
23Makoto Matsumoto, Takuji Nishimura Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator. Search on Bibsonomy ACM Trans. Model. Comput. Simul. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF GFSR, MT19937, TGFSR, incomplete array, inversive-decimation method, multiple-recursive matrix method, tempering, finite fields, random number generation, primitive polynomials, m-sequences, Mersenne primes, k-distribution, Mersenne twister
17Hector Pasten A Derivation of the Infinitude of Primes. Search on Bibsonomy Am. Math. Mon. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
17Santosh Kumar Ravva, K. L. N. C. Prakash, Sureddi R. M. Krishna Cryptanalysis of RSA with composed decryption exponent with few most significant bits of one of the primes. Search on Bibsonomy J. Comput. Virol. Hacking Tech. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
17Victor Youdom Kemmoe, Anna Lysyanskaya RSA-Based Dynamic Accumulator without Hashing into Primes. Search on Bibsonomy IACR Cryptol. ePrint Arch. The full citation details ... 2024 DBLP  BibTeX  RDF
17Santosh Kumar Ravva, Sureddi R. M. Krishna Cryptanalysis of RSA with small difference of primes and two decryption exponents: Jochemsz and May approach. Search on Bibsonomy Cryptologia The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
17Renrong Mao Congruences for Andrews-Beck partition statistics modulo powers of primes. Search on Bibsonomy Adv. Appl. Math. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
17Menachem Shlossberg Minimality Conditions Equivalent to the Finitude of Fermat and Mersenne Primes. Search on Bibsonomy Axioms The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 680 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license