Network Time Protocol

The Network Time Protocol (NTP) is a networking protocol for clock synchronization between computer systems over packet-switched, variable-latency data networks. In operation since before 1985, NTP is one of the oldest Internet protocols in current use. NTP was designed by David L. Mills of the University of Delaware.

Network Time Protocol
International standardRFC 5905
Developed byDavid L. Mills, Network Time Foundation
Introduced1985 (1985)
Internet protocol suite
Application layer
Transport layer
Internet layer
Link layer

NTP is intended to synchronize all participating computers to within a few milliseconds of Coordinated Universal Time (UTC).[1]: 3  It uses the intersection algorithm, a modified version of Marzullo's algorithm, to select accurate time servers and is designed to mitigate the effects of variable network latency. NTP can usually maintain time to within tens of milliseconds over the public Internet, and can achieve better than one millisecond accuracy in local area networks under ideal conditions. Asymmetric routes and network congestion can cause errors of 100 ms or more.[2][3]

The protocol is usually described in terms of a client–server model, but can as easily be used in peer-to-peer relationships where both peers consider the other to be a potential time source.[1]: 20  Implementations send and receive timestamps using the User Datagram Protocol (UDP) on port number 123.[4][5]: 16  They can also use broadcasting or multicasting, where clients passively listen to time updates after an initial round-trip calibrating exchange.[3] NTP supplies a warning of any impending leap second adjustment, but no information about local time zones or daylight saving time is transmitted.[2][3]

The current protocol is version 4 (NTPv4),[5] which is backward compatible with version 3.[6]

Network Time Security (NTS) is a secure version of NTP[7] with TLS and AEAD.

History
NTP was designed by David L. Mills.

In 1979, network time synchronization technology was used in what was possibly the first public demonstration of Internet services running over a trans-Atlantic satellite network, at the National Computer Conference in New York. The technology was later described in the 1981 Internet Engineering Note (IEN) 173[17] and a public protocol was developed from it that was documented in RFC 778. The technology was first deployed in a local area network as part of the Hello routing protocol and implemented in the Fuzzball router, an experimental operating system used in network prototyping, where it ran for many years.

Other related network tools were available both then and now. They include the Daytime and Time protocols for recording the time of events, as well as the ICMP Timestamp messages and IP Timestamp option (RFC 781). More complete synchronization systems, although lacking NTP's data analysis and clock disciplining algorithms, include the Unix daemon timed, which uses an election algorithm to appoint a server for all the clients;[18] and the Digital Time Synchronization Service (DTSS), which uses a hierarchy of servers similar to the NTP stratum model.

In 1985, NTP version 0 (NTPv0) was implemented in both Fuzzball and Unix, and the NTP packet header and round-trip delay and offset calculations, which have persisted into NTPv4, were documented in RFC 958. Despite the relatively slow computers and networks available at the time, accuracy of better than 100 milliseconds was usually obtained on Atlantic spanning links, with accuracy of tens of milliseconds on Ethernet networks.

In 1988, a much more complete specification of the NTPv1 protocol, with associated algorithms, was published in RFC 1059. It drew on the experimental results and clock filter algorithm documented in RFC 956 and was the first version to describe the client–server and peer-to-peer modes. In 1991, the NTPv1 architecture, protocol and algorithms were brought to the attention of a wider engineering community with the publication of an article by David L. Mills in the IEEE Transactions on Communications.[19]

In 1989, RFC 1119 was published defining NTPv2 by means of a state machine, with pseudocode to describe its operation. It introduced a management protocol and cryptographic authentication scheme which have both survived into NTPv4, along with the bulk of the algorithm. However the design of NTPv2 was criticized for lacking formal correctness by the DTSS community, and the clock selection procedure was modified to incorporate Marzullo's algorithm for NTPv3 onwards.[20]

In 1992, RFC 1305 defined NTPv3. The RFC included an analysis of all sources of error, from the reference clock down to the final client, which enabled the calculation of a metric that helps choose the best server where several candidates appear to disagree. Broadcast mode was introduced.

