Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
A Prototype Encryption System Using Public Key Read chapter Read first chapter

1985 | OriginalPaper | Chapter

Efficient Signature Schemes Based on Polynomial Equations (preliminary version)

Authors : H. Ong, C. P. Schnorr, A. Shamir

Published in: Advances in Cryptology

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

previous chapter A Public-Key Cryptosystem Based on the Word Problem
next chapter Identity-Based Cryptosystems and Signature Schemes
Metadata
Title
Efficient Signature Schemes Based on Polynomial Equations (preliminary version)
Authors
H. Ong
C. P. Schnorr
A. Shamir
Copyright Year
1985
Publisher
Springer Berlin Heidelberg
Book
Advances in Cryptology

Print ISBN: 978-3-540-15658-1

Electronic ISBN: 978-3-540-39568-3

Copyright Year: 1985

DOI
https://doi.org/10.1007/3-540-39568-7_4