Signature Schemes Based on 3rd Order Shift Registers
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Generating Large Instances of the Gong-Harn Cryptosystem
Proceedings of the 8th IMA International Conference on Cryptography and Coding
A Practical Public Key Cryptosystemfrom Paillier and Rabin Schemes
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
The GH Public-Key Cryptosystem
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Identification, Signature and Signcryption Using High Order Residues Modulo an RSA Composite
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Cryptanalysis of short secret exponents modulo RSA primes
Information Sciences—Informatics and Computer Science: An International Journal
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Applications to cryptography of twisting commutative algebraic groups
Discrete Applied Mathematics
Generating a Large Prime Factor of p4 ± p2 + 1 in Polynomial Time
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
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
A More Compact Representation of XTR Cryptosystem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the Computational Efficiency of XTR+
Information Security and Cryptology
On the Complexity of Computing Discrete Logarithms over Algebraic Tori
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Double-Exponentiation in Factor-4 Groups and Its Applications
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
A CCA2 secure key encapsulation scheme based on 3rd order shift registers
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Efficient linkable ring signatures and threshold signatures from linear feedback shift register
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Linkable ring signatures from linear feedback shift register
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Authenticating DSR using a novel multisignature scheme based on cubic LFSR sequences
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
Fast irreducibility testing for XTR using a gaussian normal basis of low complexity
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Group key agreement protocol based on GH-KEP
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Generating elements of orders dividing p6 ± p5 + p4 ± p3 + p2 + p ± 1
Annales UMCS, Informatica - Cryptography and data protection
New key generation algorithms for the XTR cryptosytem
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I
New LFSR-based cryptosystems and the trace discrete log problem (Trace-DLP)
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Server-aided RSA key generation against collusion attack
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
A new algorithm to compute remote terms in special types of characteristic sequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Verifiable multi-secret sharing based on LFSR sequences
Theoretical Computer Science
Algorithm for Generating Primes p and q Such that q Divides p4 ± p3 + p2 ± p + 1
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
Factor-4 and 6 (de)compression for values of pairings using trace maps
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Message transmission for GH-public key cryptosystem
Journal of Computational and Applied Mathematics
An overview of trace based public key cryptography over finite fields
Journal of Computational and Applied Mathematics
Algorithms for Relatively Cyclotomic Primes
Fundamenta Informaticae
| Hi-index | 754.84 |
The cryptographic properties of third-order linear feedback shift-register (LFSR) sequences over GF(p) are investigated. A fast computational algorithm for evaluating the kth term of a characteristic sequence of order 3 is presented. Based on these properties, a new public-key distribution scheme and an RSA-type encryption algorithm are proposed. Their security, implementation, information rate, and computational cost for the new schemes are discussed