In subsequent years, as new features were added and algorithm improvements were made, it became apparent that a new protocol version was required.[21] In 2010, RFC 5905 was published containing a proposed specification for NTPv4. The protocol has significantly progressed since then, and As of 2014, an updated RFC has yet to be published.[22] Following the retirement of Mills from the University of Delaware, the reference implementation is currently maintained as an open source project led by Harlan Stenn.[23][24]

Clock strata
The U.S. Naval Observatory Alternate Master Clock at Schriever AFB (Colorado) is a stratum 0 source for NTP
Yellow arrows indicate a direct connection; red arrows indicate a network connection.

NTP uses a hierarchical, semi-layered system of time sources. Each level of this hierarchy is termed a stratum and is assigned a number starting with zero for the reference clock at the top. A server synchronized to a stratum n server runs at stratum n + 1. The number represents the distance from the reference clock and is used to prevent cyclical dependencies in the hierarchy. Stratum is not always an indication of quality or reliability; it is common to find stratum 3 time sources that are higher quality than other stratum 2 time sources.[lower-alpha 1] A brief description of strata 0, 1, 2 and 3 is provided below.

Stratum 0
These are high-precision timekeeping devices such as atomic clocks, GNSS (including GPS) or other radio clocks. They generate a very accurate pulse per second signal that triggers an interrupt and timestamp on a connected computer. Stratum 0 devices are also known as reference clocks. NTP servers cannot advertise themselves as stratum 0. A stratum field set to 0 in NTP packet indicates an unspecified stratum.[25]
Stratum 1
These are computers whose system time is synchronized to within a few microseconds of their attached stratum 0 devices. Stratum 1 servers may peer with other stratum 1 servers for sanity check and backup.[26] They are also referred to as primary time servers.[2][3]
Stratum 2
These are computers that are synchronized over a network to stratum 1 servers. Often a stratum 2 computer queries several stratum 1 servers. Stratum 2 computers may also peer with other stratum 2 computers to provide more stable and robust time for all devices in the peer group.
Stratum 3
These are computers that are synchronized to stratum 2 servers. They employ the same algorithms for peering and data sampling as stratum 2, and can themselves act as servers for stratum 4 computers, and so on.

The upper limit for stratum is 15; stratum 16 is used to indicate that a device is unsynchronized. The NTP algorithms on each computer interact to construct a Bellman-Ford shortest-path spanning tree, to minimize the accumulated round-trip delay to the stratum 1 servers for all the clients.[1]: 20 

In addition to stratum, the protocol is able to identify the synchronization source for each server in terms of a reference identifier (refid).

Common time reference identifiers (refid) codes
Refid[27]Clock Source
GOESGeosynchronous Orbit Environment Satellite
GPSGlobal Positioning System
GALGalileo Positioning System
PPSGeneric pulse-per-second
IRIGInter-Range Instrumentation Group
WWVBLF Radio WWVB Fort Collins, Colorado 60 kHz
DCFLF Radio DCF77 Mainflingen, DE 77.5 kHz
HBGLF Radio HBG Prangins, HB 75 kHz (ceased operation)
MSFLF Radio MSF Anthorn, UK 60 kHz
JJYLF Radio JJY Fukushima, JP 40 kHz, Saga, JP 60 kHz
LORCMF Radio Loran-C station, 100 kHz
TDFMF Radio Allouis, FR 162 kHz
CHUHF Radio CHU Ottawa, Ontario
WWVHF Radio WWV Fort Collins, Colorado
WWVHHF Radio WWVH Kauai, Hawaii
NISTNIST telephone modem
ACTSNIST telephone modem
USNOUSNO telephone modem
PTBGerman PTB time standard telephone modem
MRSMulti Reference Sources
XFACInter Face Association Changed (IP address changed or lost)
STEPStep time change, the offset is less than the panic threshold (1000 s) but greater than the step threshold (125 ms)
GOOGUnofficial Google Refid used by google NTP servers as time4.google.com

