A New Public-Key Cipher System Based Upon the Diophantine Equations
IEEE Transactions on Computers
Cryptanalysis of Xia-You group signature scheme
Journal of Systems and Software - Special issue: Software engineering education and training
A communication-efficient and fault-tolerant conference-key agreement protocol with forward secrecy
Journal of Systems and Software
General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting
Electronic Notes in Theoretical Computer Science (ENTCS)
Privacy-preserving distributed association rule mining via semi-trusted mixer
Data & Knowledge Engineering
New cryptosystems design based on hybrid-mode problems
Computers and Electrical Engineering
Analysis and design of a secure key exchange scheme
Information Sciences: an International Journal
Analysis of the efficiency of the Chor-Rivest cryptosystem implementation in a safe-parameter range
Information Sciences: an International Journal
Secure construction of k-unlinkable patient records from distributed providers
Artificial Intelligence in Medicine
A practical anonymous off-line multi-authority payment scheme
Electronic Commerce Research and Applications
Ramanujan's class invariants and their use in elliptic curve cryptography
Computers & Mathematics with Applications
Discrete logarithm based additively homomorphic encryption and secure data aggregation
Information Sciences: an International Journal
Journal of Computer and System Sciences
Computing elliptic curve discrete logarithms with the negation map
Information Sciences: an International Journal
Research notes: Method for constructing a group-oriented cipher system
Computer Communications
A traceable group signature scheme
Mathematical and Computer Modelling: An International Journal
Practical secure electronic mail system with public key distribution
Computer Communications
Anonymous channel and authentication in wireless communications
Computer Communications
Partially blind threshold signatures based on discrete logarithm
Computer Communications
Research note: Cheater identification in (t,n) threshold scheme
Computer Communications
A secure and practical electronic voting scheme
Computer Communications
Binary Representations of Finite Fields and Their Application to Complexity Theory
Finite Fields and Their Applications
Algebraic curves and cryptography
Finite Fields and Their Applications
Improved Pollard rho method for computing discrete logarithms over finite extension fields
Journal of Computational and Applied Mathematics
Privacy-preserving subgraph discovery
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
Wireless Personal Communications: An International Journal
Remarks on Cheon's algorithms for pairing-related problems
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
Extracting sparse factors from multivariate integral polynomials
Journal of Symbolic Computation
Lightweight privacy-preserving peer-to-peer data integration
Proceedings of the VLDB Endowment
Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
Designs, Codes and Cryptography
Private data warehouse queries
Proceedings of the 18th ACM symposium on Access control models and technologies
DEMO: Adjustably encrypted in-memory column-store
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Cross-domain privacy-preserving cooperative firewall optimization
IEEE/ACM Transactions on Networking (TON)
Optimal re-encryption strategy for joins in encrypted databases
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
Secure Handover Authentication Protocol Based on Bilinear Pairings
Wireless Personal Communications: An International Journal
A Complete Generalization of Atkin's Square Root Algorithm
Fundamenta Informaticae
| Hi-index | 754.84 |
A cryptographic system is described which is secure if and only if computing logarithms overGF(p)is infeasible. Previously published algorithms for computing this function requireO(p^{1/2})complexity in both time and space. An improved algorithm is derived which requiresO =(log^{2} p)complexity ifp - 1has only small prime factors. Such values ofpmust be avoided in the cryptosystem. Constructive uses for the new algorithm are also described.