A binary algorithm for the Jacobi symbol
ACM SIGSAM Bulletin
Efficient parallel solution of sparse systems of linear diophantine equations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
CALYPSO: a computer algebra library for parallel symbolic computation
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Diophantine linear system solving
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
New algorithms for generating Conway polynomials over finite fields
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for computing the ith letter of 4na
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Signature schemes based on the strong RSA assumption
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
A factoring algorithm in F2[x]
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Discrete Logarithms: The Past and the Future
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
Short vectors of planar lattices via continued fractions
Information Processing Letters
Generating random factored numbers, easily
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the Linear Complexity of the Power Generator
Designs, Codes and Cryptography
Approximate congruence in nearly linear time
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Quantum algorithms for some hidden shift problems
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Faster Fourier Transforms via Automatic Program Specialization
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Note on Fast Computation of Secret RSA Exponents
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Efficient Verification Algorithms for One-Counter Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Message Authentication Codes with Error Correcting Capabilities
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Optimal Extension Fields for XTR
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Forward-Secure Signatures with Optimal Signing and Verifying
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Password-Authenticated Key Exchange Based on RSA
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Modular Inversion Hidden Number Problem
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
State Complexity and Jacobsthal's Function
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Private Selective Payment Protocols
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
On Simulation-Checking with Sequential Systems
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
How to Fool an Unbounded Adversary with a Short Key
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Maximal Periods of x + c in Fq
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Some new results concerning the Smarandache Ceil function
Smarandache notions
Java concurrent program for the Samarandache function
Smarandache notions
Primality test for numbers M with a large power of 5 dividing M4- 1
Theoretical Computer Science - Latin American theoretical informatics
Some new results concerning the Smarandache Ceil function
Smarandache Notions Journal
Java concurent program for the Samarandache function
Smarandache Notions Journal
On the primality of n! ± 1 and 2×3×5×...× p±1
Mathematics of Computation
Taking pth Roots Modulo Polynomials over Finite Fields
Designs, Codes and Cryptography
State complexity of proportional removals
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Shiftless decomposition and polynomial-time rational summation
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Computer algebra handbook
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
On the Computation of Square Roots in Finite Fields
Designs, Codes and Cryptography
On the hardness of approximating the permanent of structured matrices
Computational Complexity
Smarandache Notions Journal
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Complexity of some arithmetic problems for binary polynomials
Computational Complexity
The query complexity of order-finding
Information and Computation
Journal of the ACM (JACM)
A note on quadratic residuosity and UP
Information Processing Letters
Cryptographic key assignment schemes for any access control policy
Information Processing Letters
Encyclopedia of Computer Science
On authenticated computing and RSA-based authentication
Proceedings of the 12th ACM conference on Computer and communications security
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Discrete Applied Mathematics - Special issue: Coding and cryptography
On the Optimality of the Binary Algorithm for the Jacobi Symbol
Fundamenta Informaticae
Holographic algorithms: from art to science
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Net-χ: unified data-centric internet services
NETB'07 Proceedings of the 3rd USENIX international workshop on Networking meets databases
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
Revisiting the Karnin, Greene and Hellman Bounds
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
On Faster Integer Calculations Using Non-arithmetic Primitives
UC '08 Proceedings of the 7th international conference on Unconventional Computing
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Safer parameters for the Chor-Rivest cryptosystem
Computers & Mathematics with Applications
On Generating Elements of Orders Dividing p2k±pk + 1
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
Computing pairings using x-coordinates only
Designs, Codes and Cryptography
Polynomial-time theory of matrix groups
Proceedings of the forty-first annual ACM symposium on Theory of computing
Theoretical Computer Science
Faster real feasibility via circuit discriminants
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Amount of Nonconstructivity in Finite Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Generalized Halton sequences in 2008: A comparative study
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On Models of a Nondeterministic Computation
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A note on efficient implementation of prime generation algorithms in small portable devices
Computer Networks: The International Journal of Computer and Telecommunications Networking
A note on leakage-resilient authenticated key exchange
IEEE Transactions on Wireless Communications
Anonymous Transactions in Computer Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Discrete Applied Mathematics - Special issue: Coding and cryptography
A note on quadratic residuosity and UP
Information Processing Letters
Cryptographic key assignment schemes for any access control policy
Information Processing Letters
Controlling data disclosure in computational PIR protocols
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Comparing the MOV and FR reductions in elliptic curve cryptography
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A compact and fast division architecture for a finite field GF(2m)
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Interpolation of the elliptic curve Diffie-Hellman mapping
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Black-box extension fields and the inexistence of field-homomorphic one-way permutations
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Randomized NP-completeness for p-adic rational roots of sparse polynomials in one variable
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Amount of nonconstructivity in deterministic finite automata
Theoretical Computer Science
Algorithms and complexity for periodic real-time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Toward basing fully homomorphic encryption on worst-case hardness
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Finite state transducers with intuition
UC'10 Proceedings of the 9th international conference on Unconventional computation
Unambiguous finite automata over a unary alphabet
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Holographic algorithms: From art to science
Journal of Computer and System Sciences
Shor's discrete logarithm quantum algorithm for elliptic curves
Quantum Information & Computation
Faster polynomial multiplication via discrete fourier transforms
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Filtering for private collaborative benchmarking
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Construction of rational points on elliptic curves over finite fields
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Efficient, robust and constant-round distributed RSA key generation
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
The complexity of counting eulerian tours in 4-regular graphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Cramer-Damgård signatures revisited: efficient flat-tree signatures based on factoring
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Deterministic polynomial-time algorithms for designing short DNA words
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Improved combinatorial group testing for real-world problem sizes
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Fast equality test for straight-line compressed strings
Information Processing Letters
Unambiguous finite automata over a unary alphabet
Information and Computation
Smooth projective hashing and two-message oblivious transfer
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Differential cryptanalysis for multivariate schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
State complexity and the monoid of transformations of a finite set
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Identical relations in symmetric groups and separating words with reversible automata
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Anonymous transactions in computer networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Halving for the 2-Sylow subgroup of genus 2 curves over binary fields
Finite Fields and Their Applications
State complexity of projection and quotient on unranked trees
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
On the Optimality of the Binary Algorithm for the Jacobi Symbol
Fundamenta Informaticae
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms (TALG)
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Approximately counting semismooth integers
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Computing the invariant structure of integer matrices: fast algorithms into practice
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Binary trees as a computational framework
Computer Languages, Systems and Structures
Property testing for cyclic groups and beyond
Journal of Combinatorial Optimization
A Complete Generalization of Atkin's Square Root Algorithm
Fundamenta Informaticae
Algorithms for Relatively Cyclotomic Primes
Fundamenta Informaticae
Hi-index | 0.00 |