Timestamps

The 64-bit binary fixed-point timestamps used by NTP consist of a 32-bit part for seconds and a 32-bit part for fractional second, giving a time scale that rolls over every 232 seconds (136 years) and a theoretical resolution of 2−32 seconds (233 picoseconds). NTP uses an epoch of January 1, 1900. Therefore, the first rollover occurs on February 7, 2036.[28][29]

NTPv4 introduces a 128-bit date format: 64 bits for the second and 64 bits for the fractional-second. The most-significant 32-bits of this format is the Era Number which resolves rollover ambiguity in most cases.[30][31] According to Mills, "The 64-bit value for the fraction is enough to resolve the amount of time it takes a photon to pass an electron at the speed of light. The 64-bit second value is enough to provide unambiguous time representation until the universe goes dim."[32][lower-alpha 2]

Clock synchronization algorithm
Round-trip delay time δ

A typical NTP client regularly polls one or more NTP servers. The client must compute its time offset and round-trip delay. Time offset θ is positive or negative (client time > server time) difference in absolute time between the two clocks. It is defined by

and the round-trip delay δ by

where

  • t0 is the client's timestamp of the request packet transmission,
  • t1 is the server's timestamp of the request packet reception,
  • t2 is the server's timestamp of the response packet transmission and
  • t3 is the client's timestamp of the response packet reception.[1]: 19 

To derive the expression for the offset, note that for the request packet,

and for the response packet,

Solving for θ yields the definition of the time offset.

The values for θ and δ are passed through filters and subjected to statistical analysis. Outliers are discarded and an estimate of time offset is derived from the best three remaining candidates. The clock frequency is then adjusted to reduce the offset gradually, creating a feedback loop.[1]: 20 

Accurate synchronization is achieved when both the incoming and outgoing routes between the client and the server have symmetrical nominal delay. If the routes do not have a common nominal delay, a systematic bias exists of half the difference between the forward and backward travel times.[33]

Software implementations
The NTP management protocol utility ntpq being used to query the state of a stratum 2 server.

Reference implementation

The NTP reference implementation, along with the protocol, has been continuously developed for over 20 years. Backwards compatibility has been maintained as new features have been added. It contains several sensitive algorithms, especially to discipline the clock, that can misbehave when synchronized to servers that use different algorithms. The software has been ported to almost every computing platform, including personal computers. It runs as a daemon called ntpd under Unix or as a service under Windows. Reference clocks are supported and their offsets are filtered and analysed in the same way as remote servers, although they are usually polled more frequently.[1]: 15–19  This implementation was audited in 2017, finding numerous potential security issues.[34]

SNTP

Simple Network Time Protocol (SNTP) is a less complex implementation of NTP, using the same protocol but without requiring the storage of state over extended periods of time.[35] It is used in some embedded systems and in applications where full NTP capability is not required.[36]

Windows Time

All Microsoft Windows versions since Windows 2000 include the Windows Time service (W32Time),[37] which has the ability to synchronize the computer clock to an NTP server.

W32Time was originally implemented for the purpose of the Kerberos version 5 authentication protocol, which required time to be within 5 minutes of the correct value to prevent replay attacks. The version in Windows 2000 and Windows XP only implements SNTP, and violates several aspects of the NTP version 3 standard.[38]

Beginning with Windows Server 2003 and Windows Vista, W32Time became compatible with a significant subset of NTPv3.[39] Microsoft states that W32Time cannot reliably maintain time synchronization with one second accuracy.[40] If higher accuracy is desired, Microsoft recommends using a newer version of Windows or different NTP implementation.[41]

Beginning with Windows 10 version 1607 and Windows Server 2016, W32Time can be configured to reach time accuracy of 1 s, 50 ms or 1 ms under certain specified operating conditions.[42][40][43]

OpenNTPD

