A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
An efficient signature scheme based on quadratic equations
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Zero-knowledge proofs of identity and veracity of transaction receipts
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Can O.S.S. be repaired?: proposal for a new practical signature scheme
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi
CRYPTO '85 Advances in Cryptology
A Secure Subliminal Channel (?)
CRYPTO '85 Advances in Cryptology
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
CRYPTO '85 Advances in Cryptology
Provably Unforgeable Signatures
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Pricing via Processing or Combatting Junk Mail
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of Patarin's 2-round public key system with S boxes (2R)
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Analysis of multivariate hash functions
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Practical key-recovery for all possible parameters of SFLASH
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
Signatures based on polynomial equations modulo n have been introduced by Ong, Schnorr, Shamir [3]. We extend the original binary quadratic OSS-scheme to algebraic integers. So far the generalised scheme is not vulnerable by the recent algorithm of Pollard for solving s12 + k s22 = m (mod n) which has broken the original scheme.