An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates (2001)

by Ivan Bjerre Damgård , Gudmund Skovbjerg Frandsen
Citations:4 - 0 self

Active Bibliography

A Simpli ed Quadratic Frobenius Primality Test – Martin Seysen, Devrient Gmbh - 2005
9 Jeeg: Temporal Constraints for the Synchronization of Concurrent Objects – Giuseppe Milicia, Vladimiro Sassone - 2003
15 The metafront System: Extensible Parsing and Transformation – Claus Brabrand, Michael I. Schwartzbach, Mads Vanggaard - 2003
6 Efficient Algorithms for GCD and Cubic Residuosity – Ivan B. Damgård, Gudmund Skovbjerg Frandsen - 2003
Close to Uniform Prime Number Generation With Fewer Random Bits – Pierre-alain Fouque, Mehdi Tibouchi
12 Efficient Generation of Prime Numbers – Marc Joye, Pascal Paillier, Serge Vaudenay - 2000
3 Fast Generation of Prime Numbers of Portable Devices: An Update – Marc Joye, Pascal Paillier - 2006
1.1.1 Philosophy Advantages over Other Systems....... 19 – unknown authors
Barcelona Aarhus Barcelona – unknown authors - 2002
19 Profile-Guided Static Typing for Dynamic Scripting Languages – Michael Furr, et al. - 2009
1 Efficient Algorithms for Computing the Jacobi Symbol (Extended Abstract) – Shawna M. Meyer, Jonathan P. Sorenson - 1998
2 Survey of Computational Assumptions Used in Cryptography Broken or Not by Shor's Algorithm – Hong Zhu - 2001
AN EFFICIENT SEVENTH POWER RESIDUE SYMBOL ALGORITHM – Perlas C. Caranay, Renate Scheidler
Conditional Concurrency Combinators – Paweł T. Wojciechowski
3 Role-based declarative synchronization for reconfigurable systems – Vlad Tanasescu, Pawe̷l T. Wojciechowski - 2005
4 Concurrency combinators for declarative synchronization – Pawe̷l T. Wojciechowski - 2004
UNIVERSITY OF CALGARY On Residue Symbols and Kummer’s Reciprocity Law of Degree Seven – Perlas C. Caranay - 2009
Contents – P. Eugster, K. R. Jayaram
Efficient Cryptosystems From 2 k-th Power Residue Symbols ⋆ – Marc Joye, Benoît Libert