In 2004, Henning Brauer presented OpenNTPD, an NTP implementation with a focus on security and encompassing a privilege separated design. Whilst it is aimed more closely at the simpler generic needs of OpenBSD users, it also includes some protocol security improvements while still being compatible with existing NTP servers. A portable version is available in Linux package repositories.

Ntimed

Ntimed was started by Poul-Henning Kamp in 2014 and abandoned in 2015.[44] The implementation was sponsored by the Linux Foundation.[45]

NTPsec

NTPsec is a fork of the reference implementation that has been systematically security-hardened. The fork point was in June 2015 and was in response to a series of compromises in 2014. The first production release shipped in October 2017.[46] Between removal of unsafe features, removal of support for obsolete hardware, and removal of support for obsolete Unix variants, NTPsec has been able to pare away 75% of the original codebase, making the remainder easier to audit.[47] A 2017 audit of the code showed eight security issues, including two that were not present in the original reference implementation, but NTPsec did not suffer from eight other issues that remained in the reference implementation.[48]

chrony
chronyc, showing sources and activity information. Terminal window under Arch Linux

chrony comes by default in Red Hat distributions[49] and is available in the Ubuntu repositories.[50] chrony is aimed at ordinary computers, which are unstable, go into sleep mode or have intermittent connection to the Internet.[51] chrony is also designed for virtual machines, a much more unstable environment. It is characterized by low resource consumption (cost) and supports Precision Time Protocol hardware for greater timestamp precision.[52] It has two main components: chronyd, a daemon that is executed when the computer starts, and chronyc, a command line interface to the user for its configuration. It has been evaluated as very safe and with just a few incidents,[53] its advantage is the versatility of its code, written from scratch to avoid unnecessary complexity.[54] Support for Network Time Security (NTS) was added on version 4.0.[55] chrony is available under GNU General Public License version 2, was created by Richard Curnow in 1997 and is currently maintained by Miroslav Lichvar.[56]

Leap seconds

On the day of a leap second event, ntpd receives notification from either a configuration file, an attached reference clock, or a remote server. Although the NTP clock is actually halted during the event, because of the requirement that time must appear to be strictly increasing, any processes that query the system time cause it to increase by a tiny amount, preserving the order of events. If a negative leap second should ever become necessary, it would be deleted with the sequence 23:59:58, 00:00:00, skipping 23:59:59.[57]

An alternative implementation, called leap smearing, consists in introducing the leap second incrementally during a period of 24 hours, from noon to noon in UTC time. This implementation is used by Google (both internally and on their public NTP servers) and by Amazon AWS.[58]

Security concerns

Only a few other security problems have been identified in the reference implementation of the NTP codebase, but those that appeared in 2009 were cause for significant concern.[59][60] The protocol has been undergoing revision and review throughout its history. The codebase for the reference implementation has undergone security audits from several sources for several years.[61]

A stack buffer overflow exploit was discovered and patched in 2014.[62] Apple was concerned enough about this vulnerability that it used its auto-update capability for the first time.[63] Some implementation errors are basic, such as a missing return statement in a routine, that can lead to unlimited access to systems that are running some versions of NTP in the root daemon. Systems that do not use the root daemon, such as those derived from Berkeley Software Distribution (BSD), are not subject to this flaw.[64]

A 2017 security audit of three NTP implementations, conducted on behalf of the Linux Foundation's Core Infrastructure Initiative, suggested that both NTP[65][66] and NTPsec[67] were more problematic than Chrony[68] from a security standpoint.[69]

NTP servers can be susceptible to man-in-the-middle attacks unless packets are cryptographically signed for authentication.[70] The computational overhead involved can make this impractical on busy servers, particularly during denial of service attacks.[71] NTP message spoofing from a man-in-the-middle attack can be used to alter clocks on client computers and allow a number of attacks based on bypassing of cryptographic key expiration.[72] Some of the services affected by fake NTP messages identified are TLS, DNSSEC, various caching schemes (such as DNS cache), Border Gateway Protocol (BGP), Bitcoin and a number of persistent login schemes.[73][74]

NTP has been used in distributed denial of service attacks.[75][76] A small query is sent to an NTP server with the return IP address spoofed to be the target address. Similar to the DNS amplification attack, the server responds with a much larger reply that allows an attacker to substantially increase the amount of data being sent to the target. To avoid participating in an attack, NTP server software can be upgraded or servers can be configured to ignore external queries.[77]

To improve NTP security, a secure version called Network Time Security (NTS) was developed and currently supported by several time servers.[78][79][80]

See also

Notes
  1. Telecommunication systems use a different definition for clock strata.
  2. 2−64 seconds is about 54 zeptoseconds (light would travel 16.26 picometers, or approximately 0.31 × Bohr radius), and 264 seconds is about 585 billion years.

References
  1. David L. Mills (12 December 2010). Computer Network Time Synchronization: The Network Time Protocol. Taylor & Francis. pp. 12–. ISBN 978-0-8493-5805-0. Archived from the original on 18 July 2014. Retrieved 16 October 2016.
  2. "Executive Summary: Computer Network Time Synchronization". Archived from the original on 2011-11-02. Retrieved 2011-11-21.
  3. "NTP FAQ". The NTP Project. Archived from the original on 2011-09-06. Retrieved 2011-08-27.
  4. "Port Numbers". The Internet Assigned Numbers Authority (IANA). Archived from the original on 2001-06-04. Retrieved 2011-01-19.
  5. D. Mills; J. Burbank; W. Kasch (August 2010). J. Martin (ed.). Network Time Protocol Version 4: Protocol and Algorithms Specification. Internet Engineering Task Force (IETF). doi:10.17487/RFC5905. ISSN 2070-1721. RFC 5905. Proposed Standard. Obsoletes RFC 1305, 4330. Updated by RFC 7822, 8573 and 9109.
  6. David L. Mills (March 1992). Network Time Protocol (Version 3) - Specification, Implementation and Analysis. Network Working Group. doi:10.17487/RFC1305. RFC 1305. Obsolete. Obsoleted by RFC 5905. Obsoletes RFC 958, 1059 and 1119.
  7. D. Franke; D. Sibold; K. Teichel; M. Dansarie; R. Sundblad (September 2020). Network Time Security for the Network Time Protocol. Internet Engineering Task Force (IETF). doi:10.17487/RFC8915. ISSN 2070-1721. RFC 8915. Proposed Standard.
  8. D. Mills (September 1985). Network Time Protocol (NTP). Network Working Group. doi:10.17487/RFC0958. RFC 958. Obsolete. Obsoleted by RFC 1059, 1119 and 1305.
  9. D. Mills (July 1988). Network Time Protocol (Version 1) Specification and Implementation. Network Working Group. doi:10.17487/RFC1059. RFC 1059. Obsolete. Obsoleted by RFC 1119 and 1305.
  10. D. Mills (September 1989). Network Time Protocol (Version 2) Specification and Implementation. Network Working Group. doi:10.17487/RFC1119. RFC 1119. Obsolete. Obsoleted by RFC 1305. Obsoletes RFC 958 and 1059.
  11. T. Mizrahi; D. Mayer (March 2016). Network Time Protocol Version 4 (NTPv4) Extension Fields. IETF. doi:10.17487/RFC7822. ISSN 2070-1721. RFC 7822. Informational. Updates RFC 5905.
  12. RFC 1361 Simple Network Time Protocol (SNTP), August 1992.
  13. RFC 1769 Simple Network Time Protocol (SNTP), March 1995.
  14. RFC 2030 Simple Network Time Protocol (SNTP) Version 4 for IPv4, IPv6 and OSI, October 1996.
  15. RFC 4330 Simple Network Time Protocol (SNTP) Version 4 for IPv4, IPv6 and OSI, January 2006
  16. RFC 778 DCNET Internet Clock Service, April 1981.
  17. D.L. Mills (25 February 1981), Time Synchronization in DCNET Hosts, archived from the original on 1996-12-30
  18. "TIMED(8)", UNIX System Manager's Manual, archived from the original on 2011-07-22, retrieved 2017-09-12
  19. David L. Mills (October 1991). "Internet Time Synchronization: The Network Time Protocol" (PDF). IEEE Transactions on Communications. 39 (10): 1482–1493. doi:10.1109/26.103043. Archived (PDF) from the original on 2016-06-10. Retrieved 2017-11-06.
  20. David L. Mills (March 1992). Network Time Protocol (Version 3) - Specification, Implementation and Analysis. Network Working Group. doi:10.17487/RFC1305. RFC 1305. Obsolete. The clock-selection procedure was modified to remove the first of the two sorting/discarding steps and replace with an algorithm first proposed by Marzullo and later incorporated in the Digital Time Service. These changes do not significantly affect the ordinary operation of or compatibility with various versions of NTP, but they do provide the basis for formal statements of correctness.
  21. David L. Mills (15 November 2010). Computer Network Time Synchronization: The Network Time Protocol on Earth and in Space, Second Edition. CRC Press. p. 377. ISBN 978-1-4398-1464-2.
  22. "Future Plans", Network Time Synchronization Research Project, archived from the original on 23 December 2014, retrieved 24 December 2014
  23. "NTP Needs Money: Is A Foundation The Answer?". InformationWeek. March 23, 2015. Archived from the original on April 10, 2015. Retrieved April 4, 2015.
  24. "NTP's Fate Hinges On 'Father Time'". InformationWeek. March 11, 2015. Archived from the original on April 10, 2015. Retrieved April 4, 2015.
  25. RFC 5905, p. 21
  26. "Network Time Protocol: Best Practices White Paper". Archived from the original on 1 October 2013. Retrieved 15 October 2013.
  27. "'ntpq -p' output". NLUG.ML1.co.uk. Archived from the original on 2018-11-12. Retrieved 2018-11-12.
  28. David L. Mills (12 May 2012). "The NTP Era and Era Numbering". Archived from the original on 26 October 2016. Retrieved 24 September 2016.
  29. W. Richard Stevens; Bill Fenner; Andrew M. Rudoff (2004). UNIX Network Programming. Addison-Wesley Professional. pp. 582–. ISBN 978-0-13-141155-5. Archived from the original on 2019-03-30. Retrieved 2016-10-16.
  30. "How NTP Represents the Time (Computer Network Time Synchronization)". Archived from the original on 2017-06-15. Retrieved 2018-07-20.
  31. "A look at the Year 2036/2038 problems and time proofness in various systems". 14 March 2017. Archived from the original on 2018-07-21. Retrieved 2018-07-20.
  32. University of Delaware Digital Systems Seminar presentation by David Mills, 2006-04-26
  33. Gotoh, T.; Imamura, K.; Kaneko, A. (2002). "Improvement of NTP time offset under the asymmetric network with double packets method". Conference Digest Conference on Precision Electromagnetic Measurements. Conference on Precision Electromagnetic Measurements. pp. 448–449. doi:10.1109/CPEM.2002.1034915. ISBN 0-7803-7242-5.
  34. "Pentest-Report NTP 01.2017" (PDF). Cure53. 2017. Archived (PDF) from the original on 2018-12-01. Retrieved 2019-07-03.
  35. "Network Time Protocol Version 4: Protocol and Algorithms Specification". June 2010. p. 54. Archived from the original on 2012-09-10. Retrieved 2012-08-26. Primary servers and clients complying with a subset of NTP, called the Simple Network Time Protocol (SNTPv4) [...], do not need to implement the mitigation algorithms [...] The fully developed NTPv4 implementation is intended for [...] servers with multiple upstream servers and multiple downstream servers [...] Other than these considerations, NTP and SNTP servers and clients are completely interoperable and can be intermixed [...]
  36. Simple Network Time Protocol (SNTP) Version 4 for IPv4, IPv6 and OSI. doi:10.17487/RFC4330. RFC 4330.
  37. "Windows Time Service Technical Reference". technet.microsoft.com. 2011-08-17. Archived from the original on 2011-09-06. Retrieved 2011-09-19.
  38. "Windows Time Service page at NTP.org". Support.NTP.org. 2008-02-25. Archived from the original on 2017-05-14. Retrieved 2017-05-01.
  39. "How the Windows Time Service Works". technet.microsoft.com. 2010-03-12. Archived from the original on 2011-09-24. Retrieved 2011-09-19.
  40. "Support boundary to configure the Windows Time service for high accuracy environments". Microsoft. 2011-10-19. Archived from the original on 2009-01-12. Retrieved 2008-12-10.
  41. Ned Pyle (2007-10-23). "High Accuracy W32time Requirements". Microsoft. Archived from the original on 2012-10-17. Retrieved 2012-08-26.
  42. "Windows Server 2016 Accurate Time". technet.microsoft.com. Archived from the original on 2016-12-02. Retrieved 2016-12-07.
  43. dahavey. "Support boundary for high-accuracy time". docs.microsoft.com. Retrieved 2021-07-24.{{cite web}}: CS1 maint: url-status (link)
  44. Poul-Henning, Kamp. "20140926 – Playing with time again". PHK's Bikeshed. Archived from the original on 20 December 2019. Retrieved 4 June 2015.
  45. Poul-Henning, Kamp. "Network time synchronization software, NTPD replacement". ntimed git repository README file. Github. Archived from the original on 2 August 2015. Retrieved 4 June 2015.
  46. "The Secure Network Time Protocol (NTPsec) Distribution". Archived from the original on 2019-01-13. Retrieved 2019-01-12.
  47. Liska, Allan (December 10, 2016). NTP Security: A Quick-Start Guide. Apress. pp. 80–. ISBN 978-1-4842-2412-0.
  48. "Pentest-Report NTPsec 01.2017" (PDF). Cure53. 2017. Archived (PDF) from the original on 2019-07-04. Retrieved 2019-07-03.
  49. Lichvar, Miroslav (20 July 2016). "Combining PTP with NTP to Get the Best of Both Worlds". Red Hat Enterprise Linux Blog. Red Hat. Archived from the original on 30 July 2016. Retrieved 19 November 2017. Starting with Red Hat Enterprise Linux 7.0 (and now in Red Hat Enterprise Linux 6.8) a more versatile NTP implementation is also provided via the chrony package
  50. Lichtenheld, Frank. "Package: chrony (2.1.1-1) [universe]". Ubuntu Package. Ubuntu Package. Archived from the original on 19 November 2017. Retrieved 19 November 2017. Versatile implementation of the Network Time Protocol
  51. Both, David. "Manage NTP with Chrony". Opensource.com. Archived from the original on 29 June 2019. Retrieved 29 June 2019.
  52. Lichvar, Miroslav (18 September 2018). "chrony – chrony.conf(5)". Chrony project. Chrony project. Retrieved 2 August 2020. This directive enables hardware timestamping of NTP packets sent to and received from the specified network interface.
  53. Heiderich, Mario (August 2017). "Pentest-Report Chrony 08.2017" (PDF). Cure53.de Team. wiki.mozilla.org, AKA MozillaWiki or WikiMO. Archived from the original (PDF) on 5 October 2017. Retrieved 19 November 2017. Withstanding eleven full days of on-remote testing in August of 2017 means that Chrony is robust, strong, and developed with security in mind.
  54. "Securing Network Time". Core Infrastructure Initiative, a Linux Foundation Collaborative Project. Core Infrastructure Initiative. 27 September 2017. Archived from the original on 28 October 2017. Retrieved 19 November 2017. In sum, the Chrony NTP software stands solid and can be seen as trustworthy
  55. "chrony/chrony.git - Official Git repository for the Chrony project". git.tuxfamily.org. Retrieved 2021-07-31.
  56. "chrony introduction". TuxFamily, a non-profit organization. chrony. Archived from the original on 9 December 2009. Retrieved 19 November 2017. The software is supported on Linux, FreeBSD, NetBSD, macOS, and Solaris.
  57. David Mills. "The NTP Timescale and Leap Seconds". Archived from the original on 7 September 2013. Retrieved 15 October 2013.
  58. "Google Developers Leap Smear". Archived from the original on 4 April 2019. Retrieved 4 April 2019.
  59. "Security Notice". Support.NTP.org. 2009-12-10. Retrieved 2011-01-12.
  60. "Cisco IOS Software Network Time Protocol Packet Vulnerability". Cisco Systems. 23 September 2009. Archived from the original on 11 June 2020. Retrieved 11 June 2020.
  61. "Code Audit". Support.NTP.org. 2009-06-13. Retrieved 2011-01-12.
  62. "Network Time Protocol Vulnerabilities (Update C) | ICS-CERT". Ics-cert.us-cert.gov. Archived from the original on 2014-12-20. Retrieved 2015-04-15.
  63. Cunningham, Andrew (Dec 23, 2014). "Apple automatically patches Macs to fix severe NTP security flaw". arstechnica. Archived from the original on April 15, 2015. Retrieved Apr 29, 2015.
  64. Fairhead, Harry (23 December 2014). "NTP The Latest Open Source Security Problem". I Programmer. Archived from the original on 24 December 2014. Retrieved 24 December 2014.
  65. NTP SecurityNotice Page Archived 2014-02-19 at the Wayback Machine
  66. NVD NIST Product Search NTP
  67. NVD NIST Product Search NTPsec Archived 2020-06-26 at the Wayback Machine
  68. NVD NIST Product Search Chrony Archived 2020-06-26 at the Wayback Machine
  69. "CII Audit Identifies Most Secure NTP Implementation". The Linux Foundation. September 28, 2017. Archived from the original on 2018-02-03. Retrieved 2019-07-03.
  70. Network Time Protocol Version 4: Autokey Specification. IETF. June 2010. doi:10.17487/RFC5906. RFC 5906.
  71. "NTP Security Analysis". Archived from the original on 7 September 2013. Retrieved 11 October 2013.
  72. Jose Selvi (2014-10-16). "Bypassing HTTP Strict Transport Security" (PDF). Archived from the original (PDF) on 2014-10-18. Retrieved 2014-10-16.
  73. Aanchal Malhotra; Isaac E. Cohen; Erik Brakke & Sharon Goldberg (20 October 2015). "Attacking the Network Time Protocol" (PDF). NDSS. Archived from the original (PDF) on 22 October 2015. Retrieved 27 October 2015.
  74. "Attacking the Network Time Protocol". www.cs.bu.edu. Archived from the original on 2015-10-24. Retrieved 2015-10-27.
  75. Goodin, Dan (2014-01-13). "New DoS attacks taking down game sites deliver crippling 100Gbps floods". Ars Technica. Archived from the original on 2014-01-24. Retrieved 2014-01-25.
  76. Lee, Dave (2014-02-11). "Huge Hack 'Ugly Sign of Future' for Internet Threats". BBC. Archived from the original on 2014-02-11. Retrieved 2014-02-12.
  77. "DRDoS / Amplification Attack using ntpdc monlist command". support.NTP.org. 2010-04-24. Archived from the original on 2014-03-30. Retrieved 2014-04-13.
  78. Langer, Martin (2019-12-05). "Setting up NTS-Secured NTP with NTPsec". Weberblog.net. Retrieved 2021-08-19.
  79. "How to use NTS | Netnod". Netnod. Retrieved 2021-08-19.{{cite web}}: CS1 maint: url-status (link)
  80. "nts.time.nl homepage". nts.time.nl. Retrieved 2021-08-19.

Further reading
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.